Routing Discovering Based on Ant Colony Algorithm in Ad Hoc Networks

Author

Ping, Yuan ; Ziyan, Ma ; Minglai, Yang

Author_Institution

Sch. of Urban Railway Transp., Shanghai Univ. of Eng. Sci., Shanghai, China

Volume

2

fYear

2012

fDate

23-25 March 2012

Firstpage

583

Lastpage

586

Abstract

To satisfy the situation requirements for Routing, Routing discovering has emerged as a main issue in mobile Ad Hoc networks. The high adaptability to network topology change is of utmost importance for Routing. In this paper, we propose a novel routing discovering algorithm (RACO) based on Ant colony optimization. It is to solve the limitation of ACO by using the characteristics of Ad Hoc networks and the concept related-node. In order to evaluate and validate the performance of RACO better, we simulate RACO and RCO to AODV protocols using NS2.The studies show that RACO can reduce the convergence time effectively and iteration of algorithm.

Keywords

ant colony optimisation; mobile ad hoc networks; telecommunication network routing; AODV protocols; NS2; RACO; ant colony algorithm; iteration; mobile ad hoc networks; network topology change; routing discovering algorithm; Ant colony optimization; Convergence; Educational institutions; Mobile ad hoc networks; Network topology; Routing; Ad Hoc network; Ant colony optimization; Routing discovering;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Electronics Engineering (ICCSEE), 2012 International Conference on

Conference_Location

Hangzhou

Print_ISBN

978-1-4673-0689-8

Type

conf

DOI

10.1109/ICCSEE.2012.479

Filename

6188098