Performance evaluation of an ant colony based routing algorithm in the presence of a misbehaving node

Authors:
Usha Banerjee;K. V. Arya;Geetika Gupta;Sakshi Sharma
Affiliations:
College of Engineering Roorkee, Roorkee, India;ABV- IITM, Gwalior, India;College of Engineering Roorkee, Roorkee, India;College of Engineering Roorkee, Roorkee, India
Venue:
Proceedings of the First International Conference on Security of Internet of Things
Year:
2012

Citing 7
Cited 0

Ant algorithms for discrete optimization

Artificial Life
Analysis on Extended Ant Routing Algorithms for Network Routing and Management

The Journal of Supercomputing
ARA - The Ant-Colony Based Routing Algorithm for MANETs

ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
Network Load Balancing Algorithm using Ants Computing

IAT '03 Proceedings of the IEEE/WIC International Conference on Intelligent Agent Technology
Ant Algorithms for Search in Unstructured Peer-to-Peer Networks

ICDEW '06 Proceedings of the 22nd International Conference on Data Engineering Workshops
On ant routing algorithms in ad hoc networks with critical connectivity

Ad Hoc Networks
An ant algorithm based dynamic routing strategy for mobile agents

APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Today's world is dynamic and complex. All organisms in it are adaptive, self-repaired and self-organized to the changing world. And they do so with the help of their own local knowledge and without support of central body. Similar changes are also occurring in computer networks but these networks are not showing the same result as that living organisms are showing to the changing world i.e. they are not able to adjust themselves with the changing environment (non-adaptive). In this paper we implement the Ant Colony Optimization (ACO) for routing. The algorithm is a biological inspired routing algorithm based on real ant behavior. The algorithm uses techniques of route or path discovery that were observed by ants. In this paper we have first implemented ACO, we have then discovered the shortest path between source and destination and then we work to see that the effect on the efficiency of algorithm if a malicious node is present.