A Survey of Ant Colony Optimization Algorithms for Telecommunication Networks

A Survey of Ant Colony Optimization Algorithms for Telecommunication Networks

Ilham Benyahia (Université du Québec en Outaouais, Canada)
Copyright: © 2012 |Pages: 15
DOI: 10.4018/jamc.2012040102
OnDemand PDF Download:
No Current Special Offers


Optical and ad-hoc networks which fulfill the communications requirements of complex applications must meet the Quality of Service (QoS) demanded by these applications, such as transmission delay. These demands are hard to satisfy in the presence of unpredictable behavior in the environment such as interference, traffic congestion, etc. Algorithms based on Ant Colony Optimization (ACO) offer an effective approach to meet such challenges since they are well suited to the dynamic routing optimization and dynamic resource reassignment required by these applications. In this paper, the author presents a survey of Ant Colony Optimization variants applied to ad-hoc and optical networks. The ACO variant called AntHocNet in particular will be reviewed, analyzed, and criticized from the point of view of emergent applications for environment management such as Intelligent Transportation Systems (ITS).
Article Preview

2. Metaheuristics For Emergent Communication Technologies

Optimization problems are among the greatest challenges for emergent communication technologies, especially under conditions of multiple constraints and multicriteria optimization objectives. Metaheuristics are recognized as a powerful approach capable of optimizing the QoS of complex communication networks with challenging environments. Metaheuristic algorithms have been applied for this purpose in wireless networks, in ad-hoc and mobile networks, and in optical networks. We study specifically in this paper the AntHocNet metaheuristic dedicated to ad-hoc networks.

Complete Article List

Search this Journal:
Volume 13: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing