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

计算机工程 ›› 2010, Vol. 36 ›› Issue (5): 91-94. doi: 10.3969/j.issn.1000-3428.2010.05.034

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

基于完全图的能量高效可靠分簇算法

张 擎1,曲德祥2,柴乔林3   

  1. (1. 山东大学艺术学院,济南 250100;2. 山东省工会管理干部学院,济南 250100;3. 山东大学计算机科学与技术学院,济南 250061)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-03-05 发布日期:2010-03-05

Energy-Efficient Reliable Clustering Algorithm Based on Complete Graph

ZHAGN Qing1, QU De-xiang2, CHAI Qiao-lin3   

  1. (1. School of Fine Arts, Shandong University, Jinan 250100; 2. Shandong Institute of Trade Unions’ Administration Cadre, Jinan 250100; 3. Department of Computer Science & Technology, Shandong University, Jinan 250061)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-03-05 Published:2010-03-05

摘要: 在采用多跳通信方式的分簇无线传感器网络中,接近sink点的簇头负担较重,容易过早耗尽能量而失效,引起大量簇重组。针对该问题,基于完全图理论提出一种能量高效可靠分簇算法以均衡簇间负载,设计动态簇头轮换机制来实现快速簇头选举和故障处理。仿真结果表明,该算法能延长网络生命周期、节约网络能耗、提高网络可靠性。

关键词: 无线传感器网络, 完全图, 可靠性, 分簇算法

Abstract: In clustering Wireless Sensor Network(WSN) using multi-hop routing, the nearer to the sink node, the more load will be put on the header, headers near the sink node will quickly lose energy and cause a lot of process of re-clustering. Aiming at these problems, this paper proposes Energy-Efficient Reliable Clustering(EERC) algorithm for WSN based on complete graph to balance energy cost among clusters, designs a dynamic header alternation mechanism to supporting quick header selection and failure recovery. Simulation results show that this algorithm can overwhelm in prolonging network lifetime, reduce energy cost and support reliable data delivery.

Key words: Wireless Sensor Network(WSN), complete graph, reliability, clustering algorithm

中图分类号: