行動隨意網路中以多重中繼點達成路徑探索與修復之研究

行動無線隨意網路(Mobile Ad Hoc Networking)是指由一群具移動性的節點所動態組成的無線網路。此網路不需要如基地台等形式的基礎建設或集中式的管理設備，而是透過網路中的節點互相幫助將資訊繞送至目的端。而在行動無線隨意網路中，路由協定一直是相關研究中的重點項目，因為節點具有移動性，且在頻寬與能源都受到限制的環境下，如何建立理想的封包繞送路徑便成為最重要的課題。而路由協定中，亦有許多不同的問題需要克服，以需求式的距離向量路由協定AODV為例，路由的探索都是透過濫傳的方式進行，而濫傳所產生的控制封包，往往容易造成網路的壅塞，尤其是在節點數量或是連線數目上升時更為明顯，我們稱這個現象為廣播風暴。除此之外，已建立的路徑常因為節點的移動而損毀，在AODV中是以重新廣播路由探索封包的方式來重建或修補路由，這個做法的修復速度較慢且會耗費更多的控制封包。對於廣播風暴的問題，已有許多方法被提出，如多重中繼點廣播機制，而亦有許多多路徑或區域修復的機制，用來解決路徑損毀的問題，如AOMDV或AODV-ABR。但這些方法中，大部份都只有針對單一的問題進行深究，而未探討如何將廣播機制與路由機制作良好的結合。因此，在本論文中，將以多重中繼點的廣播機制與2-hop的區域修復機制結合，透過多重中繼點廣播機制減少廣播封包，並利用多重中繼點額外建立的2-hop鄰居表進行有效的區域修復。最後，再與其他利用多重中繼點的路由協定或是多路徑路由協定進行模擬與評估，實驗結果證明本論文所提出的方法，可以有效的修復路由且減少控制封包所消耗的頻寬。

關鍵字

行動無線隨意網路；需求式路由協定；區域修復；多重中繼點

並列摘要

MANET (Mobile Ad Hoc Networking) is a dynamic wireless network with a group of mobile nodes. This network does not need base stations and other forms of infrastructure or centralized management of devices but to send information to the destination through nodes cooperation of the network. In mobile wireless ad hoc networks, routing protocols research has been the focus of related field, because of node mobility and restriction of the bandwidth and energy. How to create the ideal packet routing path is the most important issue. There are many problems need to overcome in routing protocol. For example, in on-demand distance vector routing protocol (AODV), route of exploration is through flooding route request packet (RREQ), and the flooding packets often result in network congestion, particularly when the number of nodes or connections increase. We call this phenomenon as the Broadcast storm. In addition, the established path may broke frequently due to mobility. AODV will re-Broadcast route discovery packet to rebuild or repair route, but it is not an efficient way, because this procedure will consume more control packet. There are many methods have been proposed to solve Broadcast storm problem, such as multipoint relaying (MPR). And there are many multi-path or repair scheme to solve the damage issues of path, such as AOMDV or AODV-ABR. However, most of proposed methods are single goal chaser, but neglect of perfect combination of Broadcast scheme and routing repair scheme. In this thesis, we will combine multi-point relaying Broadcast scheme and 2-hop route repair scheme, through the multi-point relaying Broadcast scheme to reduce Broadcast packet, and use an additional 2-hop neighbor table to repair route. Finally, simulation results show that the proposed protocol can effectively repair the route and reduce bandwidth consumed by control packets.

並列關鍵字

Mobile Ad Hoc Networks ； On-demand Routing Protocol ； Local Repair ； Multi-point Relaying

參考文獻

[3] C. E. Perkins, E. M. Royer, “Ad hoc On-Demand Distance Vector (AODV) Routing,” Internet Draft, Mobile Ad Hoc Networking Working Group, March 2001.

[4] D. B. Johnson, D. A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” Mobile Computing, Chapter 5, ed. T. Imielinski and H. Korth, Kluwer Academic Publishers, pp.153-181, 1996.

[6] T. Clausen, P. Jacquet, Eds., “Optimized Link State Routing Protocol (OLSR),” RFC 3626, Oct. 2003.

[7] L. Liang, Y. A. Sekercioglu, N. Mani, “A Survey of Multipoint Relay Based Broadcast Schemes in Wireless Ad Hoc Networks,” IEEE Communications Surveys and Tutorials, vol. 8, no. 1-4, pp. 30-46, December 2006.

[10] M. K. Marina, S. R. Das, “On-demand Multipath Distance Vector Routing for Ad Hoc Networks,” Proceedings of the International Conference for Network Procotols, Riverside, November 2001, pp. 14-23.

國際替代計量

行動隨意網路中以多重中繼點達成路徑探索與修復之研究

全文下載

主題瀏覽