臺灣博碩士論文加值系統

行動隨意網路是一種自組性的網路，它是由許多個行動節點組合而成的，形成一種動態的網路拓樸，每個行動節點都是行動路由器和行動用戶端，封包的傳送是藉著節點之間多點跳躍的方式傳送封包，而且不具有任何固定式基礎建設或是中央集權管理者，所以它可快速的部署完成，適合運用在緊急事故上，例如：緊急救難、軍事用途等，所使用的網路不再是只有兩點之間的溝通，而是群體的通訊，群播網路在此環境下扮演著極重要的角色。由於手持式裝置的計算能力有限，以樹狀式拓撲較佳，可是樹狀式的拓樸常因節點的移動性，使得路徑失效而降低傳送率。
本論文提出以調變式緩衝區間的主動路由維護策略，探討如何在群播行動隨意網路以樹狀式的拓樸之下，利用調變式緩衝區間維護路由，以減少移動性之影響。在需求式群播距離向量路由策略的路徑維護方面，若在一段時間內沒有接收到上游節點所傳送出來的任何封包時，節點才會發現路由已經失效，並開始啟動區域修補路由，如此被動式路由維護的方法，容易遺失封包而降低傳送率。本文提出的調變式緩衝區間的主動路由維護策略係藉由節點之間傳送訊息時，感測出對方節點的所發出訊息之信號強度，計算兩節點之間的距離和背離速度，再以背離速度來控制緩衝區間，若上游節點移動到節點的緩衝區之內，則開始啟動區域修補路由，以減少路由失效。
經由模擬結果，本文提出之調變式緩衝區間的主動路由維護策略，改善了需求式群播距離向量路由的維護策略，減少路由失效的機率、提升傳輸效率和降低傳輸封包成本。

Mobile Ad Hoc Network (MANET) is a self configuring network of nodes that consists of mobile routers and mobile users. The mobile nodes are programmed to instantly self-organize into a network topology without support from network infrastructure or centralized control. Packets are routed via multi-hop peer-to-peer protocol between nodes to transmit the data. MANETs are ideal in advanced applications such as emergency rescue operations, instant urban wireless coverage, temporary social event networks, and military digitized battlefields. In such events, nodes are expected to collaborate and communicate as a group rather than as pairs of point-to-point. The multicast characteristic of MANETs serves as a critical functionality to support these applications. Because the capability of each mobile device is limited, the tree-based topology of multicast network delivers better performance. However, the mobility of mobile nodes often break links in the tree-based topology which cause lower data packet ratio.
In this paper, we propose “Pro-active Route Maintenance with Adaptive Buffer Zone” to reduce link breakage for the tree-based topology of multicast network in MANET. The Multicast Ad hoc On-demand Distance Vector (MAODV) method of route maintenance detects link breakage when the node does not receive any packets from the upstream node after certain time. This kind of re-active route maintenance does not initiate local tree repair until the node loses packets and reduces data packet delivery ratio. This paper proposes adding a link breakage prediction algorithm to the MAODV. The node would use signal power strength from the received packets to compute the distance and the deviating speed of the upstream node. The deviating speed of upstream node is used to compute the range of the buffer zone. When the upstream node enters the buffer zone, the node initiates local tree repair to reduce potential route failure.
According to the simulation results, the usage of Pro-active Route Maintenance with Adaptive Buffer Zone in MAODV improves the route maintenance of the MAODV. We analyze the six strategies with six matrices. Experiments demonstrate that adding link breakage prediction to the MAODV can increase data packet delivery ratio and reduce control overhead cost.

