OLSR路由协议的改进及其NS2仿真分析  

Simulation and Analysis of an improved OLSR Routing Protocol Based on NS2

作　　者：赵健[1] 孙俊锁[1] 

机构地区：[1]辽宁科技大学理学院,辽宁鞍山114044

出　　处：《计算机仿真》2008年第1期161-163,235,共4页Computer Simulation

基　　金：国家高技术研究发展计划(“863”计划)基金(863-701-2-4);辽宁省教育厅高等学校科技攻关计划项目(20040291)

摘　　要：研究了移动Ad hoc网络中的一种典型先应式表驱动路由协议:RFC3626最优链路状态路由协议(Optimized Link State Routing Protocol,OLSR),指出了该协议对MPR(Multipoint Relays)集合选择算法会导致该集合可能存在过多的冗余节点的不足之处,提出了一种改进的OLSR路由协议,通过对原MPR集合中节点的再次排序判断,除去了冗余节点。仿真结果表明:经过改进的OLSR在TC分组的发送数目、节点接受TC分组总数目、平均端到端延迟都得到了很大的改善,从而减少了TC分组的洪泛,提高了网络性能。The OLSR（ Optimized Link State Routing Protocol RFC3626） is a pre -active table driven routing protocol applied in Ad hoc networks. Through analysis, the shortcoming of MPR selecting that it may results in so many redundant nodes possibly in MPR set is revealed. Then an improved OLSR, which deletes the redundant nodes in MPR set by sorting and judging again, is presented. Simulation results show that the improved OLSR has good performances on the number of sending TC packets, received TC packets＇ number by all nodes and average end - to - end delay. So the improved OLSR reduces the TC packets＇ flooding, and improves the networks＇ performance.

关 键 词：移动自组网 路由协议 最优链路状态路由协议 多点中继 贪婪算法 

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