無線隨意網路中分段式行動預測

Segmental Mobility Prediction Algorithm

陳琮貿

指導教授 ： 莊謙本 ； 王宏鈴

國立臺灣師範大學/科技學院/工業教育學系/碩士(2007年)

摘要

傳統的DSR 與AODV 路由協定皆以最短路徑作為找尋目的地的路徑選擇策略，然而最短路徑並不一定是最有效率或最快的路徑。而DOA 則整合了DSR 與AODV 於分段網路拓樸之中。本論文係在隨意式無線網路(Ad Hoc Wireless Network)的環境下，採用DOA 路由協定分段管理的優點，利用GPS 訊號的輔助，計算出任意兩節點之間的可連線時間預測來做為繞送的參數，並利用GPS 的資訊來計算各節點的移動速率進而選出網路中速率低的節點作為中繼點。相對於一般路徑繞送機制而言，本文所提出的分段式行動預測演算法，有效的降低路由的Control overhead，並增加Packet Delivery Ratio，提升了整體路由繞送的穩定度。

關鍵字

最短路徑 ； 路由協定

並列摘要

Traditional DSR and AODV routing protocol use the shortest path routing as the police to find the destination of the path chosen strategy. However shortest path routing isn’t the fastest or most efficient path to the destination. DOA is the integration of DSR and AODV in subparagraph network topology. This paper reports that using GPS signals support, calculated between the two nodes can be connected around the time forecast to do so on the Ad Hoc Wireless Network environment. And we compute node’s mobile rate thereby limiting the authority by using GPS information. Compared to ordinary route mechanisms, this paper proposed the mobility prediction algorithm in Ad Hoc Wireless Networks reduce control overhead effectively, increase Packet Delivery Ratio and improve the stability of overall network routing.

並列關鍵字

Ad hoc ； DSR ； AODV ； Shortest path ； Routing Protocol

參考文獻

[18]蕭義達, “Mobility Prediction Algorithm in Ad Hoc Wireless Networks”元智大學資訊工程學系碩士論文, 2002

[1]D. Johnson, D.A. Maltz, and J. Broch, 2002, The Dynamic Source Routing Protocolfor Mobile Ad Hoc Networks , in MANETWorking Group. IETF, Internet Draft.

[2]C. C. Chiang, “Routing on Clustered Multihop Mobile Wireless Networks with Fading Channel,” Proc. IEEE SICON ’97, pp.197-211, Apr. 1997.

[5]D. B. Johnson and D. A. Maltz, and J. Broch “Dynamic Source Routing in Ad Hoc Wireless Networks(DSR),” Mobile Ad-hoc Network Working Group, IETF Internet-Draft ,Feb. 2002.

[6]R. Dube et al., “Signal Stability-Based Adaptive Routing (SSA) for Ad-Hoc Mobile Networks,” IEEE Pers. Commun., pp.36-45, Feb. 1997.