Paper Info
Title
Performance evaluation of an ant colony based routing algorithm in the presence of a misbehaving node
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.
Year
DOI
Venue
2012
10.1145/2490428.2490461
SECURIT
Keywords
Field
DocType
ant colony optimization,own local knowledge,shortest path,real ant behavior,path discovery,malicious node,computer network,misbehaving node,biological inspired routing algorithm,living organism,ant colony,central body,performance evaluation
Ant colony optimization algorithms,Shortest path problem,Computer science,Computer network,Ant colony,Routing algorithm,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
9
Authors
4
Name
Order
Citations
PageRank
Usha Banerjee101.35
K. V. Arya228928.09
Geetika Gupta300.34
Sakshi Sharma490.96