高效的MPR选择算法

OLSR(optimized link state routing)协议中最重要的功能之一是多点中继(multi point relays, MPR)节点的选择,该协议中路由的计算就要依靠MPR选择相关表项。传统的MPR算法只是减少了同一区域内相同消息的泛洪,并没有考虑网络中新加入节点获取全网拓扑信息的时间问题。针对该问题进行了研究并提出一种高效的MPR选择算法,该算法有三个步骤:首先减少了部分拓扑控制(topology control, TC)消息冗余问题;然后选择MPR时考虑有效覆盖面积让新加入的节点获取全网拓扑信息所需的时间缩短;最后考虑到移动性对网络拓扑的影响,基于历史信息预估下一时刻节点的位置,增强了链路的稳定性。通过仿真,将改进的MPR算法与传统算法比较,端到端时延降低,数据包的传递成功率也有所提升。

MPR algorithm for faster acquisition of network topology

One of the most important functions in the OLSR(optimized link state routing) protocol is the selection of multipoint relays(MPR) nodes. The routing calculations in this protocol rely on MPR to select related entries. The traditional MPR algorithm only reduces the flooding of the same message in the same area, and does not consider the time for newly added nodes in the network to obtain the topology information of the entire network. This paper studied this problem and proposed an efficient MPR selection algorithm. The algorithm had three steps: Firstly, it reduced the problem of partial topology control(TC) message redundancy. And then it considered the effective coverage area when selecting MPR so that newly added nodes could obtain the entire network. It shortened the time required for topology information. Finally, considering the impact of mobility on the network topology, it estimated the location of the node at the next moment based on historical information, thereby enhancing the stability of the link. Through simulation, comparing the improved MPR algorithm with the traditional MPR algorithm, the end-to-end delay is reduced, and the success rate of data packet delivery is also improved.