期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于缓存旁路和本地修复的多跳网络路由重建机制 被引量：2

Cache Bypass and Local Recovery Based Route Reconstruction Scheme for Mobile Ad hoc Networks
下载PDF
导出
摘要 该文针对多跳网络中现有AODV和AODV-BR按需路由算法的弊端,提出了基于缓存旁路和本地修复的AODV-CL路由重建机制。该机制利用空闲时间监听无线信道中传输的所有数据包和路由控制信令,用于维护有效的邻居节点列表及本地路由缓存,有效降低了周期性HELLO消息带来的信令负担,并增加了可用路由信息。中间节点在发现断链时,尝试采用局部修复,尽量避免由源节点广播RREQ消息发现路由。根据本地路由缓存及邻居节点的路由信息,实现了快速的路由发现及修复,能有效降低路由控制信令开销及丢包率。 According to the disadvantages of the existing AODV and AODV-BR schemes in Ad hoc networks, a cache bypass and local recovery based route reconstruction scheme is proposed in this paper. The mobile node listens in all frames including data packets and routing control signaling in its free time, and maintains a neighbor list and local route cache, thus well reduces signaling cost brought by the periodical HELLO messages, and gains more usable route information. Once the intermediate node detects a broken link, it tries local recovery, instead of broadcasting RREQ messages to achieve route discovery from the source node. Fast route discovery and local recovery will be achieved according to local route cache and neighbors＇ route caches, thus routing control signaling and packet drop ratio are well reduced.
作者 王玉明 杨宗凯 赵大胜
机构地区 华中科技大学电子与信息工程系
出处 《电子与信息学报》 EI CSCD 北大核心 2007年第7期1622-1627,共6页 Journal of Electronics & Information Technology
基金 国家自然科学基金(60202005)资助课题
关键词 无线自组织网络 按需路由 路由修复 旁路路由 Mobile Ad hoc networks On-demand routing Route recovery Bypass routing
分类号 TP393 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献9

  • 1Royer E and Toh C.A review of current routing protocols for Ad hoc mobile wireless networks.IEEE Personal Communications,1999,6(2):46-55.
  • 2Perkins C,Royer E,and Das S.Performance comparison of two on-demand routing protocols for Ad hoc networks.IEEE Personal Communications,2001,8(1):16-28.
  • 3Tsirigos A and Haas Z.Multi-path routing in the presence of frequent topological changes.IEEE Communications Magazine,2001,9(11):132-138.
  • 4郭晓峰,陈跃泉,陈贵海.一种累计多路径的移动自组网络路由策略[J].软件学报,2004,15(4):594-603. 被引量：22
  • 5Ogier R.and Ruthenburg V.Minimum-expected-delay alternate routing.Proc.of INFOCOM'92,Florence,1992:617-625.
  • 6Lee S and Gerla M.AODV-BR:Backup routing in Ad hoc networks.Proc.of WCNC'00,Chicago,Sep.2000:1311-1316.
  • 7Perkins C,Royer E,and Das S.Ad hoc on-demand distance vector routing.IETF RFC 3561,Jul.2003.
  • 8Perkins C.Ad hoc Networks.USA:Addison Wesley,2001:29-48.
  • 9Camp T,Boleng J,and Davies V.A survey of mobility models for Ad hoc network research.Wireless Communications and Mobile Computing:Special Issue on Mobile Ad hoc Networking,2002,2(5):483-502.

二级参考文献18

  • 1[1]Perkins CE, Bhagwat P. Highly dynamic destination-sequenced distance-vector routing for mobile computers. In: ACM SIGCOMM Symp. on Communication, Architectures and Protocols. New York: ACM Press, 1994. 234～244.
  • 2[2]Murthy S, Garcia-Luna-Aceves JJ. An efficient routing protocol for wireless networks. ACM Mobile Networks and App. J., Special Issue on Routing in Mobile Communication Networks, 1996,1(2):183～197.
  • 3[3]Johnson DB, Maltz DA. Dynamic Source Routing in Ad Hoc Wireless Networks. New York: Kluwer Academic Publishers, 1996. 153～181.
  • 4[4]Hu Y-C, Johnson DB. Caching strategies in on-demand routing protocols for wireless ad hoc networks. In: Annual Int'l Conf. on Mobile Computing and Networking (MOBICOM). New York: ACM Press, 2000. 231～242.
  • 5[5]Perkins CE, Royer EM. Ad-Hoc on demand distance vector routing. In: IEEE Work-Shop on Mobile Computing Systems and Applications (WMCSA). New Orleans, 1999. 90～100.
  • 6[6]Park VD, Corson MS. A highly adaptive distributed routing algorithm for mobile wireless networks. In: Proc. of the IEEE INFOCOM'97. Washington DC: IEEE Computer Society, 1997. 1405～1413.
  • 7[7]Broch J, Johnson DB, Maltz DA. The dynamic source routing protocol for mobile ad hoc networks. Internet-Draft, draft-ietf-manet-dsr-09.txt, April 2003.
  • 8[8]Lee SJ, Gerla M. AODV-BR: Backup routing in ad hoc networks. In: Proc. of the IEEE WCNC 2000. Chicago, 2000. 1311～1316.
  • 9[9]Marina MK, Das SR. On-Demand multipath distance vector routing for ad hoc networks. In: Proc. of the Int'l Conf. for Network Procotols (ICNP). Riverside, 2001. 14～23.
  • 10[10]Nasipuri A, Das SR. On-Demand multipath routing for mobile ad hoc networks. In: Proc. of the 8th Int'l Conf. on Computer Communications and Networks (IC3N). Boston, 1999. 64～70.

共引文献21

同被引文献9

  • 1周元,李光胜,詹永照,侯义斌.Ad Hoc网络组播路由协议的设计与仿真[J].西安交通大学学报,2005,39(4):368-372. 被引量：1
  • 2卢昊,郭伟.保存下两跳节点策略在AODV路由算法中的应用[J].计算机科学,2005,32(4):110-112. 被引量：2
  • 3葛文英,李腊元.AODV路由协议局部修复机制的优化与仿真研究[J].武汉理工大学学报（交通科学与工程版）,2007,31(3):464-467. 被引量：2
  • 4CORSON S, MACKER J. RFC 2501 Mobile ad hoc networking (MANET): routing protocol performance issues and evaluation considerations [S]. Reston, VA, USA: Internet Society, 1999.
  • 5PERKINS C, ROYER E, DAS S. RFC 3561 Ad hoc on-demand distance vector routing [S]. Reston, VA, USA: Internet Society, 2003.
  • 6ARON I D, GUPTA S. Analytical comparison of local and end-to-end error recovery in reactive routing protocols for mobile ad hoc networks [C] // Proceedings of the 3rd ACM International Workshop on Modeling Analysis and Simulation of Wireless and Mobile Systems. New York, USA: ACM, 2000: 69-76.
  • 7FENG Meiyu, CHENG Sheng, ZHANG Xu, et al. A self-healing routing scheme based on AODV in ad hoc Networks[C] // Proceedings of the 4th International Conference on Computer and Information Technology. Los Alamitos, CA, USA: IEEE Computer Society, 2004: 616-620.
  • 8PANDEY M, PACK R, LEI W, et al. To repair or not to repair: helping ad hoc routing protocols to distinguish mobility from congestion [C]//INFOCOM 2007. Piscataway, NJ, USA: IEEE, 2007: 2311- 2315.
  • 9郑杰,屈玉贵,郭淑杰,赵保华.无线传感器网络低时延能量均衡安全路由[J].西安交通大学学报,2008,42(2):161-165. 被引量：5

引证文献2

二级引证文献1

电子与信息学报
2007年 第7期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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