群體通訊(group communications)在隨意無線網路(Mobile Ad Hoc Networks, MANETs)的環境中是一個相當重要的需求，而群播(multicast)路由協定能有效率的實現此項需求。但要在隨意無線網路環境中實現群播成員的管理、群播封包的傳遞以及維護動態拓樸下的群播架構，是有相當難度的，欲將一個群播路由協定實作成有擴展性、堅韌性和效率性也十分具有挑戰性。在本文中，我們結合樹狀及網狀群播路由協定兩者的優點，提出一個堅韌的群播路由協定Robust Mesh-based Multicast Protocol (RMMP)，能在路徑斷裂時，降低資料恢復傳送的時間。文中使用兩種方法使群播成員的管理兼具穩固及效率，一是將群播架構建立成二元樹，二是使用第二傳輸路徑。前者的目的是將傳輸任務平均的分配給每個成員，後者則是用來減少樞紐點(articulation nodes)的數量以避免資料遺失。模擬結果顯示RMMP能應用於傳輸負載較重的網路，並擁有較高的封包抵達率。此外，當路徑斷裂時，RMMP具有更穩固的架構來恢復資料的傳送。

Multicasting in mobile ad hoc networks (MANETs) is an efficient method for group communications that has received considerable attention. However, developing a scalable, robust and efficient multicast method in MANETs is difficult owing to group membership management and the ability to maintain a multicast structure over a dynamic topology. This work presents a novel Robust Mesh-based Multicast Protocol (RMMP) that integrates the advantages of tree-based and mesh-based multicast protocols and reduces data recovery time when paths break. The proposed RMMP is performed in two ways. One is to construct a multicast structure using a binary tree, and the other is to provide a second-route discovery scheme. The former distributes transmission averagely among member nodes, and the latter reduces the number of articulation nodes to eliminate loss of data packets. Simulation results demonstrate that the RMMP is suitable for heavy traffic loads, and achieves a high delivery ratio. Furthermore, the RMMP is robust in recovering data transmission when paths break.

中文摘要............................................................I
英文摘要...........................................................II
目錄..............................................................III
圖目錄..............................................................V
表格目錄..........................................................VII
字母縮寫對照表...................................................VIII
第一章　導論........................................................1
1.1 簡介....................................................... 1
1.1.1 無線網路的兩種通訊模式................................3
1.1.2 IEEE802.11定義的兩種無線網路架構..................... 6
1.1.3 隨意式無線網路的研究重點..............................8
1.1.4 隨意式無線網路中的三種路由協定機制....................9
1.2 研究方向的相關背景........................................ 11
1.3 研究動機.................................................. 12
1.4 論文架構.................................................. 13
第二章　背景與相關研究.............................................14
2.1 網路群播傳輸之簡介........................................ 14
2.1.1 隨意無線網路群播協定設計依據.........................15
2.1.2 隨意無線網路群播路由協定的運作方式...................16
2.1.3 群播路由協定的分類法.................................19
2.2 Multicast Ad Hoc On-Demand Distance Vector Routing Protocol (MAODV)................................................... 21
2.2.1 Tree Initialization...................................21
2.2.2 Tree Maintenance 階段.................................23
2.3 On-Demand Multicast Routing Protocol (ODMRP) ..............24
2.3.1 Mesh Initialization...................................24
2.3.2 Mesh Maintenance 階段.................................25
第三章　系統之架構與運作...........................................27
3.1 設計方向.................................................. 27
3.2 功能及名詞釋義............................................ 27
3.3 初始路徑規劃.............................................. 28
3.3.1 初始狀態階段..........................................28
3.3.2 檢查PCT階段..........................................28
3.3.3 插入階段..............................................29
3.4 搜尋第二傳輸路徑.......................................... 29
3.4.1 第二傳輸路徑的準備....................................30
3.4.2 第二傳輸路徑的建立....................................31
3.5 路徑維護.................................................. 32
第四章　模擬結果及討論.............................................34
4.1 模擬環境假設.............................................. 34
4.2 模擬環境參數設定.......................................... 35
4.3 模擬工具介紹.............................................. 36
4.4 數據分析與討論............................................ 38
4.4.1 數據分析軟體.........................................38
4.4.2 模擬結果.............................................40
第五章 結論.......................................................49
參考文獻...........................................................50

