DocumentCode :
2458312
Title :
Ant-Based Multi-constrained Anycast Algorithm for Ad Hoc Networks
Author :
Yu, Jianping ; Lin, Yaping ; Zhang, Lianming ; Zhou, Xinmin
Author_Institution :
Coll. of Math. & Comput. Sci., Hunan Normal Univ., Changsha, China
Volume :
3
fYear :
2010
fDate :
12-14 April 2010
Firstpage :
249
Lastpage :
253
Abstract :
The multi-constrained anycast routing is an important issue in the ad hoc networks because of the mobility of nodes. To improve the anycast success rate and shorten the anycast delay when considering the special constraints of the bandwidth and delay during the network deployment period, an anycast algorithm inspired by swarm intelligence of ants is proposed, in which the improved pheromone diffusion mechanism is adopted to promote the performance of anycasting emerging in self-organized way from the positive interaction of ants. The simulation results demonstrated that not only the performance of anycast success rate can be improved but also significant smaller delay can be achieved by the proposed algorithm when compared with other anycast routing algorithms.
Keywords :
ad hoc networks; telecommunication network routing; ad hoc networks; ant-based multi-constrained anycast algorithm; anycast routing algorithms; multi-constrained anycast routing; network deployment period; swarm intelligence; Ad hoc networks; Bandwidth; Delay; Educational institutions; Intelligent agent; Mobile ad hoc networks; Mobile communication; Particle swarm optimization; Routing; Unicast; Ad hoc networks; anycast; mobility; pheromone diffusion;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications and Mobile Computing (CMC), 2010 International Conference on
Conference_Location :
Shenzhen
Print_ISBN :
978-1-4244-6327-5
Electronic_ISBN :
978-1-4244-6328-2
Type :
conf
DOI :
10.1109/CMC.2010.96
Filename :
5471569
Link To Document :
بازگشت