๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

HOPNET: A hybrid ant colony optimization routing algorithm for mobile ad hoc network

โœ Scribed by Jianping Wang; Eseosa Osagie; Parimala Thulasiraman; Ruppa K. Thulasiram


Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
704 KB
Volume
7
Category
Article
ISSN
1570-8705

No coin nor oath required. For personal study only.

โœฆ Synopsis


Mobile ad hoc network (MANET) is a group of mobile nodes which communicates with each other without any supporting infrastructure. Routing in MANET is extremely challenging because of MANETs dynamic features, its limited bandwidth and power energy. Nature-inspired algorithms (swarm intelligence) such as ant colony optimization (ACO) algorithms have shown to be a good technique for developing routing algorithms for MAN-ETs. Swarm intelligence is a computational intelligence technique that involves collective behavior of autonomous agents that locally interact with each other in a distributed environment to solve a given problem in the hope of finding a global solution to the problem. In this paper, we propose a hybrid routing algorithm for MANETs based on ACO and zone routing framework of bordercasting. The algorithm, HOPNET, based on ants hopping from one zone to the next, consists of the local proactive route discovery within a node's neighborhood and reactive communication between the neighborhoods. The algorithm has features extracted from ZRP and DSR protocols and is simulated on GlomoSim and is compared to AODV routing protocol. The algorithm is also compared to the well known hybrid routing algorithm, AntHocNet, which is not based on zone routing framework. Results indicate that HOPNET is highly scalable for large networks compared to AntHocNet. The results also indicate that the selection of the zone radius has considerable impact on the delivery packet ratio and HOPNET performs significantly better than AntHocNet for high and low mobility. The algorithm has been compared to random way point model and random drunken model and the results show the efficiency and inefficiency of bordercasting. Finally, HOPNET is compared to ZRP and the strength of nature-inspired algorithm is shown.


๐Ÿ“œ SIMILAR VOLUMES


A new hybrid ant colony optimization alg
โœ Xiaoxia Zhang; Lixin Tang ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 251 KB

This paper presents a novel hybrid ant colony optimization approach called SS\_ACO algorithm to solve the vehicle routing problem. The main feature of the hybrid algorithm is to hybridize the solution construction mechanism of the ant colony optimization (ACO) with scatter search (SS). In our hybrid

An ant colony optimization routing based
โœ Daisuke Kadono; Tomoko Izumi; Fukuhito Ooshita; Hirotsugu Kakugawa; Toshimitsu M ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 889 KB

a b s t r a c t Ant colony optimization (ACO) routing algorithm is one of adaptive and efficient routing algorithms for mobile ad hoc networks (MANETs). In ACO routing algorithms, ant-like agents traverse the network to search a path from a source to a destination, and lay down pheromone on the path

Optimized priority based energy efficien
โœ Xiaohai Wei; Guoliang Chen; Yingyu Wan; Fred Mtenzi ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 362 KB

Recently more and more research interest focuses on the energy efficient routing in mobile ad hoc networks and many related routing algorithms are reported. In this paper, a new optimized priority based energy efficient routing algorithm is presented and priority is added to the existing routing alg