A Novel Ant Colony Routing Algorithm with Global Correction for Mobile Ad hoc Networks

Author

Qin Dan-yang ; Sha Xue-jun ; Wu Wei

Author_Institution

HIT-NEC Joint Lab. on Adv. Commun. Technol., Harbin Inst. of Technol., Harbin

fYear

2008

fDate

12-14 Oct. 2008

Firstpage

1

Lastpage

7

Abstract

The stability and reliability of routing protocols in existence can not be adapted to mobile ad hoc networks (MANET) well enough. In this paper, a novel ant colony routing algorithm is proposed and evaluated to reduce the overhead and enhance the network stability for MANET. The thought of design came into being based on the way of ants foraging and work dividing. By making a global correction on pheromone intensity, we gain a more efficient routing selection mechanism. The results show that, as compared with AODV (Ad Hoc On-demand Vector) routing protocol, the ant colony routing algorithm with a global correction (ACRA-GC) can not only reduce the end-to-end delay, but also enhance the stability and raise the efficiency of communication by exerting the function of each node in MANET.

Keywords

ad hoc networks; mobile communication; routing protocols; ad hoc on-demand vector; ant colony routing; end-to-end delay; global correction; mobile ad hoc network; network stability; pheromone intensity; routing protocol; routing selection; Algorithm design and analysis; Ant colony optimization; Communications technology; Educational institutions; Mobile ad hoc networks; Mobile communication; Routing protocols; Spread spectrum communication; Stability; Telecommunication network reliability;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on

Conference_Location

Dalian

Print_ISBN

978-1-4244-2107-7

Electronic_ISBN

978-1-4244-2108-4

Type

conf

DOI

10.1109/WiCom.2008.621

Filename

4678529