摘要: 在采用多跳通信方式的分簇无线传感器网络中,接近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
中图分类号:
张 擎;曲德祥;柴乔林. 基于完全图的能量高效可靠分簇算法[J]. 计算机工程, 2010, 36(5): 91-94.
ZHAGN Qing; QU De-xiang; CHAI Qiao-lin. Energy-Efficient Reliable Clustering Algorithm Based on Complete Graph[J]. Computer Engineering, 2010, 36(5): 91-94.