Cluster based secure authentication technique using ant colony optimization in wireless sensor networks

2016 ◽  
Vol 31 (1) ◽  
pp. 423-432
Author(s):  
D. Hevin Rajesh ◽  
B. Paramasivan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Ant Colony Optimization ◽  
Ant Colony ◽  
Wireless Sensor ◽  
Secure Authentication ◽  
Authentication Technique

Ant Colony Algorithms for Steiner Trees

2011 ◽  
pp. 1551-1575 ◽  
Author(s):  
Gurdip Singh ◽  
Sanjoy Das ◽  
Shekhar V. Gosavi ◽  
Sandeep Pujar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Ant Colony Optimization ◽  
Optimization Problems ◽  
Steiner Trees ◽  
Ant Colony ◽  
Wireless Sensor ◽  
Graph Theoretic ◽  
Ant Colony Algorithms ◽  
Complex Optimization

This chapter introduces ant colony optimization as a method for computing minimum Steiner trees in graphs. Tree computation is achieved when multiple ants, starting out from different nodes in the graph, move towards one another and ultimately merge into a single entity. A distributed version of the proposed algorithm is also described, which is applied to the specific problem of data-centric routing in wireless sensor networks. This research illustrates how tree based graph theoretic computations can be accomplished by means of purely local ant interaction. The authors hope that this work will demonstrate how innovative ways to carry out ant interactions can be used to design effective ant colony algorithms for complex optimization problems.

Sign in / Sign up

Export Citation Format

Share Document