摘要
无线传感器网络(WSNs)需要简单而有效的算法提高网络的生存周期。在经典的分簇算法LEACH基础上,根据节点剩余能量进行竞争,剩余能量大于阈值的节点可以选为簇头。在选择簇头时,各节点设置延时时间,根据邻节点数、到已选定簇头的距离2个因素进行竞争,选择合适的节点成为簇头。算法稳定了簇头数量,并使簇头分布更合理。仿真和数据分析表明:算法能显著提高网络的生存周期。
Wireless sensor networks( WSNs) need simple and effective algorithms to prolong lifetimes of networks. Propose a multiple competitive cluster heads( MCCH) selection algorithm. Cluster head candidates are selected based on residual energy competition. A node can be selected as the cluster head if its residual energy is greater than the threshold. In the choice of cluster heads,each node sets delay time,competition is carried out according to two factors: One is the number of adjacent nodes,the other is the distances to the selected cluster heads. MCCH stabilizes the number of cluster heads and makes the distribution of cluster heads more reasonable.Through simulation and data analysis,it is proved that the algorithm can significantly improve the network lifetime.
出处
《传感器与微系统》
CSCD
2018年第2期140-142,146,共4页
Transducer and Microsystem Technologies
基金
国家自然科学基金资助项目(61202350)
关键词
无线传感器网络
能量均衡
分簇
网络生存周期
wireless sensor networks (WSNs)
energy-balanced
clustering
network lifetime