Please submit manuscripts in either of the following two submission systems

    ScholarOne Manuscripts

  • ScholarOne
  • 勤云稿件系统

  • 登录

Search by Issue

  • 2024 Vol.31
  • 2023 Vol.30
  • 2022 Vol.29
  • 2021 Vol.28
  • 2020 Vol.27
  • 2019 Vol.26
  • 2018 Vol.25
  • 2017 Vol.24
  • 2016 vol.23
  • 2015 vol.22
  • 2014 vol.21
  • 2013 vol.20
  • 2012 vol.19
  • 2011 vol.18
  • 2010 vol.17
  • 2009 vol.16
  • No.1
  • No.2

Supervised by Ministry of Industry and Information Technology of The People's Republic of China Sponsored by Harbin Institute of Technology Editor-in-chief Yu Zhou ISSNISSN 1005-9113 CNCN 23-1378/T

期刊网站二维码
微信公众号二维码
Related citation:Dan-Yang Qin,Hong-Wei Li,Lin Ma,Hong-Bin Ma,Qun Ding.An Ant Colony Algorithm Based Congestion Elusion Routing Strategy for Mobile Ad Hoc Networks[J].Journal of Harbin Institute Of Technology(New Series),2013,20(3):99-103.DOI:10.11916/j.issn.1005-9113.2013.03.016.
【Print】   【HTML】   【PDF download】   View/Add Comment  Download reader   Close
←Previous|Next→ Back Issue    Advanced Search
This paper has been: browsed 1866times   downloaded 1140times 本文二维码信息
码上扫一扫!
Shared by: Wechat More
An Ant Colony Algorithm Based Congestion Elusion Routing Strategy for Mobile Ad Hoc Networks
Author NameAffiliation
Dan-Yang Qin Electronic Science and Technology Post-Doctoral Research Center, Heilongjiang University, Harbin 150001, China 
Hong-Wei Li Harbin Research Institute of Electrical Instruments, Harbin 150081, China 
Lin Ma Communication Research Center, Harbin Institute of Technology, Harbin 150001,China 
Hong-Bin Ma Electronic Science and Technology Post-Doctoral Research Center, Heilongjiang University, Harbin 150001, China 
Qun Ding Electronic Science and Technology Post-Doctoral Research Center, Heilongjiang University, Harbin 150001, China 
Abstract:
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.
Key words:  mobile ad hoc networks  congestion elusion  ant conloy algorithm  CERS  OLSR
DOI:10.11916/j.issn.1005-9113.2013.03.016
Clc Number:S7
Fund:

LINKS