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

被引：9

作者：

Liu, Ming ^{[1
]}

Sun, Yange ^{[1
]}

Liu, Rui ^{[1
]}

Huang, Xiaoyan ^{[1
]}

机构：

[1] Cent China Normal Univ, Dept Comp Sci, Wuhan, Peoples R China

来源：

2007 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-15 | 2007年

关键词：

ad hoc networks; QoS routing; Ant colony algorithm; congestion avoidance;

D O I：

10.1109/WICOM.2007.413

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：1641 / 1644

页数：4