LEACH-C协议中模拟退火算法的改进  

Improvement algorithm for simulated annealing in LEACH-C protocol

作　　者：牛伟伟[1] 高铁杠[1] 

机构地区：[1]南开大学软件学院,天津300071

出　　处：《计算机工程与设计》2011年第6期1869-1872,1917,共5页Computer Engineering and Design

基　　金：国家自然科学基金项目(60873117)

摘　　要：无线传感器网络的LEACH-C协议在实现过程中,使用了模拟退火算法进行簇头节点集合的选择。虽然该算法选举的簇头能够使整个网络的传输代价最小,但是算法执行的效率比较低。因此,在原来算法的基础上,提出了一种改进的算法。理论上表明该算法在每次迭代后得到的新解必然比原来的解更优;实验结果表明,该方法能够更快地得到一个局部最优解,改进后的算法在整体性能上比原算法有很大提高,尤其是在网络中的节点数不断增加的情况下,从而缩短了选举簇头节点的时间消耗。Simulated annealing algorithm is used to elect a cluster head set in the implemention of LEACH-C protocol of wireless sensor networks. The resulting transmission cost of the whole network is minimized, but the efficiency of the algorithm is low. Therefore, an improved method is proposed based on the original one. It is proved theoretically that, the new solution after each iteration by the improved method will be better than the original one. The experiments show that the local optimal solution will be approached faster, The results indicate that the proposed scheme has much better performance compared with the original algorithm, especially when the number of nodes in a network becomes more and more, thus the time cost on electing cluster heads is cut down.

关 键 词：无线传感器网络 LEACH—C 模拟退火算法 几何中心点 局部最优解 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]