基于孤立点的全局最小MPR集选择算法  

Global Minimum MPR Set Selection Algorithm Based on Isolated Points

作　　者：李绍帅[1] 文鸿[1] 赵子龙[1] 沈小建[1] 欧阳旻[1] 

机构地区：[1]湖南工业大学计算机与通信学院,湖南株洲412007

出　　处：《湖南工业大学学报》2016年第2期48-52,共5页Journal of Hunan University of Technology

基　　金：湖南省自然科学基金资助项目(14JJ3123);湖南省教育厅科研基金资助项目(15K035;15C0408;14A037)

摘　　要：针对OLSR协议中采用贪婪算法选择最小MPR集存在的冗余问题,提出了基于孤立点的全局最小MPR集选择算法。通过逐步剔除可达数最小的一跳节点,产生新孤立点,获取最小MPR集;当可达数最小的一跳节点不唯一时,考虑全局MPR节点的影响,优化整个网络的MPR节点数量。仿真结果表明:本文所提的MPR选择算法相对于基于贪心策略的MPR选择算法,整个网络MPR节点数量减少7%,控制消息开销明显降低,网络性能得到提高。Aiming at the redundancy problem in the OLSR protocol, a global minimum MPR set selection algorithm based on the isolated points is proposed. The algorithm generates a new isolated point by eliminating step by step the minimum reachable number of nodes and obtains the minimum MPR set. At the same time, the effect of the global MPR node is considered when the minimum reachable number of nodes are not unique, so as to optimize the number of MPR nodes in the whole network. Experimental results show that compared with the MPR selection algorithm based on greedy strategy,the proposed MPR selection algorithm decreases the number of MPR nodes in the whole network by 7%, reduces the network control message overhead significantly and improves the network performance.

关 键 词：孤立点 最小MPR集 优化链路状态路由协议 冗余 全局最优 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]