期刊文献+

低开销的MANET网络按需路由协议 被引量:3

Low overhead on-demand routing protocol for mobile ad hoc networks
下载PDF
导出
摘要 针对简单泛洪效率低的问题,提出了一个限制洪泛的高效的路由广播算法,通过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.
作者 江国星 易明
出处 《通信学报》 EI CSCD 北大核心 2009年第7期27-35,共9页 Journal on Communications
基金 国家自然科学基金资助项目(60502023)~~
关键词 无线移动自组织网络 泛洪 路由维护 路由开销 节点高度 mobile ad hoc networks flooding route maintenance routing overhead node height
  • 相关文献

参考文献2

  • 1Srdjan ?apkun,Maher Hamdi,Jean-Pierre Hubaux. GPS-free Positioning in Mobile Ad Hoc Networks[J] 2002,Cluster Computing(2):157~167
  • 2Yu-Chee Tseng,Sze-Yao Ni,Yuh-Shyan Chen,Jang-Ping Sheu. The Broadcast Storm Problem in a Mobile Ad Hoc Network[J] 2002,Wireless Networks(2-3):153~167

同被引文献15

  • 1刘永强,严伟.移动自组网络中基于启发式环索算法的Anycasting路由的研究[J].计算机学报,2005,28(10):1608-1613. 被引量:3
  • 2CHLAMTAC I, CONTI M, LIU JN. Mobile Ad Hoc networking: imperatives and challenges[J]. Ad Hoc Networks, 2003, 1(1): 13-64.
  • 3PERKINS C, BELDING-ROYER E, DAS S. IETF RFC 3561, AODV Ad Hoc on-demand distance vector routing[S] , 2003.
  • 4NI S Y, TSENG Y C, CHEN Y S, et al. The broadcast storm problem in a mobile Ad Hoc network[C] // Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking. New York: ACM, 1999: 151-162.
  • 5HASSAN J, JHA S. Optimising expanding ring search for multi-hop wireless networks[C] // IEEE Global Telecommunications Conference. New York: IEEE, 2004:1061-1065.
  • 6WU K, YANG H C, LI F. Pessimism is mostly the best in the expanding ring search for wireless networks[C] // Proceedings of IEEE Global Telecommunications Conference Globecom. New York: IEEE, 2006: 1-5.
  • 7JING D, ZUYEV S. On search sets of expanding ring search in wireless networks[J]. Ad Hoc Networks, 2008, 6(7):1168-1181.
  • 8PARK I, KIM J, PU I. Blocking expanding ring search algorithm for efficient energy consumption in mobile Ad Hoc networks[C] // Proceedings of 3rd Annual Conference on Wireless On-demand Network Systems and Services. New York: IEEE, 2006:191-195.
  • 9PHAM N D, CHOO H. Energy efficient expanding ring search for route discovery in MANET[C] // IEEE Communications 2008. New York: IEEE, 2008:3002-3006.
  • 10RACHURI K K, MURTHY C S R. On the scalability of expanding ring search for dense wireless sensor networks[J]. Journal of Parallel and Distributed Computing, 2010, 70(9):917-929.

引证文献3

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部