研究生: |
李明杰 Ming-Chieh Li |
---|---|
論文名稱: |
移動式無線隨意網路中以動態傳輸功率進行廣播之協定(Broadcast with Dynamic Transmission Power in Mobile Ad-hoc Networks) Broadcast with Dynamic Transmission Power in Mobile Ad-hoc Networks |
指導教授: |
陳文村
Wen-Tsuen Chen |
口試委員: | |
學位類別: |
碩士 Master |
系所名稱: |
電機資訊學院 - 資訊工程學系 Computer Science |
論文出版年: | 2008 |
畢業學年度: | 96 |
語文別: | 英文 |
論文頁數: | 28 |
中文關鍵詞: | 廣播 、無線隨意網路 、省電 、廣播風暴 |
相關次數: | 點閱:4 下載:0 |
分享至: |
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報 |
在移動式無線隨意網路(mobile ad-hoc networks)中,廣播(broadcast)常被用來當作節點與節點之間溝通的橋樑,由某個節點開始發送訊息給網路上所有的節點,然而這種傳統式的廣播機制會在整個網路中產生非常大量的資料量,造成節點間傳輸的競爭(contention)甚至發生封包的碰撞(packet collision),使得廣播的效能大打折扣,此一問題又被稱作廣播風暴(broadcast storm problem)。
為了解決此問題,許多演算法紛紛被提出來改善廣播的內部結構,然而這些方法對於減低廣播所造成的資料量並不顯著,有些方法甚至還需要維持許多層的鄰居資訊才得以達成降低資料量的目的,這些在經常變動架構的網路中是非常不適用的,有鑑於此,我們在這篇論文中提出了一個廣播機制,該機制只需要用到每個節點相鄰的鄰居資訊(1-hop neighbor information),在我們的方法之下每個節點能動態地調整自己的傳輸距離,如此一來不僅降低了網路上的節點在傳輸資料時的能量損耗,更能有效地減少廣播所產生的資料量,在文章的後半段我們以電腦模擬的方式測試廣播的效能,從結果中得知我們的方法與目前為止前人所提出的方法相比更能有效降低廣播所產生的資料量,並且能節省節點間傳輸的電力,以及平衡網路上所有節點的能量損耗(power-balanced)。
在未來的研究方面,由於我們所提的方法是以減少廣播的資料流為主,對於節省電量方面並不是最佳化,許多專門探討省電議題的論文在這方面都有不錯的成果,若能將這類省電的方法結合我們所提出的減少廣播資料流最佳化相結合,必能讓廣播的效能更上一層樓。
[1]S. Ni, Y. Tseng, Y. Chen, and J. Sheu, “The broadcast storm problem in a mobile ad hoc network,” in Proc. Of ACM/IEEE MOBICOM’99, pp. 151- 162, Aug. 1999.
[2]Y. Sasson, D. Cavin, and A. Schiper, “Probabilistic Broadcast for Flooding in Wireless Mobile Ad hoc Networks,” in IEEE Wireless Communications and Networking, 2003 (WCNC).
[3]Q. Zhang and D.P. Agrawal, “Dynamic probabilistic broadcasting in MANETs,” in Journal of Parallel and Distributed Computing, volume 65, pages 220-233, Feb. 2005.
[4]Z.J. Haas, J.Y. Halpern, and L. Li, “Gossip-Based Ad Hoc Routing,” in IEEE/ACM Transactions on Networking (TON), volume 14, pages 479-491, June 2006.
[5]A. Khelil, P.J. Marron, C. Becker, and K. Rothermel, “Hypergossiping: A Generalized Broadcast Strategy for Mobile Ad Hoc Networks,” in Elsevier Ad Hoc Networks Journal, volume 5, pages 531-546, July 2007.
[6]S. Pleisch, M. Balakrishnan, K. Birman, and R. van Renesse, “MISTRAL: Efficient Flooding in Mobile Ad-hoc Networks,” in ACM MobiHoc 2006, pages 1-12.
[7]A. Juttner and A. Magi, “Tree Based Broadcast in Ad Hoc Networks,” in ACM Mobile Networks and Applications, volume 10, pages 753-762, Oct. 2005.
[8]Y. Cai, K.A. Hua, and A. Phillips, “Leveraging 1-hop Neighborhood Knowledge for Efficient Flooding in Wireless Ad Hoc Networks,” in IEEE Performance, Computing, and Communication Conference, 2005 (IPCCC), pages 347-354, April 2005.
[9]H. Liu, P. Wan, X. Jia, X. Liu, and F. Yao, “Efficient Flooding Scheme Based on 1-hop Information in Mobile Ad Hoc Networks,” in IEEE INFOCOM 2006. 25th IEEE International Conference on Computer Communications, pages 1-12, April 2006.
[10]I.W. Kim, M.S. Jeong, and C.G. Kang, “Selective Rebroadcast Suppression (SRS) Scheme for Directional Border Flooding in Mobile Ad Hoc Networks,” in IEEE Wireless Pervasive Computing, pages 1-5, Jan. 2006.
[11]W. Lou and J. Wu, “Toward Broadcast Reliability in Mobile Ad Hoc Networks with Double Coverage,” in IEEE Transactions on Mobile Computing, volume 6, pages 148-163, Feb. 2007.
[12]J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, “On the construction of energy-efficient broadcast and multicast trees in wireless networks,” in Proceedings of the 19th Annual Joint Conference of theIEEE Computer and Communications Societies (INFOCOM ’00).
[13]J. Cartigny, D. Simplot, and I. Stojmenovic, “Localized minimum-energy broadcasting in ad-hoc networks,” in Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM ’03), pages 2210–2217, Mar. 2003.
[14]I. Kang and R. Poovendran, “Maximizing static network lifetime of wireless broadcast adhoc networks,” in Proceedings of IEEE International Conference on Communications (ICC) 2003, May 2003.
[15]R. Wattenhofer, L. Li, P. Bahl, and Y. Wang, “Distributed topology control for power efficient operation in multihop wireless ad hoc networks,” in Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM ’01), pages 1388–1397, Apr. 2001.
[16]N. Meghanathan and A. Farago, “Power Sensitive Power Control in Ad Hoc Networks,” in ACM Southeast Conference 2005, pages 81-86.
[17]N. Li and J.C. Hou, “A scalable, power-efficient broadcast algorithm for wireless networks,” in Springer Wireless Networks, volume 12, pages 495-509, July 2006.
[18]S. Lin, J. Zhang, G. Zhou, L. Gu, T. He, and J.A. Stankovic, “ATPC: Adaptive Transmission Power Control for Wireless Sensor Networks,” in Proceedings of the 4th international conference on Embedded networked sensor systems, ACM SenSys’06, pages 223-236.
[19]P. Gupta and P.R. Kumar, “Critical Power for Asymptotic Connectivity in Wireless Networks,” in Stochastic Analysis, Control, Optimization and Applications, 1998.
[20]J-Sim. http://www.j-sim.org.