[1] A. Adams, J. Nicholas, and W. Siadak, “Protocol Independent Multicast - Dense Mode (PIM-DM),” Request For Comments 3973, Jan. 2005.
[2] A. Ballardie, “Core Based Trees (CBT version 2) Multicast Routing Protocol Specification,” Request For Comments 2186, Sep. 1997.
[3] R. T. E. Bommaiah, A. McAuley and M. Liu, “AMRoute: Adhoc multicast routing protocol.” Internet Draft, Aug. 1998.
[4] L. Chen and W.B. Heinzelman, “QoS-aware routing based on bandwidth estimation for mobile ad hoc networks,” IEEE Journal on Selected Areas in Communication, Vol. 23, Mar. 2005, pp. 561-572.
[5] C.-C. Chiang, M. Gerla and L. Zhang, “Forwarding Group Multicast Protocol (FGMP) for multihop mobile wireless networks,” Cluster Computing, vol. 1, no. 2, pp. 187–196, 1998.
[6] S. Choi and K.G.. Shin, “A unified wireless LAN architecture for real-time and non-real-time communication services,” IEEE/ACM Transactions on Networking, Vol. 8, Feb. 2000, pp. 44-59.
[7] S. K. Das, B. S. Manoj and C. S. R. Murthy, “A Dynamic Core Based Multicast Routing Protocol for Ad hoc Wireless Networks,” 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) 2002, Lausanne, Switzerland, pp. 24 – 35, Jun. 2002.
[8] J. Garcia-Luna-Aceves and E. Madruga, “The Core-assisted Mesh Protocol,” IEEE Journal on Selected Areas in Communications, vol. 17, pp. 1380–1394, Aug. 1999.
[9] C. Gui and P. Mohapatra, “Efficient overlay multicast for mobile ad hoc networks,” IEEE Wireless Communications and Network Conference (WCNC), New Orleans, USA, pp. 1118–1123, Mar. 2003.
[10] M. Joa and I. T. Lu, “A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks,” IEEE Journal on Selected Areas in Communications, Vol. 17 no. 8, Aug. 1999, pp. 1415-1425.
[11] D. Johnson and D. Maltz, “Dynamic Source Routing in Ad Hoc Wireless Networks,” in Mobile Computing, edited by Tomasz Imielinski and Hank Korth, chapter 5, pages 153-181. Kluwer Academic Publishers, 1996.
[12] D. Johnson, D. Maltz, and Y.-C. Hu, “The Dynamic Source Routing for mobile ad hoc networks,” IETF Internet Draft. http://www.ietf.org/internet-drafts/draft-ietf-manet-dsr-10.txt, Jul. 2004.
[13] S.-J. Lee, M. Gerla and C.-C. Chiang, “On-Demand Multicast Routing Protocol,” Wireless Communications and Network Conference (WCNC) ’99, New Orleans, USA, pp. 1298– 1302, Sep. 1999.
[14] H. LEE, J. KIM, and W.Y. LEE, “Resiliency of network topologies under path-based attacks,” IEICE Transactions on Communications, Vol. E89-B(10), Apr. 2006, pp. 2878-2884.
[15] S.-J. Lee, Y. Yi, W. Su and M. Gerla, “On-Demand Multicast Routing Protocol (ODMRP) for ad hoc networks.” Internet Draft, expired, draft-yi-manet-odmrp-00, Mar. 2003.
[16] S. Lee and C. Kim, “NSMP: Neighbor Supporting Ad Hoc Multicast Routing Protocol,” ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) 2000, Boston, pp. 37–50, Aug. 2000.
[17] S. Lee, W. Su, J. Hsu, M. Gerla and R. Bagrodia, “A performance comparison study of ad hoc wireless multicast protocols,” IEEE International Conference on Computer Communication (INFOCOM) 2000, Israel, vol. 2, pp. 565–574, Mar. 2000.
[18] B. M. Liu, A. McAuley and R. Talpade, “Ad hoc multicast routing protocol,” AMRoute: Technical Report TR 99-1, CSHCN, 1999.
[19] J. Moy, “Multicast Extensions to OSPF (MOSPF),” Request For Comments 1584, Mar. 1994.
[20] S. Murphy and J.J. Garcia-Luna-Aceves, “An efficient routing protocol for wireless networks,” ACM/Baltzer Journal on Mobile Networks and Applications, Special Issue on Routing in Mobile Communication Networks, Oct. 1996, pp. 183-197.
[21] V. Park, M. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” Proceedings of the IEEE International Conference on Computer Communication (INFOCOM), Vol.3, Apr. 1997, Kobe, Japan, pp.1405-1413.
[22] M. R. Pearlman and Z. J. Haas, "Determining the Optimal Configuration for the Zone Routing Protocol", IEEE Journal on Selected Areas in Communications, Vol. 17, no. 8, Aug.1999, pp. 1395-1414.
[23] C.E. Perkins and E.M. Royer, “Ad hoc on-demand distance vector (AODV) routing,” IETF Internet draft, Jul. 2003.
[24] C.E. Perkins and E.M. Royer, “RFC3561: Ad hoc on-demand distance vector (AODV) routing,” Internet RFCs, Jul. 2003.
[25] C.E. Perkins, E.M. Royer, S. Das, and M. Marina, “Performance comparison of two on-demand routing protocols for ad hoc networks,” IEEE Personal Communications, Vol. 8, Feb. 2001, pp. 16-28.
[26] C.E. Perkins and P. Bhagwat, “Highly dynamic destination -sequenced distance-vector routing (DSDV) for mobile computers,” Computer Communication Review, ACM SIGCOMM, Vol.24, No.4, Aug. 1994, London, England, pp. 232-244.
[27] E. M. Royer and C. E. Perkins, “Multicast Operation of the Ad Hoc On-Demand Distance Vector Routing Protocol,” Proceedings of ACM International Conference on Mobile Computing and Networking (MOBICOM) 1999, Seattle, pp.207-218, Aug. 1999.
[28] E. M. Royer and C. E. Perkins, “Multicast Ad Hoc On-Demand Distance Vector (MAODV) Routing,” Internet draft, draft-ieft-manet-maodv-00.txt, Jul. 2000.
[29] D. Waitzman, C. Partridge, and S. Deering, “Distance Vector Multicast Routing Protocol (DVMRP),” Request For Comments 1075, Nov. 1988.
[30] C. Wu and Y. Tay, “AMRIS: A multicast protocol for ad hoc wireless networks,” IEEE Military Communications Conference (MILCOM) ’99, no. 1, Atlantic City, USA, pp. 25–29, Oct. 1999.
[31] X. Xiang, Z. Zhou and X. Wang, ” Robust and Scalable Geographic Multicast Protocol for Mobile Ad-hoc Networks,” IEEE International Conference on Computer Communication (INFOCOM) 2007, Anchorage , Alaska , USA, pp. 2301 – 2305, May. 2007.
[32] Trace Graph：http://www.tracegraph.com/, Page accessed on Nov. 1, 2007.
[33] UCB/LBNL/VINT ns notes and documentation, http://www.isi.edu/nsnam/ns/, Page accessed on Nov. 1, 2007.