期刊文献+

基于链路质量的移动Ad hoc路由算法

Routing Algorithm Based on Link Quality in Moblie Ad hoc Networks
下载PDF
导出
摘要 针对在移动Ad hoc网络中,由于节点移动和能量有限导致节点失效、传输链路不稳定的问题,改进原有链路剩余时间计算方法,并与节点剩余能量结合计算路径质量,将路径质量作为判决条件引入到AODV协议中,最终形成基于链路质量的路由算法。仿真表明改进的算法可提高选择路径的可靠性,降低丢包率和平均端到端时延。 Because of node mobility and energy limitation lead to node failure and transmission link instability in Ad hoc Net- works, improve original Link Lifetime calculation method, calculate path quality with node residual energy, the path quality as a judgment condition introduced into AODV protocol,Ultimately form routing algorithm based on link quality. Simulation results show that the improved algorithm can improve the selection path reliability and reduce the packet loss rate and the average end- to-end delay.
作者 曾格平 陈越 ZENG Ge-ping, CHEN Yue ( Chongqing University of Posts and Telecommunications, Chongqing 400065,China)
机构地区 重庆邮电大学
出处 《电脑知识与技术》 2013年第2期751-754,共4页 Computer Knowledge and Technology
关键词 路由算法 AODV 链路质量 routing algorithm AODV Link quality
  • 相关文献

参考文献7

  • 1Toh C-K. Ad hoc mobile wireless networks: protocols and systems[M].New Jersey: Prentice Hall, 2002.
  • 2WANG Yu.Collision avoidance in multi-hop Ad hoc networks[C].Proc of the 10th IEEE International Symposium on Modeling Analysis and Simulation of Computer and Telecom unications Systems(MASCOTS' 02).USA:IEEE,2002.
  • 3Chen Y,Wang G,Peng S.Link Lifetime-Based Segment-by-Segment Routing Protocol in MANETs[C].International Symposium on Paral- lel and Distribute Processing with Applications.2008.
  • 4Hadi Noureddine, Hamed Al-Raweshidy.A New Link Lifetime Prediction Method for Greedy and Contention-based Routing in Mobile Ad Hoc Networks[C]. 10th IEEE International Conference on Computer and Information Technology,2010.
  • 5刘元安,唐碧华,胡月梅.Ad hoc网络中的路由算法[J].北京邮电大学学报,2004,27(2):1-7. 被引量:35
  • 6黄蕾,刘立祥.Adhoc网络寻路阶段的合作激励机制研究[J].计算机学报,2008,31(2):262-269. 被引量:6
  • 7徐雷鸣,庞博,赵耀.NS与网络仿真[M].北京:人民邮电出版社,2003.

二级参考文献21

  • 1Wang W, EideNBenz S, Wang Y, Li X-Y. OURS: Optimal unieast routing systems in non-cooperative wireless networks//Proceedings of the Annual International Conference on Mobile Computing and Networking (MOBICOM). Los Angeles: ACM Press, 2006:402-413
  • 2Zhong S, Chen J, Yang R. Sprite: A simple, cheat-proof credit-based system for mobile Ad-hoc networks//Proceed ings of the INFOCOM. San Francisco: IEEE Press, 2003 1987-1997
  • 3Buchegger S, Boudec J-Y L. Performance analysis of the CONFIDANT protocol cooperation of nodes fairness in dynamic Ad hoc networks//Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC). Lausanne: ACM Press, 2002:226-236
  • 4Buchegger S, Boudec J-Y L. Self-policing mobile Ad hoe networks by reputation systems. IEEE Communications Magazine, 2005, 43(7): 101-107
  • 5He Q, Wu D, Khosl P. A secure incentive architecture for Ad-hoc networks. Wireless Communications and Mobile Computing, 2006, 6(3): 333-346
  • 6Marti S, Giuli T J, Lai K, Baker M. Mitigating routing misbehavior in mobile Ad hoe networks//Proceedings of the Annual International Conferenee on Mobile Computing and Networking(MOBICOM). Boston: ACM Press, 2000:255-265
  • 7Huang E, Crowcroft J, Wassell I. Rethinking incentives for mobile Ad hoc networks//Proceedings of the ACM SIGCOMM 2004 Workshops. Portland: ACM Press, 2004: 191-196
  • 8Carruthers R, Nikolaidis I. Certain limitations of reputation- based schemes in mobile environments//Proceedings of the 8th ACM Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems. Montreal: ACM Press, 2005:2-11
  • 9Srinivasan V, Nuggehalli P, Chiasserini C F, Rao R R. Cooperation in wireless Ad hoc networks//Proceedings of the INFOCOM. San Franeisco: IEEE Press, 2003:808-817
  • 10Milan F, Jaramillo J J, Srikant R. Achieving cooperation in multihop wireless networks of selfish nodes//Proceedings of ACM Workshop on Game Theory for Communications and Networks. Pisa: ACM Press, 2006

共引文献51

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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