摘要
为了延长网络的生存时间,需要设计能量有效的协议,以适应传感器网络的特点。本文在LEACH的基础上,提出了一种适合无线传感器网络的能量有效的成簇算法DEEAC。在DEEAC中,每一个节点均基于最优簇首概率popt自主地确定自己是否为临时簇首。该临时簇首通过收集到的簇内信息,根据簇内通信总能耗最小化原则,选择一个使得簇内通信代价尽可能小且在最近(rmod(1/popt))轮中没有成为簇首的簇内节点作为该轮的最终簇首。模拟实验表明,DEEAC与LEACH相比具有更好的性能,优化后的簇首选择策略可以在不同场景下有效延长网络的生存时间。
In order to prolong the network＇s lifetime, energy efficient protocols should be designed to adapt the characteristic of wireless sensor networks. Based on LEACH, we propose a novel clustering algorithm DEEAC for wireless sensor networks, which better suits the periodical data gathering applications. In DEEAC, sensors elect themselves to be local tentative cluster-heads at any given time with a certain probability Popt. Then these tentative cluster-heads,based on minimizing the total energy dissipation within the cluster, select a node which is closest to the center of cluster and had not to be the cluster-head in the last （r mod （1/popt）） round. DEEAC is able to distribute energy dissipation evenly throughout the sensors networks, and extend the network lifetime. Simulation results show that DEEAC outperforms LEACH significantly with prolonging the network lifetime in different scenes.
出处
《电子测量技术》
2007年第4期209-212,共4页
Electronic Measurement Technology
关键词
无线传感器网络
成簇算法
能量有效
wireless sensor network
clustering algorithm
energy-efficient
