%0 Journal Article
%T Finding the Minimum MPR Set in OLSR Protocol with Genetic Algorithms<br>用遗传算法寻找OLSR协议的最小MPR集
%A ZHANG Xin-Ming
%A ZENG Yi-Ling
%A GAN Guo-Zheng
%A CHEN Guo-Liang
%A <br>张信明
%A 曾依灵
%A 干国政
%A 陈国良
%J 软件学报
%D 2006
%I 
%X The characteristic that nodes can enlist into the network topology freely and independently makes mobile Ad hoc networks (MANET) widely used in various environments such as disaster rescue, battlefield and so on. In MANET, the routing mechanism should adapt rapidly to the frequently changed network topology and in the mean time economize valuable network resources with its best. The Optimized Link State Routing Protocol (OLSR) is an important MANET routing protocol in which the key technique is MultiPoint Relays (MPR). After introducing the OLSR protocol and its MPR technique, the shortcoming of presently used heuristic algorithm in finding the minimum MPR sets is revealed. Then the new algorithm based on genetic algorithm (GA) is presented, and the convergence of the algorithm is proved. A series of 4 genetic algorithms are further developed by adopting different GA strategies and simulated in many topologies that are created randomly. Analysis on simulating results shows that the genetic algorithms are feasible and applicable and the choice of heuristic strategies is advisable and appropriate.
%K OLSR
%K MPR<br>启发式算法
%K 遗传算法
%K 移动Ad
%K hoc网络
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=E288FAAD927082E4&yid=37904DC365DD7266&vid=BCA2697F357F2001&iid=E158A972A605785F&sid=796A97DD793AE4A8&eid=502AE9EE93CAADD7&journal_id=1000-9825&journal_name=软件学报&referenced_num=4&reference_num=17