作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2008, Vol. 34 ›› Issue (12): 88-90. doi: 10.3969/j.issn.1000-3428.2008.12.030

• 网络与通信 • 上一篇    下一篇

一种不均衡的无线传感器网络分簇算法

袁辉勇1,2,李小龙2,戴经国1,易叶青1,2   

  1. (1. 湖南人文科技学院计算机系,娄底 417000;2. 湖南大学计算机与通信学院,长沙 410082)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-06-20 发布日期:2008-06-20

Unequal Clustering Algorithm for Wireless Sensor Network

YUAN Hui-yong1,2, LI Xiao-long2, DAI Jing-guo1, YI Ye-qing1,2   

  1. (1. Department of Computer Science, Hunan Institute of Humanities, Science and Technology, Loudi 417000; 2. College of Computer and Communication, Hunan University, Changsha 410082)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-06-20 Published:2008-06-20

摘要: 传感器网络的通信方式可分为多跳和单跳两种。如果采用多跳方式,靠近基站的簇头因传送数据较多而导致较早死亡,在单跳方式中,远离基站的簇头因传送数据能耗太高而很快死亡。针对上述问题,该文提出一种不均衡的分簇算法,使靠近基站的簇规模较大,给出计算簇规模的方法。实验表明,相对LEACH协议,该算法能延长网络生命周期25%左右。

关键词: 传感器网络, 数据收集, 不均衡分簇, 生命周期

Abstract: Communication modes of sensor network can be categorized into two types: multi-hop and single-hop. If the previous is adopted, cluster heads closer to the base station tend to die earlier because more data packets are needed to transmit. If all cluster heads transmit data packets directly to the base station, nodes further from the base station will die much more quickly than those closer to the base station. To address the problems, this paper proposes an unequal clustering algorithm. The algorithm enables that clusters closer to the base station have bigger size. In addition, it presents a method to compute the size of clusters. Simulation results show that the proposed algorithm outperforms LEACH with prolonging the network lifetime by over 25%.

Key words: sensor network, data gathering, unequal clustering, lifetime

中图分类号: