跳到主要內容

臺灣博碩士論文加值系統

(100.26.196.222) 您好!臺灣時間:2024/03/01 05:02
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:江明諭
研究生(外文):Ming-Yu Jiang
論文名稱:AdHoc無線網路上可靠群播協定之研究
論文名稱(外文):Reliable Multicast in Mobile Ad Hoc Networks
指導教授:廖婉君廖婉君引用關係
指導教授(外文):Wanjiun Liao
學位類別:碩士
校院名稱:國立臺灣大學
系所名稱:電機工程學研究所
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2001
畢業學年度:89
語文別:英文
論文頁數:54
中文關鍵詞:可靠群播Ad Hoc無線網路
外文關鍵詞:Reliable MulticastMobile Ad Hoc Network
相關次數:
  • 被引用被引用:1
  • 點閱點閱:270
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
隨著手提電腦、個人數位助理等無線行動計算裝置相關技術的持續進步,Ad Hoc無線網路的架構已成為近年來熱門的研究課題。Ad Hoc無線網路係指一種純粹由行動節點所建構而成的網路,在沒有基地台或其他網路基礎建設的前提下,配備無線收發天線的行動節點利用multi-hop的方式自行互相連結,由於其無線的傳輸環境以及動態的網路拓樸等特性,在Ad Hoc無線網路上設計通訊協定必須考慮許多不同於傳統有線網路的問題。
在本論文中,我們研究如何在Ad Hoc無線網路上提供可靠群播之服務。群播的技術可以將同一份資料有效率地傳送給多位以上的接收者,而在群播機制之上加入可靠性的服務,可以使群播技術的應用更加廣泛,我們針對Ad Hoc無線網路的諸多特性,將參與群播的行動節點分組,並結合部分傳統有線網路上可靠群播機制的優點,在兼具效率與可擴充性下,提出一個以樹為基礎架構的可靠群播協定,稱為Family ACK Tree(FAT)協定。從模擬的結果中可以發現,FAT能夠在動態的網路架構下,以分散式的封包重傳機制提供高度可靠的群播服務,並解決發送端的回應爆炸問題,同時經由模擬的結果也可以說明,在不同特性的網路下,FAT都能夠提供可靠的群播服務。

Advent technology of mobile computing devices has accelerated the development of wireless ad hoc networks in recent years. As the popularity of personal mobile devices grows, users are asking for more and more applications to run on wireless mobile networks. Multicasting has been considered as an efficient way for data dissemination. The provision of reliability is beneficial for multicast mechanism to be applied in an ad hoc network with high mobility and dynamic topology.
In this thesis, the Family ACK Tree (FAT) protocol, a reliable multicast protocol for mobile ad hoc networks, is proposed. In FAT, a tree-based hierarchical ACK/NACK architecture is maintained as long as a multicast session is ongoing. To deal with frequent node movements, lost packets are retransmitted with the assistance of a set of nodes called multicast sub-group. Simulation results are presented to show the performance of the protocol. As compared with other approaches, our protocol reaches a very high level of reliability while exploiting a distributed and localized loss recovery mechanism. As a reliable multicast protocol in a mobile ad hoc network, FAT provides reliability in an efficient and scalable way.

1 Introduction ……………………………………………………1
1.1 Mobile Ad Hoc Networks…………………………1
1.2 Reliable Multicast……………………………………………6
1.3 Motivation………………………………………………………………7
1.4 Related work……………………………………………………………8
1.5 Organization……………………………………………………………13
2 Family ACK Tree Protocol…………………………………………14
2.1 Basic mechanism………………………………………………………15
2.1.1 Assumptions………………………………………………………15
2.1.2 Definition……………………………………………………………16
2.1.3 Message types………………………………………………………18
2.1.4 State model …………………………………………………………20
2.2 Operation overview………………………………………………22
2.2.1 Family ACK Tree construction……………………………22
2.2.2 Family ACK Tree maintenance………………………………...23
2.2.3 FAT retransmission decision algorithm………………………27
2.3 Examples………………………………………………………………30
2.3.1 Family ACK Tree construction…………………30
2.3.2 Normal operation………………………………31
2.3.3 Retransmission request……………………………32
3 Performance Evaluation…………………………………………35
3.1 Simulation environment…………………………………………35
3.2 Simulation results……………………………………………37
3.2.1 Source_ACK v.s. FAT…………………………………………37
3.2.2 The Family ACK Tree mechanism…………………………41
3.3 Result discussion………………………………………………48
4 Concluding Remarks …………………………………………………50
Future Work……………………………………………………………51
References…………………………………………………………………52

