基于PEGASIS算法的一种改进方案

An Improved Scheme Based on PEGASIS Algorithm

采用禁忌算法优化拓扑结构,并提出在出现节点死亡时,选择拓扑重构是全部节点参与还是直接将死亡节点在链上前后两个存活节点直接连接.同时,在簇头选择时,提出了一种综合考虑剩余能量最少节点在下一轮能耗、节点剩余能量和节点到基站距离的簇头选择算法,在数据传输阶段,比较节点到下一跳节点的距离和节点到簇头节点的距离,选择距离较短的路径.仿真结果表明,改进算法较PEGASIS算法第一个节点死亡时间延长了4.9倍,半数节点的死亡时间也得到了延长,从而提高了整个网络的生存时间.

This paper uses tabu algorithm to optimize the topology and puts forward the methods which is choosing topology reconstruction is involved in all nodes or directly to connect the surviving nodes before and after death node on the chain according to whether death nodes is on the long chain ,in the event of node dies .At the same time , when cluster leader is choosing ,the paper presents a algorithm which is comprehensive consider that the energy consumption of minimum residual energy nodes in the next round ,residual energy of nodes and the distance to base station ,in data transmission phase ,compares the distance of the nodes to the next hop node with the distance of the node to the cluster head nodes ,chooses the shorter path .Simulation results show that the lifetime of the first dead node is more than 4 .9 times of such node in PEGASIS ,the death time of half of the nodes is also longer ,so as to improve the survival time of the whole network .