摘要
针对已有分簇算法中簇头选择不合理及传输距离过长的缺陷,提出了用于构建分布式簇树骨干网的EACT算法。算法引入了图论中极大权极大独立集和根树的概念,并借助簇头轮换机制均衡节点消耗。通过仿真表明,EACT能有效地提高网络生存期,具有效能高、时间复杂度和消息复杂度低的特性。
In order to solve the problem of inappropriate cluster head election and excessive long transmission distance, EACT(Energy-Aware Cluster-Tree)algorithm is proposed to organize the cluster tree backbone network. Based on root tree and Maximal Weighted Independent Set, EACT utilizes periodical rotation of cluster heads to balance the energy consumed by nodes. Simulation results demonstrate that EACT would significantly increase the lifetime of the network. And the approach bears the characteristics of energy efficiency, and low complexity.
出处
《传感技术学报》
CAS
CSCD
北大核心
2006年第4期1279-1283,共5页
Chinese Journal of Sensors and Actuators
关键词
无线传感器网络
极大权独立集
根树
簇树
:wireless sensor networks
independent set
root tree
cluster-tree