检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]华中科技大学电子与信息工程系,湖北武汉430074
出 处:《通信学报》2009年第7期27-35,共9页Journal on Communications
基 金:国家自然科学基金资助项目(60502023)~~
摘 要:针对简单泛洪效率低的问题,提出了一个限制洪泛的高效的路由广播算法,通过Euclidean距离来限制路由发现过程中请求分组被转发的次数;研究了减少路由维护开销,并降低路由发现的频率的方法,提出了一个基于节点高度的路由修复与优化算法,该算法使用节点监听来对链路断裂的路由进行修复与优化。基于限制泛洪的高效的路由广播算法和路由修复优化算法,提出了一种新的低开销的MANET网络按需路由协议LOOR(low overhead on-demand routing)。仿真结果表明,新协议增强了路由的顽健性,减少了路由跳数,降低了路由发现的频率,提高了数据分组递送率,并显著地降低了路由控制开销。To improve the performance of flooding, an efficient broadcasting algorithm with constrained flooding was proposed, this algorithm only selected efficient some from all routing packets to forward according to Euclidean Distance A packet listening method, which could reduce route maintenance overhead and route discovery frequency, was studied, then a local route repair and optimization algorithm, which was based on node height and can repair the failure path due to link breakage, was presented. Furthermore, based on the efficient broadcasting algorithm and local route repair and optimization algorithm, a new on-demand routing protocol, named LOOR(low overhead on-demand routing), was proposed. The simulation results on ns2 show that LOOR can enhance the route robustness, decrease the average hop count, the route discovery frequency and the routing overhead obviously, and increase the packet delivery ratio.
关 键 词:无线移动自组织网络 泛洪 路由维护 路由开销 节点高度
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.112