簡易檢索 / 詳目顯示

研究生: 黃星寶
Huang, Hsing-Pao
論文名稱: 隨意行動網路上以叢集為基礎的具強健備援能力疊加群播通訊協定之設計
The Design of Robust Cluster-Based Overlay Multicast Protocol in Mobile Ad Hoc Networks
指導教授: 許靜芳
Hsu, Ching-Fang
學位類別: 碩士
Master
系所名稱: 電機資訊學院 - 資訊工程學系
Department of Computer Science and Information Engineering
論文出版年: 2005
畢業學年度: 93
語文別: 英文
論文頁數: 57
中文關鍵詞: 網路頻寬電力消耗應用層群播叢集演算法行動主機ad hoc 無線網路
外文關鍵詞: application layer multicast, clustering algorithm, power consumption, network bandwidth, mobile host, ad hoc wireless network
相關次數: 點閱:95下載:1
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報
  •   近年來無線網路通訊已經越來越普遍了,所以許多人慢慢的都投入這方面的研究。ad hoc 網路正是其中的一種,它是全由無線裝置所建構而成的網路,每個行動主機可隨意移動,且兼具 router 的角色,幫忙網路上的其它節點做封包轉送的動作。由於它不需要事先的基礎建設,因此在救災或是戰場等方面特別具有應用價值。由於這種網路的一些先天上的特性,例如電力無法持久,以及網路頻寬不足等因素,因此在這種網路上,為了能夠減少電力的消耗,以及頻寬的浪費,許多應用大多是採用群播的方式來完成,所以群播繞路演算法的設計,就顯得相當重要。

      在ad hoc 無線網路裡,行動主機常常隨意移動,造成建立好的路徑容易斷裂,使得需要不斷的重建群播樹,許多已經提出的網路層的群播繞路演算法,都有這種缺點,所以後來的研究,大都往應用層的群播方面發展。 在本篇論文中,將考量 power 消耗的因素,並利用叢集技術,使得網路存活時間能夠較長,同時採用在叢集中,有 backup leader 的作法,使得叢集在失去 leader時,能在很短的時間內,讓中斷的資料傳輸能迅速的回復到繼續傳送的狀態。

     In recent years, wireless communication has been more and more widespread. A lot of people research and development efforts focused on this side gradually. Ad hoc network is one kind of these wireless networks. It is organized by a collection of wireless devices. Each mobile host can move arbitrarily and functions as a router, offering packet-forwarding services to all other nodes in the network. Because any pre-established wired or wireless infrastructures are unnecessary. Therefore it is very important and useful in the region without base stations supporting, such as in disaster and battlefield area.

     Ad hoc network has some natural characters. For instance, the power can not persist a period of long time. Secondly, the network bandwidth is not large enough. Many applications are accomplished by using multicast in order to reduce the power consumption and save the bandwidth. Therefore, design of the multicast algorithm is very important.

     In ad hoc network, mobile hosts often move arbitrarily and the link is fragile. This make the multicast tree rebuild frequently. Most of the existing multicast routing protocols in network layer have this kind of drawback. Hence, current research focused on application layer multicast. In this paper, we will employ the clustering technique and consider the factor of power consumption to increase the network lifetime. We also use a backup leader in the cluster to repair the structure when the cluster leader is disappeared. As a result, that will make the interruption of the data transmission can be recovery in a short time.

    Chapter 1 Introduction 1 1.1 Multicast 1 1.2 Motive 5 Chapter 2 Related Work 7 2.1 AOM (Adapted Overlay Multicast) 7 2.2 PAST-DM 11 2.3 POM 16 2.4 NICE-MAN 18 Chapter 3 Proposed scheme 26 3.1 Leader selection 26 3.1.1 Using the hops sum as a metric 27 3.1.2 Using velocity as the metric 28 3.1.3 Considering the remaining power 30 3.2 Which one has to leave the overlay when two LBC meet the collision 32 3.3 Adopting the backup leader 34 3.3.1 When the LBC leaders meet the collision 35 3.3.2 When two clusters are merged into one 35 3.3.3 When a leader leave the group suddenly 35 3.3.4 Power exhaust 35 3.4 Fast Recovery Ability with Backup leader (FRAB) 39 Chapter 4 Simulation and performance 43 4.1 Assumptions and Parameters 43 4.2 Simulation Results 45 4.2.1 Topology changes 45 4.2.2 Recovery time 48 4.2.3 The number of alive nodes 49 4.2.4 Standard deviation of power 51 4.2.5 End-to-end delay 53 Chapter 5 Conclusion 55 Bibliography 56

    [1] S. Banerjee, B. Bhattacharjee, and C. Kommareddy, “Scalable Application Layer Multicast,” In Proceedings of ACM SIGCOMM 2002.
    [2] P. Baumung, M. Zitterbart and K. Kutzner,“Improving delivery ratios for application layer multicast in mobile ad-hoc networks,” IEEE ASWN 2004, pp. 132-141.
    [3] S. Blodt, “Efficient end system multicast for mobile ad hoc networks,” Proceedings of IEEE Annual Conference on Pervasive Computing and Communications Workshops, 2004, pp. 75-80.
    [4] Y. Chawathe, “Scattercast: An Architecture for Internet Broadcast
    Distribution as an Infrastructure Service,” Ph.D. Thesis, University of
    California, Berkeley, Dec. 2000.
    [5] Y.H. Chu, S.G. Rao, and H. Zhang, “A Case for End System Multicast,” IEEE Journal on Selected Areas in Communications, Vol. 20, Issue 8, Oct 2002, pp. 1456-1471.
    [6] P. Francis, “Yoid: Extending the Multicast Internet Architecture,” White paper 1999, http://www.aciri.org/yoid/ .
    [7] C. Gui and P. Mohapatra, “Efficient Overlay Multicast for Mobile Ad Hoc Networks,” IEEE WCNC 2003, pp. 1118-1123.
    [8] J. Jannotti, D. Gifford, K. Johnson, M. Kaashoek, and J. O’Toole,“Overcast: Reliable Multicasting with an Overlay Network,” In Proceedings of the Fourth Symposium on Operating System Design and Implementation (OSDI) 2000, pp. 197-212.
    [9] K.I. Kim, H.S. Mo, I.C. Baek, J.B. Shin and S.H. Kim, “Robust and cost-efficient group communication using overlay multicast in mobile ad hoc networks,” IEEE GLOBECOM 2003, pp. 713-717.
    [10] S. McCanne and S. Floyd, NS-2 Simulator, http://www.isi.edu/nsnam/ns/ .
    [11] D. Pendarakis, S. Shi, D. Verma, and M. Waldvogel., “ALMI: An Application Level Multicast Infrastructure,” In Proceedings of the 3rd. USENIX Symposium on Internet Technologies and Systems (USITS) 2001, pp.49-60.
    [12] C.E. Perkins and P. Bhagwat, ”Highly Dynamic Destination-Sequenced Distance Vector Routing (DSDV) for Mobile Computer,” ACM SIGCOMM 1994, pp. 234-244.
    [13] S. Ratnasamy, M. Handley, R. Karp, and S. Shenker, “Application-level multicast using content-addressable networks,” In Proceedings of the Third International Workshop on Networked Group Communication(NGC) 2001, pp. 14-29.
    [14] D.A. Tran, K.A. Hua, T. Do, ”ZIGZAG: An efficient peer-to-peer scheme for media streaming,” IEEE INFOCOM 2003, pp. 1283-1292.
    [15] L. Xiao, A. Patil; Y. Liu, L.M Ni, and A.H. Esfahanian, “Prioritized overlay multicast in mobile ad hoc environments,” IEEE Computer, Vol. 37, Issue 2, Feb. 2004, pp. 67-74.

    下載圖示 校內:2006-09-02公開
    校外:2007-09-02公開
    QR CODE