A novel swarm intelligence based routing scheme for MANET using weighted pheromone paths

Authors:
Seemanti Saha;Sant Sharan Pathak
Affiliations:
Department of Electronics & Electrical Communication Engineering, Indian Institute of Technology, Kharagpur, West-Bengal, India;Department of Electronics & Electrical Communication Engineering, Indian Institute of Technology, Kharagpur, West-Bengal, India
Venue:
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Year:
2006

Citing 5
Cited 0

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
ARA - The Ant-Colony Based Routing Algorithm for MANETs

ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks

IEEE Transactions on Mobile Computing
AntNet: distributed stigmergetic control for communications networks

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The highly dynamic topology, limited bandwidth availability and energy constraints for Mobile Ad-hoc Networks (MANETs) make the routing scenario in MANET a complex one. In this paper, we present a novel routing scheme in MANET based on Ant Colony Optimization (ACO) algorithm that is probabilistic in nature and inspired by the foraging behavior of the real ants. This routing scheme takes into account the trip time along with the estimated queuing delay as the optimization criterion to select the route for packet transmission from source node to destination node, whereas, in the existing algorithms total Path delay is determined from hop count and processing delay (a fixed value for all nodes) only, which is far away from reality. In the proposed algorithm, nonlinear weights for the deposited pheromone at the intermediate nodes are obtained by incorporating some aspects of queuing delay analysis while calculating the total path delay. Simulation results in terms of average end-to-end delay and packet delivery rate have been obtained to show the performance of the algorithm.