摘要
无线传感器网络资源有限,通常采用分簇聚合减少传输数据,本文提出了一种基于聚合收益的动态成簇算法.首先,针对网络整体能耗最优化问题,建立一个非线性整数规划模型,进而提出一种近似最优、低复杂度的启发式簇头选举算法.在此基础上,提出一种分布式的、基于聚合收益的动态成簇算法,可分布式实现该簇头选举算法并进行成簇.理论分析和实验仿真表明,基于聚合收益的动态成簇算法能较好地解决节点负载均衡问题,提高网络能耗效率,延长网络生命周期.
With limited resources, wireless sensor networks usually use clustering aggregation to decrease traffic. This paper proposes a dynamic clustering algorithm based on aggregation gains.Firstly, we present a non-linear integer programming model for the overall energy consumption of the network op "~on problem, and then ~ a low complex and near optimal heuristic cluster head election algorithm. A dynamic clustering algorithm is proposed based on aggregation gains, which can elect the cluster head in a distributed way. Theoretical analysis and experimental results show that the propos~ dynamic clusterin~ algorithm can re- solve the load balance problem, improve the network energy efficiency, and prolong the network lifetime.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2010年第B02期128-132,共5页
Acta Electronica Sinica
基金
国家863高技术研究发计划(No.2006AA01Z227)
湖南省科技厅科技计划(No.2009FJ3083)
关键词
无线传感器网络
聚合收益
非线性整数规划
簇头选举
动态成簇
wireless sensor network
aggregation gains
non-linear integer programming
cluster head election
dynamic clus- tering