一种基于链路稳定性的最小MPR选择算法

Link-stability-based Minimum Multipoint Relay Selection Algorithm

MPR选择算法是移动自组网OLSR路由协议的关键组成部分,负责从节点的一跳邻居中选出能够覆盖所有两跳邻居的最小集合.现有的MPR选择算法虽然能够选出最小MPR集,但是未见考虑MPR链路的稳定性,对数据传输的可靠性存在不利影响.为此,提出一种基于链路稳定性的MPR选择算法,定义一种新的链路稳定性判据之后,在初始和当前覆盖度相同的节点中选择链路稳定性更好的节点作为MPR,从而延长了MPR节点集的有效时间,降低了拓扑变化对数据传输的影响.仿真系统测试数据显示新算法提高了吞吐量,降低了端到端时延和丢包率.

The MPR selection algorithm is a key component of the OLSR routing protocol for mobile ad hoc networks.It is responsible for selecting the smallest set of one-hop neighbors that can cover all two-hop neighbors.Although the existing MPR selection algorithm can select the smallest MPR set,it has not been considered that the stability of the MPR link has an adverse effect on the reliability of data transmission.Therefore,an MPR selection algorithm based on link stability is proposed.After defining a new link stability criterion,a node with better link stability is selected as the MPR among the nodes with the same initial and current coverage.Therefore,the effective time of the MPR node set is extended,and the influence of the topology change on data transmission is reduced.The test data of the simulation system shows that the new algorithm improves throughput and reduces end-to-end delay and packet loss rate.