Analysis of Different Pheromone Decay Techniques for ACO based Routing in Ad Hoc Wireless Networks
Ant Colony Optimization (ACO) technique deals with exploratory behavior of ants while finding food by following a path based on the concentration of the pheromone. A major limitation with ACO algorithm is "stagnation". This occurs when all ants try to follow same path to reach the destinat...
Gespeichert in:
Veröffentlicht in: | International journal of computer applications 2012-01, Vol.56 (2), p.31-38 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Ant Colony Optimization (ACO) technique deals with exploratory behavior of ants while finding food by following a path based on the concentration of the pheromone. A major limitation with ACO algorithm is "stagnation". This occurs when all ants try to follow same path to reach the destination due to higher pheromone concentration and causes congestion when applied to Adhoc Wireless Network (AWN). In the present paper, a detailed analysis of ACO based different pheromone decay techniques such as Discrete, Exponential and Polynomial has been carried out. Pheromone intensity and probability of choosing path for packet transmission are used as parameters for the analysis. It is found that the Discrete decay is not preferable for Congestive network as it leaves large amount of pheromone traces. The polynomial decay technique choose better path and avoid longest path which lead to delay at the time of packet delivery. The Exponential decay has been found to exhibit better performance compared to Discrete and Polynomial decay techniques, However it loses the pheromone traces very fast. The Efficient fine tuning of the exponential decay model can be achieved by using stability factor '?'. The present analysis shows that for values of '?'< 0. 08 the probability of selection of the longest optimal paths is < 1%, where as for '?' > 0. 09 the probability of selection of the longest optimal path increases to 18%. . The introduction of the stability factor '?' improves AWN performance in terms of packet delivery. The results are presented and discussed in the present paper. |
---|---|
ISSN: | 0975-8887 0975-8887 |
DOI: | 10.5120/8866-2833 |