行動隨意網路中整合動態備用路徑路由協定之快取機制

行動隨意網路（Mobile Ad Hoc Network）是由行動節點（Mobile Node）動態地聚集而形成的，因此，行動隨意網路的網路拓樸會隨著行動節點的移動而自行調適。在行動隨意網路的環境中，由於資料封包的交換是透過所有的行動節點互相地轉送來達成，所以，行動節點不需要基地台（Base Station）或存取器（Access Point）的輔助，就能夠彼此間相互地通訊。為了要克服行動隨意網路這種先天的特性，本篇論文提出了動態備用路徑路由協定以及一個整合性的快取機制。動態備用路徑路由協定是一種隨選路徑路由協定（On-demand Routing Protocol），它可以在一段被給定的時間內建立許多的備用路徑，這些用來設定備用路徑的資訊可以儲存在資料繞送路徑中的節點上，當來源節點到目的節點之間的路徑連結斷裂時，備用路徑可以快速地取代原有的繞送路徑，讓路徑可以很快的恢復連結，資料能夠快速地重新繼續傳輸，透過論文中模擬的結果顯示，動態備用路徑路由協定比其他路由協定更能夠改善路由的品質。本篇論文也同時提出了一個整合動態備用路徑路由的快取機制，藉由此機制的幫助之下，可以將重複出現在行動隨意網路中的資料與資料的存取路徑快取（Cache）在某些特定的行動節點上，如此可以縮短存取資料的路徑，進而加快資料的存取時間，並提高資料的重複使用率，來達到節省網路傳輸頻寬以及行動節點電池能源的消耗。

關鍵字

行動隨意網路；多重路徑；快取機制；備用路徑；無線網路；路由協定

並列摘要

A Mobile Ad Hoc Network (MANET) is a self-organizing and adaptive wireless network constructed by the dynamic gathering of mobile nodes. The communication among mobile nodes in MANETs is carried out without base stations or access points and the transmission of data packets is completed through relays among nodes. Due to the mobility of mobile nodes, the topology of a MANET frequently changes and thus results in the disability of on-the-fly data transmission routes. To cope with the intrinsic properties of MANETs, Dynamic Backup Routes Routing Protocol (DBR^2P) and an integrated Cache-Based Mechanism are proposed in this dissertation. DBR^2P is an on-demand backup routing protocol which can set up many backup routes to reach a destination node in a given period of time. The information of backup routes can be saved in a specific on-the-route node and enables backup routes to be found immediately in situation regarding disconnection. When a link fails, routes from the source node to the destination node are analyzed to obtain backup routes and to sustain quick reconnection. As a result, DBR^2P could more thoroughly improve the quality of routing than previous routing protocols. Furthermore, with the aid of the proposed integrated Cache-Based Mechanism, repetition of data and data paths occurring in a MANET could be cached in some special mobile nodes. Therefore, routes and time span to access data are shortened. The data reusable rate is also enhanced to reduce the consumption of bandwidth and battery power.

並列關鍵字

Ad hoc networks ； backup routes ； cache ； caching mechanisms ； multiple routes ； routing protocols ； wireless networks

參考文獻

[Chiang1997] C. C. Chiang, “Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel,” Proc. of the IEEE Sicon’97, pp. 197-211, Apr. 1997.

[Boukerche2000] A. Boukerche, A. Fabbri, and S. K. Das, “Analysis of Randomized Congestion Control in DSDV Routing,” Proc. of the 8th Int’l Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp. 65-72, 2000.

[Broch1998] J. Broch, D. A. Maltz, D. B. Johnson, Y. C. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proc. of the Mobicom’98, pp. 85-97, 1998.

[Cho2003] Joonho Cho, Seungtaek Oh, Jaemyoung Kim, Hyeong Ho Lee, and Joonwon Lee, “Neighbor Caching in Multi-hop Wireless Ad hHoc Networks,” IEEE Communications Letters, Vol. 7, Iss. 11, pp. 525-527, Nov. 2003.

[Chuang2003] S. N. Chuang, T. S. Chan, J. Cao, R. Cheung and R. Cheung, “Dynamic Service Reconfiguration for Wireless Web Access,” Proc. of the Int’l WWW conference, pp. 58-67, 2003.

國際替代計量

行動隨意網路中整合動態備用路徑路由協定之快取機制

全文下載

主題瀏覽