第一章 緒論 1
1.1 研究動機 2
1.2 研究目的 3
1.3 論文架構 3
第二章 隨意式群播網路 4
2.1 隨意式群播協定 4
2.1.1 樹狀式群播協定 7
2.1.2 網狀式群播協定 8
2.2 需求式群播距離向量路由協定 10
2.3 小結 16
第三章 調變式緩衝區間之主動式路由維護 17
3.1 緩衝區間 17
3.2 無線電播廣模型 19
3.3 路由失效預測策略與演算法 20
3.3.1 預測演算法 22
3.3.2 實例說明 24
第四章 系統模擬與分析 26
4.1 模擬環境設定 26
4.2 效能評估因子 28
4.3 模擬結果與分析 30
4.3.1 以節點移動速度之評量 30
4.3.2 以群組大小之評量 42
第五章 結論與未來方向 54
參考文獻 55
附錄 其他模擬結果數據 57

[1]A. Adams, J. Nicholas, and W. Siadak, “Protocol Independent Multicast - Dense Mode (PIM-DM),” Request For Comments 3973, Jan. 2005.

[2]A. L. Cavilla,“MANET extensions to ns2,” http://www.cs.toronto.edu/~andreslc/publications/ MANET_extensions.pdf.

[3]C. Bettstetter, G, Resta, and P. Santi, “The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks,” Mobile Computing, IEEE Transactions on, 2003.

[4]C. de Morais Cordeiro, H. Gossain and D.P. Agrawal, “Multicast over wireless mobile ad hoc networks: present and future directions,” IEEE Network, Volume 17, Issue 1, Page(s):52 – 59, Jan.-Feb. 2003.

[5]C. E. Perkins and E.M. Royer, “Ad Hoc On-Demand Distance Vector Routing,” Proceedings of IEEE Workshop on Mobile Computing Systems and Applications 1999, pp. 90-100, Feb. 1999.

[6]C. Siva Ram Murthy and B. S. Manoj, “Ad Hoc Wireless Networks Architectures and Protocols,” Prentice Hall, 2004.

[7]C. W. Wu, Y. C. Tay, and C. K. Toh, “Ad Hoc Multicast Routing Protocol Utilizing Increasing id-numberS (AMRIS) Functional Specification,” Internet draft (work in progress), draft-ietf-manet-amris-spec-00.txt, Nov. 1998.

[8]Dharma P. Agrawal and Qing-An Zeng, “Introduction to Wireless and Mobile Systems,” Thomson Brooks, 2003.

[9]D. Waitzman, C. Partridge, and S. Deering, “Distance Vector Multicast Routing Protocol (DVMRP),” Request For Comments 1075, Nov. 1988.

[10]E. Bommaiah et al., “AMRoute: Adhoc Multicast Routing Protocol,” Internet draft, Aug. 1998.

[11]E. M. Royer and C. E. Perkins, “Multicast Operation of the Ad Hoc On Demand Distance Vector Routing Protocol,” ACM MOBICOM, Aug. 1999, pp. 207–18.

[12]E. M. Royer and C. E. Perldns., Multicast Ad Hoc On- Demand Distance Vector (MAODV) Routing. Internet Draft, draft-ietf-manet-maodv-00.txt, work in progress, July 2000.

[13]J. J. Garcia-Luna-Aceves and E.L. Madruga, “The Core-Assisted Mesh Protocol,” IEEE JSAC, pp. 1380–94, Aug. 1999.

[14]J. Moy, “Multicast Extensions to OSPF (MOSPF),” Request For Comments 1584, Mar. 1994.

[15]M. Gerla, S.-J. Lee, and W. Su. “On-Demand Multicast Routing Protocol(ODMRP) for Ad Hoc Networks,” Internet draft, draft-ietf-manet-odmrp-02.txt, 2000.

[16]S. Corson, and J. Macker, “Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations,” Request For Comments 2501, Jan. 1999.

[17]The Network Simulator - ns-2 [Online], Available: http://www.isi.edu/nsnam/ns/

[18]Y. Zhu and T. Kunz, “MAODV Implementation for NS-2.26,” Systems and Computing Engineering, Carleton University, technical report sce-04-01, Jan. 2004.

[19]林傑斌, 秦美惠, 羅傑克, “WLAN行動通訊網路”文魁資訊, 三月, 2003.