首页 | 本学科首页   官方微博 | 高级检索  
     

基于完全图的能量高效可靠分簇算法
引用本文:张擎,曲德祥,柴乔林. 基于完全图的能量高效可靠分簇算法[J]. 计算机工程, 2010, 36(5): 91-94
作者姓名:张擎  曲德祥  柴乔林
作者单位:1. 山东大学艺术学院,济南,250100
2. 山东省工会管理干部学院,济南,250100
3. 山东大学计算机科学与技术学院,济南,250061
摘    要:在采用多跳通信方式的分簇无线传感器网络中,接近sink点的簇头负担较重,容易过早耗尽能量而失效,引起大量簇重组。针对该问题,基于完全图理论提出一种能量高效可靠分簇算法以均衡簇间负载,设计动态簇头轮换机制来实现快速簇头选举和故障处理。仿真结果表明,该算法能延长网络生命周期、节约网络能耗、提高网络可靠性。

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

Energy-Efficient Reliable Clustering Algorithm Based on Complete Graph
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
Authors:ZHAGN Qing  QU De-xiang  CHAI Qiao-lin
Affiliation:ZHAGN Qing1,QU De-xiang2,CHAI Qiao-lin3
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.
Keywords:Wireless Sensor Network(WSN)  complete graph  reliability  clustering algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号