Responsive image
博碩士論文 etd-0715117-094008 詳細資訊
Title page for etd-0715117-094008
論文名稱
Title
無線感測網路中具省電功能之區域化鏈結形成機制
An Energy-Efficient Localized Chain Formation Scheme for Wireless Sensor Networks
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
67
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2017-07-12
繳交日期
Date of Submission
2017-08-15
關鍵字
Keywords
無線感測網路、階層式路由、鏈結式架構、多重鏈結、區域化鏈結
WSNs, hierarchical routing, localized chain, multiple chain, chain-based
統計
Statistics
本論文已被瀏覽 5692 次,被下載 42
The thesis/dissertation has been browsed 5692 times, has been downloaded 42 times.
中文摘要
無線感測網路是由許多具有感測、運算以及無線通訊功能的感測節點所構成的網路系統,由於感測節點具備體積小且成本低的特性,所以無線感測網路通常被應用在環境惡劣或人類不易到達的地方,也因此幾乎無法充電,故如何延長整個感測網路的存活時間是一個很重要的議題。
在無線感測網路的路由機制中,階層式路由能有效的達到省電的效果,其中以鏈結式架構為主的路由方法在平衡每個感測節點的消耗電量上有較好的表現[12]。 Lindsey等人提出的PEGASIS[10]是以貪婪式演算法建立單一鏈結的方式來傳輸資料,但是使用貪婪式演算法容易在感測節點間形成長距離鏈結,造成較高的電量消耗,而且因為長鏈結也會導致較高的資料傳輸延遲。因此,有學者[4,5,14]提出將網路拓樸分成幾個較小的區域以形成多重鏈結的方式來改善上述問題,但這些方法並未考慮到各個區域中的感測節點數量,導致每個鏈結中的節點數量不均。
本篇論文主要針對這個缺點,提出一個建立多重鏈結的方法,來平衡各個鏈結的成員數量,避免各個鏈結頭間電量消耗不均的問題,並且也能減少長距離鏈結的數量,以延長整個無線感測網路的存活時間。模擬結果顯示我們的區域化鏈結演算法在感測網路存活時間及平均消耗電量都優於CHIRON[4] 和EBCRP[14]。
Abstract
Wireless Sensor Networks (WSNs) consist of hundreds to thousands of small nodes with sensing, simple computation, and wireless communications capabilities. Because of the characteristic of small size and low cost, sensor nodes are usually operated in harsh places where human presence is risky or even impossible. Since their lifetime is dependent on their batteries and replacing or recharging their batteries is impossible in rough places, it is essential that the network be energy efficient in order to extend the network lifetime.
Hierarchical routing is an efficient way to lower energy consumption in wireless sensor networks. Among all the existing routing protocols, chain based routing is a better routing method to balance energy dissipation in the network[12]. Lindsey et al. proposed a chain-based routing protocol named PEGASIS[10] which establishes a single chain by using greedy algorithm to transfer data, but it is likely to have a long distance link among sensor nodes that causes high energy consumption. Furthermore, long chain will also lead to higher data transmission delay. Some researchers[4,5,14] devise routing protocols which divide the sensing area into small areas to form multiple chain to solve above problems, but they do not consider the number of sensor nodes in per chain.
This thesis presents a chain-based routing protocol for Wireless Sensor Networks. The aim of this work is to form a balanced multiple chain to avoid unbalanced energy dissipation among chain leaders and lower the number of long distance link to extend the network lifetime. Simulation results show that our proposed localized chain formation scheme is better than CHIRON[4] and EBCRP[14] in network lifetime and average energy dissipation.
目次 Table of Contents
論文審定書 i
誌謝 ii
摘要 iii
Abstract iv
目錄 v
圖次 viii
表次 xi
第一章 導論 1
1.1 無線感測網路簡介 1
1.2 無線感測網路的路由協定簡介 7
1.3 研究動機 10
1.4 論文架構 11
第二章 相關研究 12
2.1 LEACH 13
2.2 PEGASIS 17
2.3 CHIRON 19
2.4 EBCRP 22
第三章 系統架構與運作 25
3.1 環境假設與無線電模組 25
3.1.1 環境假設 25
3.1.2 無線電模組 26
3.2 區域化鏈結形成機制(Localized Chain Formation Scheme) 27
3.2.1 建立單一鏈結(Single chain construction) 27
3.2.2 插入孤立節點(Isolated node insertion) 37
3.2.3 分割鏈結(Chain split) 39
3.2.4 選擇鏈結頭(Leader selection) 40
3.2.5 資料傳送(Data transmission) 40
3.3 演算法複雜度分析 41
第四章 模擬結果與討論 44
4.1 模擬環境假設 44
4.2 模擬環境參數設定 45
4.3 模擬數據分析與討論 45
4.3.1 節點存活數量與回合數的比較 45
4.3.2 每回合平均消耗電量 47
4.3.3 鏈結長度平方和比較 48
第五章 結論 51
參考文獻 52
參考文獻 References
[1] J. N. Al-Karaki and A. E. Kamal, "Routing Techniques in Wireless Sensor Networks: a Survey," IEEE Wireless Communications, vol. 11, no. 6, pp. 6-28, Dec. 2004.
[2] F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, “A Survey on Sensor Networks,” IEEE Communications Magazine,” vol. 40, no. 8, pp. 102-114, Aug. 2002.
[3] D. Braginsky and D. Estrin, “Rumor Routing Algorithm for Sensor Networks,” in Proceedings of the First Workshop on Sensor Networks and Application, pp. 22-31, Atlanta, USA, Sep. 2002.
[4] K. H. Chen, J. M. Huang and C. C. Hsiao, "CHIRON: An Energy-efficient Chain-based Hierarchical Routing Protocol in Wireless Sensor Networks," in Proceedings of Wireless Telecommunications Symposium, pp. 1-5, Prague, Czech Republic, Apr. 2009.
[5] K. Du, J. Wu and D. Zhou, "Chain-based Protocols for Data Broadcasting and Gathering in the Sensor Networks," in Proceedings of International Parallel and Distributed Processing Symposium, pp. 1926-1933, Nice, France, Apr. 2003.
[6] W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy-efficient Communication Protocol for Wireless Microsensor Networks," in Proceedings of the 33rd Annual Hawaii International Conference on System Sciences, pp. 3005-3014, Hawaii, USA, Jan. 2000.
[7] W. B. Heinzelman, A. P. Chandrakasan, and H. Balakrishnan, "An Application-specific Protocol Architecture for Wireless Microsensor Networks," IEEE Transactions on Wireless Communications, vol. 1, no. 4, pp. 660-670, Oct. 2002.
[8] C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann , and F. Silva, “Directed Diffusion for Wireless Sensor Networking,” IEEE/ACM Transactions on Networking, vol. 11, no. 1, pp. 2-16, Feb. 2003.
[9] J. Kulik, W. R. Heinzelman, and H. Balakrishnan, “Negotiation-based Protocols for Disseminating Information in Wireless Sensor Networks,” Wireless Networks, vol. 8, no. 2-3, pp. 169-185, Mar. 2002.
[10] S. Lindsey, C. Raghavendra, and K. M. Sivalingam, "Data Gathering Algorithms in Sensor Networks Using Energy Metrics," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 9, pp. 924-935, Sep. 2002.
[11] Z. Mahlobogwane, S. Ngwira, and T. Zuva, "An Improved Energy Efficient Chain Based Routing in Wireless Sensor Networks," in Proceedings of International Conference on Computing, Communication and Security, pp. 1-6, Pamplemousses, Mauritius, Dec. 2015.
[12] Q. Mamun, "A Tessellation-based Localized Chain Construction Scheme for Chain-Oriented Sensor Networks," IEEE Sensors Journal, vol. 13, no. 7, pp. 2648-2658, Jul. 2013.
[13] S. Mao and Y. T. Hou, "BeamStar: An Edge-based Approach to Routing in Wireless Sensor Networks," IEEE Transactions on Mobile Computing, vol. 6, no. 11, pp. 1284-1296, Nov. 2007.
[14] B. X. Rong, Z. Shi, X. D. Yu, and Q. Z. Ttao, "An Energy-balanced Chain-cluster Routing Protocol for Wireless Sensor Networks," in Proceedings of Second International Conference on Networks Security, Wireless Communications and Trusted Computing, pp. 79-84, Wuhan, China, Apr. 2010.
[15] Y. Xu, J. Heidemann, and D. Estrin, "Geography-informed Energy Conservation for Ad Hoc Routing," in Proceedings of ACM International Conference on Mobile Computing and Networking, pp. 70-84, Rome, Italy, Jul. 2001.
[16] Y. Yu, D. Estrin, R. Govindan, "Geographical and Energy-Aware Routing: A Recursive Data Dissemination Protocol for Wireless Sensor Networks", UCLA Computer Science Department Technical Report, UCLA/CSD-TR-01-0023, May 2001.
[17] M. M. Zanjireh and H. Larijani, "A Survey on Centralised and Distributed Clustering Routing Algorithms for WSNs," in Proceedings of IEEE 81st Vehicular Technology Conference, pp. 1-6, Glasgow, UK, May 2015.
[18] Y. Zhong, J. Feng and, Q. Xiong, "Interest Earliest Arrival First Directed Diffusion in WSNs," in Proceedings of International Conference on Wireless Communications, Networking and Mobile Computing, pp. 2543-2546, Shanghai, China, Sep. 2007.
[19] M. Zorzi and R. R. Rao, "Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Energy and Latency Performance," IEEE Transactions on Mobile Computing, vol. 2, no. 4, pp. 349-365, Oct. 2003.
[20] Smart Dust, http://robotics.eecs.berkeley.edu/~pister/SmartDust/
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:自定論文開放時間 user define
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


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

QR Code