跳到主要內容

臺灣博碩士論文加值系統

(18.97.14.87) 您好!臺灣時間:2025/02/09 10:18
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:王冠儒
研究生(外文):Guan-Ru Wang
論文名稱:無線感測網路中以叢集為基礎的省電繞徑協定
論文名稱(外文):Energy Efficient Routing Protocol in Cluster-Based Wireless Sensor Networks
指導教授:劉如生
指導教授(外文):Ru-Sheng Liu
學位類別:碩士
校院名稱:元智大學
系所名稱:資訊工程學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2006
畢業學年度:94
語文別:中文
論文頁數:32
中文關鍵詞:無線感測網路LEACH-C叢集
外文關鍵詞:Wireless Sensor NetworksLEACH-CCluster
相關次數:
  • 被引用被引用:0
  • 點閱點閱:173
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
無線感測網路(Wireless Sensor Networks)通常可使用在環境監控、交通監視和軍事環境的偵測等方面,由於其應用上的多樣性,因此在近年來受到廣泛的研討。 基本上,無線感測網路是由資料收集中心(Base Station)和一群感測節點所組成。 資料收集中心具有強大的資料收集、處理以及儲存能力。 然而,一般的感測節點則受限於電池電量,通常只負責環境感測和收集傳送感測資料。 為了降低感測節點的電量消耗以延長整體網路的壽命,近年來有許多論文提出具叢集架構特性的繞徑機制以達到該目的。

LEACH-C [2] 為一篇以叢集架構為主的典型論文,該論文的繞徑機制包含數個回合,每個回合可分為Set-up和Steady-state階段。 在Set-up階段,資料收集中心會根據感測節點的電量和座標資訊來決定叢集的代理人(Cluster Head)。 在Steady-state階段,每個叢集的代理人將會收集叢集內感測資訊,直接傳送給資料收集中心。 然而,該項做法將會導致距離資料收集中心較遠的叢集代理人很快的耗盡電量。

在本篇論文,我們提出一個低傳輸成本的繞徑機制,主要的做法為兩階段的低成本路徑建立機制,同步化的TDMA排程以及可調整叢集代理人的法則。 經由網路環境模擬,顯示出本篇論文的繞徑機制在電量上的使用效率、網路的存活時間和均衡的電量消耗上,均優於LEACH-C所提出的方法。
Wireless sensor networks (WSNs) are utilized in environment monitoring, traffic surveillance and military situation awareness,...etc. Due to their broad varieties of applications, WSNs have received wide attentions in recent years. Basically, WSN consists of a base station (BS) and a large number of sensor nodes. BS usually provides powerful capabilities for data collection, processing and store. However, each sensor node is limited by its battery power, and is responsible for collecting & transmitting the sensed data only. In order to reduce the energy consumption of the sensor nodes and extend the whole network lifetime, many researchers have proposed the cluster-based routing protocols.

LEACH-C [2] is a well-known paper for cluster-based sensor network. Its routing protocol consists of several rounds, where each round includes the set-up and the steady-state phase. In set-up phase, base station will select the cluster heads (CHs) according to the energy and coordinate information of sensor nodes. In steady-state, each CH will collect the sensed data and transmit to BS directly. However, their methods may make the cluster heads far away from BS to exhaust the energy quickly.

In this paper, we propose an energy efficient routing architecture for WSNs. Our approaches are building 2-stage shortest path tree for routing algorithm, synchronizing the TDMA schedule and adjusting the cluster heads properly. Through simulation, the results show that our protocols are much better than the LEACH-C in terms of efficient energy usage, the network lifetime, and fairness of the energy consumption.
書名頁 I
中文摘要 II
英文摘要 III
誌謝 IV
目錄 V
圖目錄 VI
第一章 緒論 1
1.1 研究背景 1
1.2 研究動機 2
1.3 研究目的 4
1.4 論文貢獻 5
1.5 章節概要 5
第二章 相關研究 6
2.1 LEACH-C PROTOCOL 6
2.2 LMS-MR PROTOCOL 10
2.3 問題討論 13
2.4 RADIO MODEL 15
第三章 研究方法 16
3.1 SET-UP階段(組織CLUSTER) 17
3.1-1 選擇CH 17
3.1-2 兩階段的繞徑建立機制 18
3.1-3 Cluster的組成 20
3.2 STEADY-STATE階段(收集、傳輸資料) 21
第四章 模擬與分析 24
4.1 模擬參數設定 24
4.2 模擬結果與分析 25
第五章 結論與未來展望 30
參考文獻 31
1.W. Heinzelman, A. Chandrakasan and H. Balakrishnan, “Energy-Efficient Communication Protocol for Wireless Microsensor Networks,” Proc. 33rd Hawaii Int’l. Conf.Sys. Sci., Jan. 2000.
2.Wendi B. Heinzelman, Anantha P. Chandrakasan, and Hari Balakrishnan, “An application-specific protocol architecture for wireless microsensor networks”,IEEE transactions on wireless communications, vol. 1, no. 4, october 2002
3.A. Wang, W. Heinzelman, and A. Chandrakasan, “Energy-scalable protocols for battery-operated microsensor networks,” Proc. 1999 IEEE Workshop Signal Processing Systems (SiPS ’99), pp. 483–492, Oct. 1999.
4.Tillapart, P.; Thammarojsakul, S.; Thumthawatworn, T.; Santiprabhob, P., “An Approach to Hybrid Clustering and Routing in Wireless Sensor Networks,” Aerospace, 2005 IEEE Conference, 05-12 March 2005
5.Akyildiz, I.F.; Weilian Su; Sankarasubramaniam, Y.; Cayirci, E.; “A survey on sensor networks”, Communications Magazine, IEEE , Volume: 40 , Issue: 8 , Aug. 2002
6.Al-Karaki, J.N.; Kamal, A.E.; “Routing techniques in wireless sensor networks: a survey”, Wireless Communications, IEEE [see also IEEE Personal Communications] , Volume: 11 , Issue: 6 , Dec. 2004
7.De, S.; Chunming Qiao; Hongyi Wu, “Meshed multipath routing: an efficient strategy in sensor networks,” IEEE Wireless Communications and Networking, 2003. WCNC 2003., vol.3, Pages:1912 – 1917, March 2003

8.Jang, J.-S., Sun, C.-T. and Mazutani, “Neuro-Fuzzy and Soft Computing: a computational approach to learning and machine intelligence,” ISBN 0-13-261066-3, Prentice Hall, Upper Saddle River, NJ, USA,1997.
9.Seema Bandyopadhyay; Coyle, E.J.; “An energy efficient hierarchical clustering algorithm for wireless sensor networks”, INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE Volume 3, 30 March-3 April 2003.
10.Halgamuge, M.N.; Guru, S.M.; Jennings, A.; “Energy efficient cluster formation in wireless sensor networks”, Telecommunications, 2003. ICT 2003. 10th International Conference on Volume 2, 23 Feb.-1 March 2003.
11.Gupta, G.; Younis, M.; “Load-balanced clustering of wireless sensor networks”, Communications, 2003. ICC ''03. IEEE International Conference on Volume 3, 11-15 May 2003.
12.M. Ettus, “System capacity, latency, and power consumption in multihop-routed SS-CDMA wireless network,” Radio and Wireless Conference (RAWCON’98) Proceeding, 55-58, August 1998.
13.T. Murata and H. Ishibuchi, “Performance evaluation of genetic algorithms for flowshop scheduling problems,” Proc. 1st IEEE Conf. Evolutionary Computation, vol. 2, pp. 812–817, June 1994.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top