By Topic

An Improved Ant Colony QoS Routing Algorithm Applied to Mobile Ad Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Ming Liu ; Dept. of Comput. Sci., Central China Normal Univ., Wuhan ; Yange Sun ; Rui Liu ; Xiaoyan Huang

Due to the bandwidth constraint and dynamic topology of mobile ad hoc networks, supporting QoS becomes a multi-constrained QoS routing problem for mobile ad hoc networks. This paper proposes an improved ant colony QoS routing algorithm (IAQR) for ad hoc networks. The IAQR algorithm introduces a routing modeling with four QoS constrained requirements associated with nodes or links, and defines four rules besides congestion avoidance rule. The algorithm can find a route in ad hoc networks that satisfies more QoS requirements of the incoming traffic and at the same time reduces constrained resources consumption as much as possible. Moreover, it can avoid congestion after judging by average queue length quickly. Simulation results show that IAQR algorithm can obviously improve packet delivery ratio and reduce end to end delay.

Published in:

Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on

Date of Conference:

21-25 Sept. 2007