Responsive image
博碩士論文 etd-0627107-164416 詳細資訊
Title page for etd-0627107-164416
論文名稱
Title
在無線隨意式網路上使用MAODV的群播路徑修復策略
Multicast Link Repair Strategy with MAODV in Wireless Ad Hoc Networks
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
66
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2007-06-22
繳交日期
Date of Submission
2007-06-27
關鍵字
Keywords
無線隨意式網路、群播協定
MAODV, Ad Hoc, Multicast, Local Repair, Tree Degree
統計
Statistics
本論文已被瀏覽 5677 次,被下載 1959
The thesis/dissertation has been browsed 5677 times, has been downloaded 1959 times.
中文摘要
MAODV是無線Ad Hoc網路的群播協定,擁有和AODV共用控制封包的優點,MAODV雖然有Control Overhead低和單一路徑較有效率的優點,但是在移動速度快的情況下,PDR(Packet Delivery Ratio)會快速的下降,這是因為MAODV的修復機制缺乏效率,而MAODV由鏈路斷裂的下游節點重新加入的修復機制,也增加了多餘的Control Overhead和封包碰撞的機會,在本論文中,我們提出一套MLRS(Multicast Link Repair Strategy),其主要的特點是由鏈路斷裂的上游節點負責鏈路的修復,我們稱為Local Repair,我們在Local Repair裡新增修復封包,加入鏈路斷裂下游節點的位址,讓收到修復封包的節點可以提早判斷上游鏈路是否已經斷裂,達到預先的鏈路修復。由於我們設計的Local Repair會往上游執行到Branch Node時便停止,我們利用修改過的GRPH封包,傳遞到Branch Node的Hop Count給所有節點,以計算出Local Repair所需要的時間。最後我們用NS-2來驗證MLRS,並且將模擬環境中的群播樹拓墣分為不同的Degree,來分析不同Degree的群播樹對MLRS機制的影響。結果顯示我們的機制提高了移動節點的PDR,並且有較少的Control Overhead,而對於因上游節點移動而斷線的所有下游節點,在MLRS的機制下也有比較高的PDR。
Abstract
MAODV is a multicast version of AODV, a routing protocol in wireless Ad Hoc network. MAODV can use the same control packets as in AODV. Although MAODV can provide more efficient path, its ineffective link repair scheme may drastically decrease PDR (Packet Delivery Ratio) in the situation of node mobility. This ineffective repair scheme also increases redundant control overhead and the probability of packet collision. In this Thesis, a new link repair scheme, MLRS (Multicast Link Repair Strategy), based on the MAODV, is proposed. The main characteristic of MLRS is Local Repair which allows upstream node of a broken link to do the repair. In Local Repair, we add the IP address of a broken downstream node in the control packet. The upstream node of a broken link will broadcast the control packet. Any node that receives the control packet can determine if its upstream link is broken. The similar Local Repair scheme is applied to the upstream node until a branch node is reached. We use a modified GRPH packet to deliver the information of hop count from a branch node to all the nodes on the multicast tree. A node that receives the GRPH can estimate the duration of Local Repair. For the purpose of evaluation, we use NS-2 to simulate the MLRS. We classify the multicast tree topology with different degrees to analyze their effects on the MLRS. The simulation results show that the MLRS increases the PDR of fast-moving nodes and it also reduces the control overhead. Moreover, the MLRS increases the PDR of broken nodes due to upstream node mobility.
目次 Table of Contents
第一章 導論
1.1 研究動機
1.2 研究方向與方法
1.3 章節介紹
第二章 無線隨意式網路的群播協定
2.1 Mesh-based Multicast Protocol
2.1.1 ODMRP
2.1.2 FGMP 5
2.1.3 Mesh-based相關研究
2.2 Tree-based Multicast Protocol
2.2.1 AMRoute
2.2.2 AMRIS
2.2.3 MAODV
2.2.3.1 Control Packet Type
2.2.3.2路徑建立流程
2.2.3.3 MAODV路徑修復方法
2.2.3.4 MAODV路徑修復的缺點
2.2.4 Tree-based相關研究
2.3 其他方法
2.4 本論文提出的方法
第三章 新的MAODV路徑修復機制-MLRS
3.1 Multicast Link Repair Strategy
3.1.1 新增的Multicast Routing Table Entry
3.1.2 增加與修改的Control Packets
3.1.3 發現斷線的處理
3.1.4 修復封包的傳遞
3.2 MLRS的優點
第四章 模擬分析與結果
4.1 NS-2 MAODV模組的修改
4.2模擬環境
4.3模擬結果
4.3.1節點移動方向對PDR的影響
4.3.2 Control Overhead的比較
4.3.3斷線下游節點的PDR比較
第五章 結論與未來工作的方向
5.1 結論
5.2 未來工作
REFERENCES
Index
參考文獻 References
[1]Y. Yi, S. J. Lee, W. Su, and M. Gerla, ”On-demand Multicast Routing Protocol (ODMRP) for Ad Hoc Networks." Internet Draft, draft-ietf -manet-odmrp-00.txt, Mar. 2003.
[2]C. C. Chiang, M. Gerla, and L. Zhang, “Forwarding Group Multicast Protocol (FGMP) for Multihop, Mobile Wireless Networks,” ACM/Baltzer Journal of Cluster Computing: Special Issue on Mobile Computing, vol. 1, no. 2, pp. 187-196, 1998.
[3]D. Galatchi and R. Zoican, ”A Multicast Routing Protocol for Multi-Hop Wireless Networks: ODMRP,“ The 7th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Services, pp.563 - 565, Sept. 2005.
[4]M. Nian and N. Wang, “A Dynamic Counter-Based Forwarding Scheme for ODMRP,” International Conference on Wireless Communications, Networking and Mobile Computing, pp.1 - 4, Sept. 2006.
[5]X. Xing, T. N. Uyen, and L. N. Hoang, “Preemptive Multicast Routing in Mobile Ad-hoc Networks,” Joint Conference on Networking and Mobile Communications and Learning Technologies, pp.68 - 68, April 2006.
[6]F. Yu, Y. Choi, B. Kim, K. Jung, H. Cho, and S. H. Kim, ”Stable On-demand Overlay Multicast in Mobile Ad Hoc Networks,” Asia-Pacific Conference on Communications, pp.1 - 5, Aug. 2006.
[7]A. Sobeih, H. Baraka, and A. Fahmy, ”ReMHoc: A Reliable Multicast Protocol for Wireless Mobile Multihop Ad Hoc Networks,” IEEE Consumer Communications and Networking Conference, pp.146 - 151, Jan. 2004.
[8]C. R. Dow, S. C. Chen, R. D. Wang, J. H. Lin, and S. F. Hwang,” A Reliable Multicast Routing Protocol Based on Recovery Points in Mobile Ad Hoc Networks,” International Conference on Mobile Technology, Applications and Systems, pp.1 - 7, Nov. 2005.
[9]E. Bommaiah, M. Lui, A. McAuley, and R. Talpade, "AMRoute: Ad Hoc Multicast Routing Protocol," Internet Draft, draft-manet-amroute-00.txt, Aug. 1998.
[10]C. W. Wu, Y. C. Tay, and C. K. Toh, “Ad hoc Multicast Routing Protocol Utilizing Increasing Id-Numbers (AMRIS) Functional Specification,” Internet draft, draft-ietf-amris- spec-00.txt, Nov. 1998.
[11]E. M. Royer and C. E. Perkins, “Multicast Ad Hoc On-Demand Distance Vector (MAODV)Routing,” Internet Draft, draft- ietf-manet-maodv-00.txt, 2000.
[12]C. Perkins, E. Belding-Royer, and S. Das, “Ad Hoc On-Demand Distance Vector (AODV) Routing”, IETF RFC 3561, July 2003.
[13]X. Xiang, X. Wang, and X. Zhou, “An Efficient Geographic Multicast Protocol for Mobile Ad Hoc Networks,” International Symposium on World of Wireless, Mobile and Multimedia Networks, pp.8 - 11, July 2006.
[14]J. Dongxing, “A Source-Specific Multicast Routing Protocol for Mobile Ad Hoc Networks,” International Conference on Wireless Communications, Networking and Mobile Computing, pp.1 - 4, Sept. 2006.
[15]W. Liao and M. Y. Jiang, “Family ACK tree (FAT): Supporting Reliable Multicast in Mobile Ad Hoc networks,” IEEE Transactions on Vehicular Technology, vol. 52, no. 6, pp.1675 - 1685, Nov. 2003.
[16]T. Yamada, S. Yoshimura, K. Kawano, K. Kinoshita, and K. Murakami, ” A Multicast Tree Reconstruction Method for Many-to-Many Mobile Communications with Delay Constraint,” IEEE Conference on Local Computer Networks, pp.525 - 526, Nov. 2006.
[17]L. Canourgues, J. Lephay, L. Soyer, and A. L. Beylot, “STAMP: Shared-Tree Ad Hoc Multicast Protocol,” MILCOM, pp.1 - 7, Oct. 2006.
[18]B. H. Liu, M. J. Tsai, and W. C. Ko, “Dynamical Construction of a Core-based Group-shared Multicast Tree in Mobile Ad Hoc Networks,” International Conference on Advanced Information Networking and Applications, pp. 90 - 95, March 2005.
[19]C. C. Hu, E. H. Kuang, and G. H. Chen, “Bandwidth-satisfied Multicast Trees in MANETs,” International Conference on Wireless and Mobile Computing, Networking and Communications, pp.22 - 24, Aug. 2005.
[20]T. Srinivasan, R. Chandrasekar, V. Vijaykumar, V. Mahadevan, A. Meyyappan, and A. Manikandan, “Localized Tree Change Multicast Protocol for Mobile Ad Hoc Networks,” International Conference on Wireless and Mobile Communications, pp.44 - 44, July 2006.
[21]T. Kozaka, T. K., S. Itoh, and Y. Urano, “A Dense Mode Ad Hoc Multicast Routing Protocol Constructing Shortest Path Trees with Low Control Overhead,” International Conference on ITS Telecommunications, pp.790 - 793, June 2006.
[22]A. Zakhor and W. Wei, “Multiple Tree Video Multicast Over Wireless Ad Hoc Networks,” International Conference on Image Processing, pp.1665 - 1668, Oct. 2006.
[23]B. Wang and S. K. S. Gupta, “G-REMiT: An Algorithm for Building Energy Efficient Multicast Trees in Wireless Ad Hoc Networks,” International Symposium on Network Computing and Applications, pp.265 - 272, April 2003.
[24]P. M. Ruiz and A. F. Gomez-Skarmeta, “Reducing Data-overhead of Mesh-based Ad Hoc Multicast Routing Protocols by Steiner Tree Meshes,” IEEE Conference on Sensor and Ad hoc Communications and Networks, pp.54 - 62, Oct. 2004.
[25]D. Jiang, “A Source-Specific Multicast Routing Protocol for Mobile Ad Hoc Networks,” International Conference on Wireless Communications, Networking and Mobile Computing, pp.1 - 4, Sept. 2006.
[26]G. Caizzone, W. Erangoli, P. Giacomazzi, and G. Verticale, “A Novel Location-Based Multicast Protocol for Ad Hoc Networks,” International Symposium on Personal, Indoor and Mobile Radio Communications, pp.1 - 5, Sept. 2006.
[27]L. Chen, A. B. Mnaouer, and C. H. Foh, “An Optimized Polymorphic Hybrid Multicast Routing Protocol (OPHMR) for Ad Hoc Networks,” IEEE International Conference on Communications, pp.3572 - 3577, June 2006.
[28]H. Ammari and H. El-Rewini, “A Multicast Protocol for Mobile Ad Hoc Networks Using Location Information,” Workshop on Applications and Services in Wireless Networks, pp.174 - 183, Aug. 2004.
[29]Y. Zhou and X. Wang, “A Region-Based Multicast Routing Protocol for Ad Hoc Networks,” International Conference on Communication Technology, pp.1 - 5, Nov. 2006.
[30]K. Viswanath, K. Obraczka, and G. Tsudik, “Exploring Mesh and Tree-based Multicast. Routing Protocols for MANETs,” IEEE Transactions on Mobile Computing, vol. 5, no. 1, pp.28 - 42, Jan. 2006.
[31]The Network Simulator – ns2. http://www.isi.edu/nsnam/ns/.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內外都一年後公開 withheld
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code