An Effective Ant-Colony Based Routing Algorithm for Mobile Ad-Hoc Network

Author

Liu, Yingzhuang ; Zhang, Hong ; Ni, Qiang ; Zhou, Zongyi ; Zhu, Guangxi

Author_Institution

Dept. of Electron. & Inf. Eng., Huazhong Univ. of Sci. & Technol., Wuhan

fYear

2008

Firstpage

100

Lastpage

103

Abstract

An effective Ant-Colony based routing algorithm for mobile ad-hoc network is proposed in this paper. In this routing scheme, each path is marked by path grade, which is calculated from the combination of multiple constrained QoS parameters such as the time delay, packet loss rate and bandwidth, etc. packet routing is decided by the path grade and the queue buffer length of the node. The advantage of this scheme is that it can effectively improve the packet delivery ratio and reduce the end-to-end delay. The simulation results show that our proposed algorithm can improve the packet delivery ratio by 9%-22% and the end-to-end delay can be reduced by 14%-16% as compared with the conventional QAODV and ARA routing schemes.

Keywords

ad hoc networks; mobile communication; optimisation; quality of service; telecommunication network routing; QoS; ant colony; mobile ad-hoc network; packet routing; path grade; queue buffer length; routing algorithm; Acceleration; Ad hoc networks; Bandwidth; Computational modeling; Computer networks; Delay effects; Mobile ad hoc networks; Mobile computing; Quality of service; Routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems for Communications, 2008. ICCSC 2008. 4th IEEE International Conference on

Conference_Location

Shanghai

Print_ISBN

978-1-4244-1707-0

Electronic_ISBN

978-1-4244-1708-7

Type

conf

DOI

10.1109/ICCSC.2008.28

Filename

4536720