摘要: 基于优化链路状态路由协议的多点中继(MPR)集选择算法(GLOBAL_OP_MPR)在网络拓扑稳定的情况下能有效减少网络中的MPR节点数,但在网络拓扑变化的情况下会出现冗余。为此,提出一种能适应网络拓扑变化的MPR集选择算法(GLOBAL_AD_MPR)。该算法在不增加算法复杂度的情况下,通过将选定的MPR节点再次遍历去除冗余,从而得到更优的MPR节点集合。实验结果表明,与GLOBAL_OP_MPR算法相比,GLOBAL_AD_MPR算法能有效降低数据包传输时延及网络开销,提高网络吞吐量。
关键词:
优化链路状态路由协议,
多点中继,
Ad-hoc网络,
自适应算法,
转发模块
Abstract: The Multi-point Relay(MPR) set selection algorithm based on Optimized Link State Routing(OLSR) protocol (GLOBAL_OP_MPR) can effectively reduce the number of MPR nodes in the network when the network topology is stable.However,redundancy occurs when network topology changes.In order to solve the problem,this paper proposes a MPR set selection algorithm(GLOBAL_AD_MPR) that can adapt to the changes of network topology.The algorithm eliminates the redundancy again by selecting the selected MPR node again without increasing the complexity,and obtains a better set of MPR nodes.Experimental results show that the GLOBAL_AD_MPR algorithm improves network throughput and reduces packet transmission delay and network cost compared with GLOBAL_OP_MPR algorithm.
Key words:
Optimized Link State Routing(OLSR) protocol,
Multi-point Relay(MPR),
Ad-hoc network,
adaptive algorithm,
forward module
中图分类号:
陈炼,任智,葛利嘉,李桂林. 基于优化链路状态路由协议的自适应MPR集选择算法[J]. 计算机工程.
CHEN Lian,REN Zhi,GE Lijia,LI Guilin. Adaptive MPR Set Selection Algorithm Based on Optimized Link State Routing Protocol[J]. Computer Engineering.