An Ant Algorithm for Minimum Span Frequency Assignment Problem in Cellular Networks

Sarath. B. Siyambalapitiya*
*Faculty of Engineering,Department of Engineering Mathematics,University of Peradeniya, Peradeniya, Sri Lanka
Periodicity:February - April'2006
DOI : https://doi.org/10.26634/jfet.1.3.971

Abstract

We propose a new algorithm to solve the minimum span frequency assignment problem in cellular networks. The algorithm is based on the ant colony optimization approach in which several ants generate complete solutions simultaneously. In this algorithm, a complete tour is constructed by ants by visiting each cell in the system exactly once.

Keywords

How to Cite this Article?

Sarath. B. Siyambalapitiya (2006). An Ant Algorithm for Minimum Span Frequency Assignment Problem in Cellular Networks. i-manager’s Journal on Future Engineering and Technology, 1(3), 30-35. https://doi.org/10.26634/jfet.1.3.971

References

[1].Anderson, L.G., (1973) A simulation study of some dynamic channel assignment algorithms in a high capacity mobile telecommunication system, IEEE Transactions on Communications, 21, pp.l 294-1301.
[2].Box,F.,(1978) A heuristic technique for assigning frequencies to mobile radio nets, IEEE Transactions on Vehicular Technology, 27, pp.57-74.
[3].Chi-Wang Sung and Wing-Shing Wong, (1995), A graph theoretic approach to the channel assignment problem in cellular systems, IEEE Vehicular Technology Confefernce.
[4].Dorigo.M., Maniezzo.V., and Colorni, A.,(l 996) The Ant System Optimization by a Colony of Cooperating Agents, IEEE Transac. Syst. Man. Cybern.-part b: Cybern., 26, pp. 29-41.
[5].Gamst, A.,(1986) Some lower bounds for a class of frequency assignment problems , IEEE transactions on Vehicular Technology, 35, pp.8-14.
[6].Lai,W.K., andCoghill G.G.,(1996), Channel assignment through evolutionary optimization, IEEE Transactions on Vehicular Technology, 45,.pp. 91 -95.
[7].Lanfear,T.A.,(l 989) Graph theory and radio frequency assignment. Technical Report, Allied radio frequency agency, NATO headquarters, B-l 110 Brussels, Belgium.
[8].Sivarajan,K.N., McEliece,R.J., and Ketchum,J.W., (1989) Channel assignment in cellular radio. Proceedings of the 39th IEEE Vehicular Technology Conference, pp. 846-850.
[9].Thavarajah,A. and Lam, W.H.,(1999) Heuristic approach for optimal channel assignment in cellular mobile systems, IEE Proc-Commun., 143.
[10].Valenzuela,C, , Hurley,S. ,and Smith, D.H., (1998) A permutation based genetic algorithm s for minimum span frequency assignment. Lecture Notes in Computer Science, 1498, pp. 907-916.
[11].Wang,W„ and Rushforth ,C.K.,(1996), An adaptive local search algorithm for the channel assignment problem (CAP), IEEE Transactions on Vehicular Technology, 45, pp.459-466.
[12].Zoellner, J.A. and.BealLC.A., (1977) A breakthrough in spectrum conserving frequency assignment technology, IEEE Transactions on Electromagnetic Compatibility, 19, pp. 313-319.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.