Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/7897
標題: 適應性樹狀拓撲在無線感測網路中實現資料壓縮融合之研究
Adaptive Tree Topology for Data Aggregation in Wireless Sensor Networks
作者: 林克合
Lin, Ke-He
關鍵字: sensor networks
感測網路
出版社: 電機工程學系所
引用: [1]L. Blazevic, S. Giordano, and J. Le Boudec. Self-Organizing Wide-Area Routing. In SCI 2000/ISAS 2000,July 2000. [2]Jason Lester Hill “System Architecture for Wireless Sensor Networks,” Master thesis of U.C Berkeley. Spring 2003. [3] E. M. Royer. and S. Barbara. “A review of current routing protocols for ad hoc mobile wireless networks”, IEEE Personal Communications, Vol. 6, 2, pp. 46-55,1999. [4] C E Perkins, and P. Barbara. “Highly dynamic destination-sequenced distance-vector routing. (DSDV) for mobile computers” ACM SIGCOMM'94 Conference on communications Architectures, Protocols and Applications, pp. 234-44, 1994. [5]S. Murthy, and J. J. Garcia-Luna-Aceves, “An efficient routing protocol for wireless networks”, ACM Mobile Networks and Applications, pp. 183-97,1996. [6] D. B. Johnson, and D. A. Maltz, “Dynamic source routing in ad-hoc wireless networks,” Mobile Computing, T. lmielinski and H. Korth, Eds., Kluwer, pp. 153-8 1, 1996. [7] V. D. Park, and M. S. Corson, “A highly adaptive distributed routing algorithm for mobile wireless networks”, Proceeding INFOCOM ‘97, 1997. [8]Andreas Savvides, Chih Chieh Han and Mani B. Strivastava. “Dynamic fine-grained localization in Ad-Hoc networks of sensors” International Conference on Mobile Computing and Networking. Proceedings of the 7th annual international conference on Mobile computing and networking. [9]Tan Huseyin Ozgur , Korpeoglu Ibrahim and Stojmenovic Ivan. “A Distributed and Dynamic Data Gathering Protocol for Sensor Networks ” IEEE International Conference on Advanced Networking and Applications 2007 [10]H. T. Kung and D. Vlah “Efficient Location Tracking Using Sensor Networks” Proceedings of 2003 IEEE Wireless Communications and Networking Conference (WCNC) [11] Chih-Yu Wen and William A. Sethares, “Automatic Decentralized Clustering for Wireless Sensor Networks,” in EURASIP Journal on Wireless Communications and Networking, vol. 2005, no. 5, pp. 686-697, October 2005. (SCI) [12]Liming He, “Delay-Minimum Energy-Aware Routing Protocol (DERP) for Wireless Sensor Networks ” International Conference on Artificial Intelligence, Networking, and Parallel/Distributed Computing ,July 30 2007 [13]W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan. Energy-efficient communication protocol for wireless micro sensor networks ,” In 33rd Annual Hawaii InternationalConference on System Sciences” pages 3005 - 3014, 2000. [14]Chiti F., De Cristofaro A., Fantacci R. ,Tarchi D., Collodo G., Giorgetti G.abd Manes A."Energy efficient routing algorithms for application to agro-food wireless sensor networks" IEEE International Conference on Communications, 2005. [15]Shah R.C., Rabaey J.M."Energy aware routing for low energy ad hoc sensor networks" IEEE Wireless Communications and Networking Conference, 2002. WCNC2002. 2002 [16]Xuhui Hu,Yong Liu , Lee M.J. and Saadawi T.N. “Efficient route update protocol for wireless sensor networks ” IEEE Military Communications Conference, 2003 [17]Xuhui Hu,Yong Liu , Lee M.J. and Saadawi T.N. “Route update and repair in wireless sensor networks” IEEE Consumer Communications and Networking Conference, 2004
摘要: 無線感測網路有許多實際的用途,例如醫療照護、軍事、環境監控等等。在WSN系統中有許多路徑的通訊協定目的都是為了要讓系統間路徑的傳送有較高的能量運用效率,讓傳輸的路徑更加的穩定,減少網路在傳輸過程中資源的浪費。在論文中我們提出了一個感測網路上結合分散式跟集中式系統優點的架構,此系統擁有自我組織能力並且可以有效率的資料傳輸減少傳輸消耗的能量。這演算法是以適應性樹狀拓撲為基礎架構。在這架構之下所生成的Tree有最小的Level數,所以每個收集資料結點跟Sink結點之間路徑最短,所需花費能量為最小。當感測結點在網路中損壞或是加入新的感測結點有可能造成原本路徑損壞或是改變,因此維持路徑確保資料傳輸是很重要的議題。我們所提出路徑維持的通訊協定,在當路徑損壞或是改變時,我們只需要區域性的去修復或是改變路徑,依舊可以維持網路良好的運作。由模擬結果來驗證我們所提出來的方法,可以使WSN系統有較佳的擴展性,並且讓網路可以有更穩固的架構。
There are a lot of applications for wireless sensor networks (WSNs) such as medical care, military and environmental monitoring. Many routing protocols for WSNs have been designed to achieve high energy-efficiency, high reliability, low overhead, etc. In this paper we propose a hybrid , self organizing and energy efficient data gathering algorithm for wireless sensor networks. The proposed algorithm is based on Adaptive Branch-based Spanning Tree (ABST) structure. By applying the algorithm, the level of the generated tree is minimized so that the total energy consumption of route from the source to the sink is minimal. Moreover route maintenance protocols are described to rearrange the route locally when facing sensor failures and admission of new sensors. The simulation results show that the proposed approach provides scalability and robustness for network operation.
URI: http://hdl.handle.net/11455/7897
其他識別: U0005-0708200812395200
文章連結: http://www.airitilibrary.com/Publication/alDetailedMesh1?DocID=U0005-0708200812395200
Appears in Collections:電機工程學系所

文件中的檔案:

取得全文請前往華藝線上圖書館



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.