一种双层树型高能效多链路由算法

A Two-Layer Tree-Type Energy Efficient Multi-Link Routing Algorithm

针对PEGASIS协议算法的单链维护成本高,COSEN协议算法的交叉链和长链多、数据逆传递严重等缺陷,提出一种双层树型高能效多链路由算法(TTEMR)。TTEMR算法把网络节点分为两层,底层将网络节点构造成多条分链,选取主链头和分链链头构造顶层链头链。对成链过程中产生的孤立点进行树型结构化处理以降低数据传递路径长度,优化主链头和分链链头选取策略及成链规则,并对Sink附近的普通节点和链头进行不入链操作以减少数据逆传递。仿真实验结果表明,与LEACH、PEGASIS和COSEN算法相比,TTEMR算法在每轮节点的存活数量、网络的稳定周期和生命周期、每轮剩余总能量及单位链路段平均路径长度等性能方面表现优异。

In order to overcome the high maintenance cost of the single-link of the PEGASIS protocol algorithm,and solve the defects of the COSEN protocol algorithm such as the large number of cross-links and long-links,data reverse transmission,a two-layer tree-type energy efficient multi-link routing algorithm(TTEMR)is proposed.TTEMR algorithm divides the network nodes into two layers,the bottom layer constructs the network nodes into multiple sub-links,then select the main link-leader and the sub-link-leaders to construct the top layer link-leader link.To reduce the length of the data transfer path,handling isolated points using a tree structure during the linking process,optimizing the selection strategies of the main link-leader and the sub-link-leaders and the link-forming rules,and avoid common nodes and sub-link-leaders near the Sink node into the link to reduce the reverse transmission of data.Simulation results show that compared with LEACH,PEGASIS and COSEN algorithm,TTEMR algorithm excels in the performance of each round of nodes,the stability period and life cycle of the network,the total energy remaining in each round,and the average path length per unit link segment.