跳到主要內容

臺灣博碩士論文加值系統

(34.204.169.230) 您好!臺灣時間:2024/02/28 08:50
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:莊育祥
研究生(外文):Yu-Xiang Zhuang
論文名稱:利用分群於感測網路建構可靠且有效利用電力之骨幹
論文名稱(外文):An Energy-Efficient and Reliable Backbone Construction Using Clustering Method in Sensor Network
指導教授:吳帆吳帆引用關係
指導教授(外文):Fan Wu
學位類別:碩士
校院名稱:國立中正大學
系所名稱:資訊管理所
學門:電算機學門
學類:電算機一般學類
論文種類:學術論文
論文出版年:2006
畢業學年度:95
語文別:英文
論文頁數:35
中文關鍵詞:骨幹分群感測網路可靠
外文關鍵詞:Sensor NetworkEnergy-EfficientReliableBackboneCluster
相關次數:
  • 被引用被引用:0
  • 點閱點閱:768
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:2
Energy-efficient operations are essential to prolonging the lifetime of wireless sensor networks. Clustering is one method that can reduce energy consumption by aggregating data, putting redundant sensor nodes to sleep. In this paper, we will use a cluster algorithm in ad hoc [12] to build backbone. Using this cluster algorithm [12] can obviate both the requirements of collecting neighbor information beforehand and the iterative negotiating steps of electing cluster heads and choose cluster heads have good coverage. But in this algorithm [12], each node must broadcast a control packet for one time to prevent some nodes not receive this information. But in dense network, it would be a waste and will cause a lot of traffic and collision. In this paper, we will introduce a method to reduce the quantity of control packet when clustering. Secondly, we present how to increasing reliability of backbone in an energy-efficient way. Our philosophy is to reduce the burden of nodes on backbone. Because such nodes have much more chance to transmit data. And decrease the burden of nodes on backbone can prolong the lifetime of backbone and reduce the rebuilding times. Thirdly, we introduce a method to decrease the waiting time of each node when rebuilding. Because in algorithm of [12], the node’s waiting time is direct ration to the distance to sink node. It may cause a long delay of data transmission.
Energy-efficient operations are essential to prolonging the lifetime of wireless sensor networks. Clustering is one method that can reduce energy consumption by aggregating data, putting redundant sensor nodes to sleep. In this paper, we will use a cluster algorithm in ad hoc [12] to build backbone. Using this cluster algorithm [12] can obviate both the requirements of collecting neighbor information beforehand and the iterative negotiating steps of electing cluster heads and choose cluster heads have good coverage. But in this algorithm [12], each node must broadcast a control packet for one time to prevent some nodes not receive this information. But in dense network, it would be a waste and will cause a lot of traffic and collision. In this paper, we will introduce a method to reduce the quantity of control packet when clustering. Secondly, we present how to increasing reliability of backbone in an energy-efficient way. Our philosophy is to reduce the burden of nodes on backbone. Because such nodes have much more chance to transmit data. And decrease the burden of nodes on backbone can prolong the lifetime of backbone and reduce the rebuilding times. Thirdly, we introduce a method to decrease the waiting time of each node when rebuilding. Because in algorithm of [12], the node’s waiting time is direct ration to the distance to sink node. It may cause a long delay of data transmission.
Contents
Abstract 3
1 Introduction 3
2 Related works 6
3 Propose algorithm 9
3.1 Assumption 10
3.2 Backbone Formation 10
3.2.1 Cluster Head Selection and Issue 11
3.2.2 Control Packet Reduction 13
3.2.3 Connector and back up node selection 25
3.2.4 Backbone rebuilding mechanism 27
4 Performance Evaluation 31
5 Conclusion 34
Reference 36
[1] Y. Xu, J. Heidemann, and D. Estrin, “Geographyinformed Energy Conservation for Ad-hoc Routing,” Proc. 7th Annual ACM/IEEE Int’l. Conf. Mobile Comp. and et., 2001, pp. 70–84.
[2] Y. Yu, D. Estrin, and R. Govindan, “Geographical and Energy-Aware Routing: A Recursive Data Dissemination Protocol for Wireless Sensor Networks “, UCLA Comp.
Sci. Dept. tech. rep., UCLA-CSD TR-010023, May 2001.
[3] B. Karp and H. T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Sensor Networks “, Proc. MobiCom 2000, Boston, MA, Aug. 2000.
[4] I. Stojmenovic and X. Lin, “GEDIR: Loop-Free Location Based Routing in Wireless Networks“, Int’l. Conf. Parallel and Distrib. Comp. and Sys., Boston, MA, Nov. 3–6, 1999.
[5] 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.
[6] Seema Bandyopadhyay and Edward J. Coyle School of Electrical and Computer Engineering Purdue University West Lafayette, IN, USA “An energy efficient hierarchical clustering algorithm for wireless sensor networks“, INFOCOM. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE 2003
[7] J. N. Al-Karaki et al., “Data Aggregation in Wireless Sensor Networks — Exact and Approximate Algorithms, “ Proc. IEEE Wksp. High Perf. Switching and Routing 2004, Phoenix, AZ, Apr. 18–21, 2004.
[8] Q. Li, J. Aslam and D. Rus, “Hierarchical Power-Aware Routing in Sensor Networks, “, Proc. DIMACS Wksp. Pervasive Net., May, 2001.
[9] Ossama Younis and Sonia Fahmy, “HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad Hoc Sensor Networks“, IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 3, NO. 4, OCTOBER-DECEMBER 2004
[10] Jongsik Jung, Taekeun Park, and Cheeha Kim, Member, IEEE “A forwarding scheme for reliable and energy-efficient data delivery in cluster-based sensor network“ IEEE COMMUNICATIONS LETTERS, VOL. 9, NO. 2, FEBRUARY 2005
[11] Christopher M. Cianci, Vlad Trifa, and Alcherio Martinoli, “Threshold-based algorithms for power-aware load balancing in sensor networks“, Swarm Intelligence Symposium, 2005. SIS 2005. Proceedings 2005 IEEE
8-10 June 2005 Page(s):349 - 356
[12] Manki Min, Feng Wang, Ding-Zhu Du, “A Reliable Virtual Backbone Scheme in Mobile Ad-Hoc Networks“, IEEE International Conference on Mobile Ad-hoc and Sensor Systems 2004
[13] Yu Wang, Weizhao Wang, Xiang-Yang Li, “Distributed Low-Cost Backbone Formation for Wireless Ad Hoc Networks“, MobiHoc’05, May 25–27, 2005, Urbana-Champaign, Illinois, USA. ACM
[14] WAN, P.-J., ALZOUBI, K. M., and FRIEDER, O., “Distributed construction of connected dominating set in wireless ad hoc networks“, In INFOCOM (2002).
[15] Deb, B., Bhatnagar, S., and Nath, B., “A topology discovery algorithm for sensor networks with applications to network management”, In IEEE CAS Workshop Wireless Commun. Networking, Pasadena, CA, September 5–6, 2002.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top