[1]IETF Mobile Ad Hoc Networks (MANET) Working Group Charter; http://www.ietf.org/html.charters/manet-charter.html
[2]IEEE standard for Wireless LAN-Medium Access Control and Physical Layer Specification, P802.11, Nov. 1997.
[3]S. Corson and J. Macker, “Mobile Ad Hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations,” RFC 2501, Jan. 1999.
[4]E. M. Royer and C.-K. Toh, “A Review of Current Routing Protocols for Ad Hoc Mobile Wireless Networks,” IEEE Personal Communications, Apr. 1999, pp. 46-55.
[5]C. E. Perkins and P. Bhagwat, “Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers,” Proceedings of the SIGCOMM ’94 conference on Communications architectures, protocols and applications, pp. 234-244, Aug. 1999.
[6]C.-C. Chiang et al., “Routing in Clustered Multihop Mobile Wireless Networks with Fading Channel,” Proceedings of IEEE Singapore International Conference on Networks, pp. 197-212, Apr. 1997.
[7]S. Murphy and J. J. Garcia-Luna-Aceves, “An Efficient Routing Protocol for Wireless Networks, “ ACM Mobile Networks and Applications, pp.183-197, Oct. 1996.
[8]C. E. Perkins et al., “Ad hoc On-Demand Distance Vector (AODV) Routing,” Internet-Draft, draft-ietf-manet-aodv-08.txt, Mar. 2001, Work in Progress.
[9]D. B. Johnson et al., “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks,” Internet-Draft, draft-ietf-manet-dsr-05.txt, Mar. 2001, Work in Progress.
[10]V. Park and S. Corson, “Temporally-Ordered Routing Algorithm (TORA) Version 1 Functional Specification,” Internet-Draft, draft-ietf-manet-tora-spec-03.txt, Nov. 2000, Work in Progress.
[11]C.-K. Toh et al., “Implementation and Evaluation of An Adaptive Routing Protocol for Infrastructureless Mobile Networks,” Proceedings of IEEE International Conference on Computer Communications and Networks (IC3N ’00), pp. 20-27, 2000.
[12]Z. J. Haas and M. R. Pearlman, “The Performance of A New Routing Protocol for The Reconfigurable Wireless Networks,” Proceedings of IEEE ICC ‘98, pp. 156-160, Jun. 1998.
[13]T. Pusateri et. al., “Distance Vector Multicast Routing Protocol, ” Internet-Draft, draft-ietf-idmr-dvmrp-v3-05.txt, 1997, Work in Progress.
[14]J. Moy, “Multicast Routing Extensions for OSPF,” Comm. ACM, Vol. 37, No. 8, pp. 61-66, Aug. 1994.
[15]T. Ballardie et al., “Core based trees (CBT): An architecture for scalable inter-domain multicast routing, “ Proceedings of ACM SIGCOMM ’93, Sep. 1993.
[16]D. Estrin et al.,“Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification,” RFC 2362, Jun. 1998.
[17]K. Obraczka and G. Tsudik, “Multicast Routing Issues in Ad Hoc Networks,” IEEE International Conference on Universal Personal Communications (ICUPC ’98), pp. 751-756, 1998.
[18]E. M. Royer and C. E. Perkins, “Multicast Operation of the Ad-hoc On-Demand Distance Vector Routing Protocol,” Proceedings of ACM/IEEE MobiCom ‘99, pp. 207-218, Aug. 1999.
[19]E. Bommaiah, M. Liu, A. McAuley and R. Talpade, “AMRoute: Adhoc multicast routing protocol,” Internet-Draft, draft-talpade-manet-amroute-00.txt, 1998.
[20]J. J. Garcia-Luna-Aceves and E. L. Madruga, “The Core-Assisted Mesh Protocol,” IEEE Journal on Selected Areas in Communications, Vol. 17, No. 8, pp. 1380-94, Aug. 1999.
[21]C. W. Wu, Y. C. Tay and C.-K. Toh, “Ad hoc Multicast Routing protocol utilizing Increase id-numberS (ARMIS),” Internet-Draft, draft-ietf-manet-armis-00.txt, 1998, Work in Progress.
[22]S.-J. Lee, M. Gerla and C.-C. Chiang, “On-Demand Multicast Routing Protocol,” Proceedings of IEEE Wireless Communications and Networking Conference (WCNC ’99), Vol. 3, pp. 1298-1302, 1999.
[23]C. Ho et al., “Flooding for Reliable Multicast in Multi-Hop Ad Hoc Networks,” Proceedings of ACM DIALM ’99, pp. 64-71, Aug. 1999.
[24]S.-J Lee et al., “A Simulation Study of Table-Driven and On-Demand Routing Protocols for Mobile Ad Hoc Networks,” IEEE Network, pp. 48-54, Jul. 1999
[25]J. Broch et al., “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proceedings of ACM/IEEE MobiCom ’98, pp. 85-97, 1998.
[26]S.-J. Lee et al., “A Performance Comparison Study of Ad Hoc Wireless Multicast Protocols,” Proceedings of IEEE INFOCOM ’00, pp. 565-574, 2000.
[27]B. N. Levine and J. J. Garcia-Luna-Aceves, “A Comparison of Known Classes of Reliable Multicast Protocols,” Proceedings of IEEE Conference on Network Protocols (ICNP ’96), pp. 112-121, 1996.
[28]S. Floyd et al., “A Reliable Multicast Framework for Light-weight Sessions and Application Level Framing,” IEEE/ACM Transaction on Networking, Vol. 5, No. 6, pp. 784-803, Dec. 1997.
[29]S. Paul et al., “Multicast transport protocols for high speed networks,” Proceedings of IEEE International Conference on Network Protocols (ICNP ’94), pp. 4-14, 1994.
[30]S. Paul et al., “Reliable Multicast Transport Protocol (RMTP),” IEEE Journal on Selected Areas in Communications, Vol. 15, No. 3, pp. 407-421, Apr. 1997.
[31]R. Yavatkar et al., “A Reliable Dissemination Protocol for Interactive Collaborative Applications,” Proceedings of the third ACM international conference on Multimedia, pp. 333-344, 1995.
[32]S. K. S. Gupta and P. K. Srimani, “An Adaptive Protocol for Reliable Multicast in Mobile Multi-hop Radio Networks,” Proceedings of IEEE Workshop on Mobile Computing Systems and Applications, pp. 111-122, Feb. 1999.
[33]E. Pagani and G. P. Rossi, “Providing reliable and fault tolerant broadcast delivery in mobile ad-hoc networks,” ACM/Baltzer Mobile Networks and Applications 4 (1999), pp. 175-192, 1999.
[34]D. Towsley et al., “A Comparison of Sender-Initiated and Receiver-Initiated Reliable Multicast Protocols,” IEEE Journal on Selected Areas in Communications, Vol. 15, No. 3, pp. 398-406, Apr. 1997.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top