基于邻居表的msstatePAN路由改进算法

Improved Routing Algorithm of msstatePAN Based on Neighbor Table

为解决msstatePAN协议栈的簇树路由算法(MTR)中数据包传输选择路径不是最优的问题,提出一种基于邻居表的路由改进算法(EMTR)。该算法利用当前节点、目的节点以及邻居表中邻居节点的信息,找到源节点到目的节点传输跳数最少的路径,并通过能量阈值筛选出能量过低的节点,通过比较节点链路质量选出跳数相同情况下的最优路径,同时可以有效避免在路径选择过程中所产生的冲突。仿真实验表明,相对于MTR算法,平均传输跳数减少35.8%,平均网络时延减少51.5%,仿真结束时,节点能耗节约16.1%。此算法既提供了近似最优的路由路径,又保持了无路由表维护开销和低内存消耗等优点,在邻居表维护开销有限的情况下,均衡了网络能量消耗,延长了网络生存时间,减少了传输时延和跳数。

This study proposes an improved routing algorithm based on the neighbor table,called EMTR,to solve the problem that the packet transmission path is not being optimal in the tree routing algorithm of msstatePAN.The algorithm uses the information of the current,destination,and neighbor nodes in the neighbor table to find the path with the least number of hops from the source node to destination node,filters the node with a low energy through threshold,selects the optimal path with the same number of hops by comparing the link quality indication of nodes,and effectively avoids the conflicts in the path selection process.Experimental results show that the number of transmission hops is reduced by 35.8%;the network delay is reduced by 51.5%;and the node energy consumption is reduced by 16.1%at the end of the simulation.The algorithm not only provides an approximate optimal routing path but also maintains the advantages of tree routing,such as no routing table maintenance overhead and low memory consumption.In the case of the limited neighbor table maintenance overhead,the algorithm balances the energy of the network nodes,prolongs the network lifetime,and reduces the transmission delays and hops.