基于OLSR协议的最小MPR集选择算法

发布时间：2019-01-01 11:58

【摘要】：针对传统优化链路状态路由(OLSR)协议中利用贪婪算法求解最小多点中继(MPR)集时存在冗余的问题,提出了一种基于全局改进的Global_OP_MPR算法。首先引入了一种基于贪婪算法改进的OP_MPR算法,该算法通过逐步优化MPR集的方法去除冗余,可以简单高效地得到最小MPR集;然后在OP_MPR算法的基础上,将全局因素加入MPR选择判据中,引入"全局优化"代替"局部优化",最终利用该算法可以得到整个网络的最小MPR集。在OPNET上采用Random Waypoint运动模型进行仿真,与传统OLSR协议相比,采用OP_MPR和Global_OP_MPR算法的OLSR协议在整个网络上有效地减少了MPR节点的数量,并且具有更少的网络负担拓扑控制(TC)分组数和更低的网络延时。仿真结果表明,所提出的算法均能优化MPR集的大小,提高协议的网络性能;同时,Global_OP_MPR算法由于考虑了全局因素,达到了更好的网络性能效果。
[Abstract]:Aiming at the redundant problem in solving the minimum multipoint relay (MPR) set by greedy algorithm in the traditional link state routing (OLSR) protocol, a globally improved Global_OP_MPR algorithm is proposed. Firstly, an improved OP_MPR algorithm based on greedy algorithm is introduced. By gradually optimizing the MPR set, the minimum MPR set can be easily and efficiently obtained by removing redundancy. Then on the basis of OP_MPR algorithm, the global factors are added to the MPR selection criterion, and "global optimization" is introduced instead of "local optimization". Finally, the minimum MPR set of the whole network can be obtained by using this algorithm. Compared with the traditional OLSR protocol, the OLSR protocol using OP_MPR and Global_OP_MPR algorithm can effectively reduce the number of MPR nodes in the whole network. And has less network burden topology control (TC) packet number and lower network delay. Simulation results show that the proposed algorithm can optimize the size of the MPR set and improve the network performance of the protocol. At the same time, the Global_OP_MPR algorithm can achieve better network performance because of considering the global factors.
【作者单位】：湖南大学电气与信息工程学院;国防科学技术大学电子科学与工程学院;中国电子系统设备工程公司研究所;
【基金】：国家自然科学基金资助项目(91338105) 通信抗干扰技术国家级重点实验室基金资助项目通信网信息传输与分发技术重点实验室基金资助项目
【分类号】：TP393.04

【参考文献】