期刊文献+

An Ant Colony Algorithm Based Congestion Elusion Routing Strategy for Mobile Ad Hoc Networks 被引量:2

An Ant Colony Algorithm Based Congestion Elusion Routing Strategy for Mobile Ad Hoc Networks
下载PDF
导出
摘要 A critical challenge for mobile ad hoc networks is the design of efficient routing protocols which are able to provide high bandwidth utilization and desired fairness in mobile wireless environment without any fixed communication establishments. Although extensive efforts have already been devoted to providing optimization based distributed congestion elusion strategy for efficient bandwidth utilization and fair allocation in both wired and wireless networks,a common assumption therein is the fixed link capacities,which will unfortunately limit the application scope in mobile ad hoc networks where channels keep changing. In this paper,an effective congestion elusion strategy is presented explicitly based on ant colony algorithm for mobile ad hoc networks, which will explore the optimal route between two nodes promptly,meanwhile forecast congestion state of the link. Accordingly,a new path will be found rapidly to have the flow spread around to relieve the congestion degree. Compared with OLSR,the strategy proposed will greatly reduce the packet loss ratio and the average end-to-end delay at the same time,which illustrate that it will make use of networking resource effectively. A critical challenge for mobile ad hoc networks is the design of efficient routing protocols which are able to provide high bandwidth utilization and desired fairness in mobile wireless environment without any fixed communication establishments. Although extensive efforts have already been devoted to providing optimization based distributed congestion elusion strategy for efficient bandwidth utilization and fair allocation in both wired and wireless networks,a common assumption therein is the fixed link capacities,which will unfortunately limit the application scope in mobile ad hoc networks where channels keep changing. In this paper,an effective congestion elusion strategy is presented explicitly based on ant colony algorithm for mobile ad hoc networks, which will explore the optimal route between two nodes promptly,meanwhile forecast congestion state of the link. Accordingly,a new path will be found rapidly to have the flow spread around to relieve the congestion degree. Compared with OLSR,the strategy proposed will greatly reduce the packet loss ratio and the average end-to-end delay at the same time,which illustrate that it will make use of networking resource effectively.
出处 《Journal of Harbin Institute of Technology(New Series)》 EI CAS 2013年第3期99-103,共5页 哈尔滨工业大学学报(英文版)
基金 Sponsored by Specialized Research Fund for the Doctoral Program of Higher Education (Grant No. 20122301120004) China Postdoctoral Science Foundation (Grant No. 2012M520778) Heilongjiang Province Postdoctoral Science Foundation (Grant No. LBH-Z12217) Research Foundation of Education Bureau of Heilongjiang Province the Youth Science Fund Project of Heilongjiang University (Grant No. QL201110)
关键词 mobile ad hoc networks congestion elusion ant conloy algorithm CERS OLSR mobile ad hoc networks congestion elusion ant conloy algorithm CERS OLSR
  • 相关文献

参考文献2

二级参考文献12

  • 1沈波,张世永,钟亦平.无线传感器网络分簇路由协议[J].软件学报,2006,17(7):1588-1600. 被引量:267
  • 2杨文国,郭田德,赵彤.基于动态规划的无线传感器网络的路由算法[J].计算机研究与发展,2007,44(5):890-897. 被引量:19
  • 3Dorigo M, Maniezzo V, Colorni A. The Ant System: Optimization by a Colony of Cooperating Agents[J]. IEEE Transactions on Systems, Man, and Cybernetics: Part 13, 1996, 26(1): 29-41.
  • 4Jacobson V, Karels M J.Congestion avoidance and control[J]. ACM Computer Communication Review, 1988,18(4) :314-329.
  • 5Floyd S.A report on some recent developments in TCP congestion control[J].IEEE Communications Magazine,2001,39(4) :84-90.
  • 6Floyd S, Jacobson V.Random early detection gateways for con- gestion avoidance[J].IEEE/ACM Transactions on Networking, 1993,1 (4) : 397-413.
  • 7Feng Wuchang, Kandlur D D, Saha D, et al.A self-configuring RED gateway[C]//INFOCOM ' 99, New York, 1999 (3) : 1320-1328.
  • 8Floyd S, Gummadi R, Shenker S.Adaptive RED: An algorithm for increasing the robustness of RED's active queue management[EB/OL]. ( 2001 ).http://www.icir.org/floyd/papers.html#2001.
  • 9Salaheddin H E.Analysis of random drop for gateway conges- tion control, LCS TR-465[R].Cambridge: Massachusetts Institute of Technology, 1989.
  • 10柯欣,孙利民.多跳无线传感器网络吞吐量分析[J].通信学报,2007,28(9):78-84. 被引量:8

共引文献5

同被引文献9

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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