论文部分内容阅读
传统的优化链路状态路由协议采用贪心算法在计算最小多点中继集合时存在很大冗余,所以提出了一种改进的O_MPR算法。基于贪心算法改进的算法通过去除冗余可以简单高效地得到最小MPR集合,使得网络中MPR节点数量最小。在NS2上进行仿真实验,同原OLSR协议相比较,使用改进O_MPR算法的OLSR协议在网络中明显地减少了MPR节点个数,使得网络拓扑控制消息数量降低,改善了网络负担,提高了网络性能。
The traditional optimization of link state routing protocol using greedy algorithm in calculating the minimum multipoint relay set there is a lot of redundancy, so an improved O_MPR algorithm is proposed. The improved algorithm based on greedy algorithm can get the minimum MPR set simply and efficiently by removing the redundancy, so that the number of MPR nodes in the network is the minimum. Compared with the original OLSR protocol, the OLSR protocol using the improved O_MPR algorithm reduces the number of MPR nodes significantly in the network, reduces the number of network topology control messages, improves the network load and improves the network performance .