Responsive image
博碩士論文 etd-0831104-235725 詳細資訊
Title page for etd-0831104-235725
論文名稱
Title
在無線隨意式網路中以功率為基礎的叢集演算法
A Power-based Clustering Algorithm for Wireless Ad-hoc Networks
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
40
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2004-06-21
繳交日期
Date of Submission
2004-08-31
關鍵字
Keywords
無線隨意式網路、叢集形成法、功率控制
power control, wireless ad hoc networks, clustering algorithm
統計
Statistics
本論文已被瀏覽 5690 次,被下載 1998
The thesis/dissertation has been browsed 5690 times, has been downloaded 1998 times.
中文摘要
近年來能量節約在無線網路中一直是一個重要的議題,儘管隨著科技的進步,電池的壽命也有了相當的提升,但是仍然是趕不上無線網路的蓬勃發展。在這篇論文中我們提出一個功率管理的方式用來降低傳輸功率以及提升電池壽命,分成兩部分:第一部份我們提出一個以功率為基礎的叢集演算法,第二部分再配合功率的調整以及有效節省能量的繞送協定,藉此達到節省傳送功率消耗的目標。我們利用叢集管理者去調整每個裝置的傳送功率以及協助尋找最短消耗路徑,藉此我們不但可以達到增加網路壽命,同時也可以降低裝置間的干擾,提升網路的傳輸品質,我們將透過模擬實驗的結果來顯示我們相較於傳統的叢集演算法在減少功率消耗以及提升網路效能上有更好的表現。
Abstract
Energy saving, despite recent advances in extending battery life, is still an important issue in wireless ad hoc networks. An often adopted method is power management, which can help in reducing the transmission power consumption and thus can prolong the battery life of mobile nodes. In this paper, we present a new approach of power management for the wireless ad-hoc networks. Firstly, we propose a clustering algorithm. The clustering algorithm is incooperated with power adjustment and energy-efficient routing procedure to achieve the goal of reducing the transmission power. We use clusterheads to monitor a mobile node's transmission power and to conduct the routing path between any source-destination pair. Not only the lifetime of network is increased but also the interference in communication channel is reduced. As a result, the transmission quality is improved and the network throughput is enhanced. By simulation, we showed that our algorithm outperforms the traditional clustering algorithm both in power saving and in throughput.
目次 Table of Contents
中文摘要 I
Abstract II
目錄 III
圖目錄 V
表目錄 VI
一、導論 1
1.1 概論 1
1.2 研究動機 2
1.3 論文架構 3
二、背景知識及相關研究 4
2.1 Ad hoc無線網路 4
2.2 相關研究 7
2.2.1 叢集形成法 7
1. 最小ID叢集形成法法 8
2. 最大連結度叢集形成法 9
3. 加權式叢集形成法 10
2.2.2 傳統繞路演算法 10
1. Destination Sequence Distance Vector(DSDV) 11
2. Ad hoc On-Demand Distance Vector(AODV) 11
2.2.3 功率繞路演算法 11
1. MPR:Minimum Power Routing 12
2. COMPOW及CLUSTERPOW 13
3. PARO:Power-Aware Routing Optimization 14
三、 以功率為基礎的叢集演算法 15
3.1系統假設與模型 15
3.2 叢集形成法 16
3.3 叢集維護 23
3.4 路徑繞送 25
3.5 路徑維護 27
四、模擬實驗 29
4.1 叢集個數 30
4.2 功率消耗 31
4.3 生存時間 34
4.4 網路產量 35
五、結論 37
參考文獻 38
參考文獻 References
[1] S. Bandyopadhyay and E.J. Coyle," An energy efficient hierarchical clustering algorithm for wireless sensor networks", IEEE INFOCOM 2003, San Francisco, USA, pp.1713 -1723.
[2] S. Banerjee and A. Misra,"Minimum Energy Paths for Reliable Communication in Multi-hop Wireless Networks", ACM MobiHOC 2002, Lausanne, Switzerland, pp.146-156.
[3] S. Basagni, I. Chlamtac, and V. R. Syrotiuk,“ Dynamic source routing for ad-hoc networks using the global positioning system”, IEEE Wireless Communications and Networking Conference 1999 (WCNC'99), New Orleans, USA, pp. 301-305.
[4] D. Bertsekas, Data Networks, Prentice Hall, 1992.
[5] M. Chatterjee, S.K. Sas, D. Turgut, “An on-demand weighted clustering algorithm (WCA) for ad hoc networks”, Global Telecommunications Conference 2000 ( Globecom 2000), 2000, pp. 1697-1701.
[6] T.A. ElBatt, S.V. Krishnamurthy, D. Connors and S. Dao," Power management for throughput enhancement in wireless ad-hoc networks",IEEE International Conference on Communications (ICC), New Orleans, USA, 2000, pp. 1506 -1513.
[7] M. Gerla, G. Pei, and S. J. Lee, " Multicluster, Mobile, Multimedia Radio Network", ACM Wireless Networks, vol.1, no.3, 1995, pp.255-265.
[8] J. Gomez, AT Campbell, M. Naghshineh, C. Bisdikian," Conserving transmission power in wireless ad hoc networks", Proceedings IEEE Conference on Network Protocols, Riverside, USA, 2001, pp. 24-34.
[9] Z.J. Haas, “A new routing protocol for the reconfigurable wireless networks”, International Conference on Universal Personal Communications ( ICUPC), San Diego, USA, 1997, pp. 562-566
[10] C. C. Huang, R. S. Chang, and M. H. Guo," Weight-based clustering multicast routing protocol for mobile ad hoc networks", IEEE Wireless Communications and Networking Conference (WCNC) 2003, New Orleans, USA, pp. 1112 -1117.
[11] V. Kawadia and P.R. Kumar, "Power control and clustering in ad hoc networks", IEEE INFOCOM 2003, San Francisco, USA, pp. 459 -469.
[12] P. Krishna, N. H. Vaidya, M. Chatterjee, and D. K. Pradhan," A Cluster-based Approach for Routing in Dynamic Networks", ACM SIGCOMM Computer Communication Review, 1997, pp. 49-65.
[13] T. J. Kwon and M. Gerla, "Clustering with power control", IEEE Military Communications Conference Proceedings, Atlantic City, USA, 1999, pp. 1424 -1428.
[14] C. Lin and M. Gerla, "Adaptive clustering for mobile wireless networks", IEEE Journal on Selected Areas in Communications, vol.15, No 7, 1997, pp.1265-1275.
[15] S. Narayanaswamy, V. Kawadia, R. S. Sreenivas, and P.R. Kumar, "Power Control in Ad-Hoc Networks: Theory, Architecture, Algorithm and Implementation of the COMPOW Protocol." Proceedings of the European Wireless Conference, Florence, Italy, pp. 156-162
[16] C.E. Perkins and E.M. Royer, "Ad-hoc on-demand distance vector routing", Second IEEE Workshop on Mobile Computing Systems and Applications (WMCSA '99), New Orleans, USA, pp.90 - 100.
[17] T. S. Rappaport, Wireless Communications - Principles & Practice, Prentice Hall, 2001.
[18] S. Singh, M. Woo, and C. S. Raghavendra, "Power-Aware Routing in Mobile Ad Hoc Networks", Proceedings of the Fourth Annual ACM/IEEE International Conference on Mobile Computing and Networking, Oct. 1998, pp. 181-190
[19] C. K. Toh, "A novel distributed routing protocol to support ad-hoc mobile computing", Proceedings of 15th IEEE Annual International Phoenix Conference on Computers and Communications, Arizona, USA, 1996, pp. 480-486
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內外都一年後公開 withheld
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


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

QR Code