臺灣博碩士論文加值系統

隨意型無線網路是一種無線、具行動能力且可在任何時間及任何地點快速架構完成的一種網路結構，在此架構中，資料傳輸的路徑常常會因為無線節點的移動或電量耗盡而斷裂，所以路徑重建的機制在此領域中是一項十分重要的議題。在本篇論文中，我們提出一個新型的路由協定，其利用事先部署的固定節點(稱為支援節點)來支援傳輸路徑中可能斷裂的連結，使該傳輸路徑的存活時間得以延長，因而有效地減少路徑搜尋程序執行的次數，並減少整體網路的平均流量。在模擬結果中顯示，我們提出的方法不論在網路控制封包的數量或是網路平均存活時間都將優於現有兩類廣泛使用的路由協定。

Ad hoc networks are wireless, mobile networks that can be set up anywhere and anytime. Each mobile host in that environment may move randomly and the movement of hosts may result in a break for the route. Therefore, the mechanism for reconstructing a new route is an important issue in Ad hoc networks.
In this thesis, we propose a novel routing protocol that utilizes some fixed hosts called supporting nodes. Supporting nodes can dynamically support a weak link (a link between two adjacent hosts which may become invalid in a short time due to mobility) to extend the life time of the route. Then, the number of route discovery process can be reduced and the average network traffic will be further minimized. The simulation results show that our proposed approach outperforms several existing schemes both in reducing the total number of network control packets and increasing the average life time of the network.

一、緒論 1
1.1 研究背景 1
1.2 研究動機及目的 3
1.3 章節概要 4
二、相關研究探討 6
2.1 隨意型無線網路中的路由協定 6
2.1.1 AODV [3] 6
2.1.2 DSDV [4] 8
2.1.3 FORP [8] 9
三、動態支援機制 11
3.1 系統架構 11
3.2 動態支援路由協定 13
3.2.1 剩餘連線時間最長路徑的建立 13
3.2.2 支援請求 14
四、模擬與效能評估分析 19
4.1 模擬參數設定 19
4.2 模擬數據分析 20
4.2.1 平均連線存活時間分析 20
4.2.2 支援成功機率分析 21
4.2.3 平均路徑長度分析 24
4.2.4 控制封包數目分析 25
五、結論與未來展望 27
5.1 結論 27
5.2 未來展望 28
參考文獻 30

[1]J. Broch, D. Maltz, D. Johnson, Y.-C. Hu, and J. Jetcheva, “A Performance Comparison of Multihop Wireless Ad Hoc Network Routing Protocols, ” Proc. ACM/IEEE Int'l Conf. Mobile Computing and Networking (MobiCom), Oct. 1998.
[2]C. Cheng, R. Riley, S. Kumar, J. Garcia-Lunes-Aceves, “A Loop-Free Extended Bellman-Ford Routing Protocol Without Bouncing Effect.”, In Proceedings of ACM Sigcomm, pages 224--236, August 1989
[3]Charles E. Perkins, Elizabeth M. Royer “Ad-hoc on-Demand Distance Vector Routing” Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, February 1999, pp. 90-100.
[4]Charles E, Perkins, Pravin Bhagwat, “Highly dynamic Destination-Sequenced Distance-vector routing (DSDV) for mobile computers.”, In Proc. ACM SIGCOMM Conference (SIGCOMM ’94), pages 234-244, August 1993
[5]E. Royer, C-K. Toh. “A review of current routing protocols for ad-hoc mobile wireless networks.”, IEEE Personal Communications Magazine, pages 46--55, April 1999.
[6] J.P. Macker and M.S. Corson, “Mobile ad hoc networking and the IETF,” ACM Mobile Computing and Communications Review, 2(3):7-9, July 1998.
[7]USCG Navigation Center GPS page November 2003, http://www.navcen.uscg.gov/gps/default.htm
[8]W. Su, S. J. Lee, M. Gerla, “Mobility Prediction in Wireless Networks”, Proc.,MILCOM, Oct 2000, Volume 1, pp. 491 -495
[9]Charles E, Perkins, Pravin Bhagwat, “Highly dynamic Destination-Sequenced Distance-vector routing (DSDV) for mobile computers.c, In Proc. ACM SIGCOMM Conference (SIGCOMM ’94), pages 234-244, August 1993
[10]Royer, E.M. , Chai-Keong Toh, “A review of current routing protocols for ad hoc mobile wireless networks.”, IEEE Personal Communication, Volume: 6 Issue: 2, April 1999.
[11]Josh Broch, David Johnson, and David Maltz, “The Dynamic Source Routing Protocol for Mobile Ad hoc Networks.”, http://www.ietf.org/internet-drafts/ draft-ietfmanet-dsr-01.txt, Dec 1998. IETF Internet Draft (workin progress).
[12]Violet R. Syrotiuk, Barry A. Woodward, “A Distance Routing Effect Algorithm for Mobile (DREAM).”, In Proc. ACM/IEEE MobiCom, pages 76-84, October 1998.
[13]Young-Bae Ko and Nitin H. Vaidya, "Location-Aided Routing(LAR) in Mobile Ad hoc Networks," ACM/Baltzer Wireless Networks (WINET) journal, Vol.6-4, 2000 - Extended version of the Mobicom'98 paper.
[14]Z. J. Haas and M. R. Pearlman, "The Zone Routing Protocol (ZRP) for Ad Hoc Networks", Internet Draft draft-zonerouting-protocol-01.txt, Aug, 1998.