摘要
设计了一种基于投票的簇头选举方法,该方法使节点向能量大的节点投票,并且选票的传播距离只有一跳,不被转发,确保了邻居较多、剩余能量大的节点能够获得较多的选票.结合网络能耗来计算最优簇头个数,有效克服了LEACH协议中分簇个数和簇头选择机制上存在不足.仿真结果表明,本方法能较好适用于图书馆环境,达到监测目的.
In this paper,a vote based cluster head election mechanism is proposed.Which makes the nodes vote others whose energy are larger than themselves,meanwhile the ballot can't be forward.This method insures only the nodes have more neighbors and remaining energy can get more ballots.At the same time,the cluster head number must be chosen according to network energy consumption.These methods overcome deficiencies of cluster number and cluster head selection mechanism in LEACH protocol.Simulation results show that the method can be applied to library environment monitoring and achieve the desired purpose.
出处
《微电子学与计算机》
CSCD
北大核心
2011年第10期101-104,共4页
Microelectronics & Computer
关键词
无线传感器网络
分簇
投票
图书馆环境监测
wireless sensor networks
cluster
vote
library environmental monitoring