一种基于集合运算的MPR集选择算法  

Selection Algorithm of MPRs Based on Set Operation

作　　者：张洪[1,2] 朱国全[1] 王俊杰[1] ZHANG Hong ZHU Guoquan WANG Junjie(School of Information Science and Engineering, Chengdu 610106, China Key Laboratory of Pattern Recognition and Intelligent Irrformation Processing of Sichuan Province Chengdu University, Chengdu 610106, China)

机构地区：[1]成都大学信息科学与工程学院,四川成都610106 [2]成都大学模式识别与智能信息处理四川省高校重点实验室,四川成都610106

出　　处：《成都大学学报（自然科学版）》2017年第1期51-54,共4页Journal of Chengdu University（Natural Science Edition）

基　　金：成都大学校青年基金(2016XJZ14)资助项目

摘　　要：在传统的OLSR协议中有MPR集和非MPR集2种转发节点.MPR集是在广播洪泛的过程中挑选的转发广播的节点,但在某些情况下传统的MPR集并不是最优的,这样网络节点也会转发不必要的数据,造成资源浪费.针对经典算法的不足之处,提出一种逆向思维的新型算法,通过循环和集合运算相结合的方法有效剔除无效冗余的节点,不仅能达到传统OLSR协议的效果,而且比传统OSLR协议的数据开销更小、效率更高.最后,通过仿真平台(OPNET)实现重新定义OLSR的MPR集算法.结果表明,该算法对于网络吞吐量、数据包传输时延有一定的提升.There are two kinds of forwarding nodes in OLSR protocol, MPRs and non-MPRs. The MPRs is selected as the forwarding node in the broadcast flooding,but the MPRs is not the best under certain condi- tions. Thus, the network node will transmit the unnecessary data, resulting in the waste of resources. Aiming at the shortcomings of traditional algorithms, this paper proposes a new algorithm based on reverse thinking, which can eliminate the invalid redundant nodes effectively by combining the circulation method and the set operation. In this way, the effects of the traditional OLSR protocol can be achieved. Compared with the tra- ditional OLSR protocol, the new algorithm is more efficient with less data overhead. At last, the paper rede- fines the algorithm of MPRs of OLSR by simulation platform, OPNET. According to the results, the algo- rithm improves the network throughput, time lapse of packet transmission obviously.

关 键 词：OLSR MPR 集合运算 仿真 

分 类 号：TP393.06[自动化与计算机技术—计算机应用技术] TN929.5[自动化与计算机技术—计算机科学与技术]