摘要
在PEGASIS算法基础上，采用模拟退火算法进行簇的形成，同时利用能量因素来选择每一轮的簇头．采用模拟退火算法后链路的长度平方与比原来采用贪婪算法的相比，降低了一半左右，从而减小了整个网络能量的消耗，大大延长了第1个节点的死亡时间．第1个节点的死亡时间为原算法的1．8～3倍以上，20％、50％和80％的节点死亡时间也都比原算法的要长，由此提高了整个网络的生存周期．
In this paper, based on PEGASIS algorithm, we use SA for cluster formation and select each head cluster by means of energy factor. After using simulated annealing algorithm（SA）,the total length of the route is reduced by half compared with that using greedy algorithm. Otherwise the death time of the first node is greatly extended. The death time for the first node is 1.8 times or even three times more than that of the original algorithm, and the death time for the 20% ,50% and 80% nodes is also longer than the original algorithm, whereby improving the survival of the whole network of cycle.
出处
《江南大学学报（自然科学版）》
CAS
2008年第4期438-442,共5页
Joural of Jiangnan University (Natural Science Edition)
基金
浙江省科技计划项目(2005C31001)
关键词
无线传感器网络
路由协议
模拟退火算法
节能
生存周期
wireless sensor networks
routing protocol
simulated annealing algorithm（SA）
energy saving
lifetime
