Analytical Approach for Channel Assignments in Cellular Networks

  • Vladimir V. Shakhov
  • Hyunseung Choo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2657)


In the present paper channel assignments in cellular architectures are considered. This is quite important in cell and channel planning since reusing channels in cells allows to manage resources and to serve users effectively in the system. The optimal solution is offered here for the case of co-channel interference. Previous solutions on co-channel interference are based on regular hexagonal models for service areas. A novel technique is employed in this work that does not depend upon any geometric form of cells. It is obtained that the optimal number of channels equals the density of a special graph. Earlier analytical results on span minimization show lower bounds meanwhile we provide the upper bound in this paper.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    W. Lee, Mobile Cellular Telecommunications: analog and digital systems, Second Edition, New York: McGraw-Hill, 1995.Google Scholar
  2. 2.
    Y. Akaiwa, Intoduction to Digital Mobile Communications, New York: John Wiley & Sons, 1997.Google Scholar
  3. 3.
    S. Fedortsov, B. Tsybakov, “Channels distribution in cellular network,” Information Transmition Problems, vol. 32, pp. 91–99, 1996 (in Russian).Google Scholar
  4. 4.
    A. Gamst, “Homogeneouse Distribition of Frequencies in a Regular Hexaginal Cell System,” IEEE Transactions on Veh. Technology, vol. VT-31, pp. 132–144, Aug. 1982.Google Scholar
  5. 5.
    A. Gamst, “Some Lower Bounds for a Class of Frequency Assignment Problems,” IEEE Transactions on Veh. Technology, vol. VT-31, pp. 132–144, Aug. 1982.Google Scholar
  6. 6.
    V.H. MacDonald, “Advanced mobile phone service: The cellular concept,” Bell Syst. Tech. J., v.58, pp. 15–41, 1979.Google Scholar
  7. 7.
    A. Sen, T. Roxoborough, and S. Medidi, “Upper and lower Bounds of a Class of Channel Assignment Problems in Cellular Networks,” Proc. of IEEE INFOCOM’98, vol. 3, pp. 1284–1291, 1998.Google Scholar
  8. 8.
    A. Sen, T. Roxoborough, and S. Medidi, “On an Optimal Algorithm for Channel Assignment in Celluar Networks,” Proc. of IEEE ICC’99, vol. 2, pp. 1147–1151, 1999.Google Scholar
  9. 9.
    C.Y. Ngo and V.O.K. Li, “Fixed channel assignment in cellular radio networks using a modified genetic algorithm,” IEEE Transactions on Vehicular Technology, v.47, No. 1, pp. 163–172, 1998.CrossRefGoogle Scholar
  10. 10.
    J.A. Khan, S.M. Sait, and S.A. Khan, “A fast constructive algorithm for fixed channel assignment problem,” The 2001 IEEE International Symposium on Circuits and Systems, v.5, pp. 65–68, 2001.Google Scholar
  11. 11.
    C.W. Sung and W.S. Wong, “Sequential Packing Algorithm for Channel Assignment Under Cochannel and Adjacent Channel Interference Constraint,” IEEE Transactions on Vehicular Technology, v.46, No. 3, pp. 676–686, 1997.CrossRefGoogle Scholar
  12. 12.
    D.H. Smith, S. Hurley, and M. Allen, “A new lower bound for the channel assignment problem,” IEEE Trans. Veh. Technol., v.49, No. 4, pp. 1265–1272, 2000.CrossRefGoogle Scholar
  13. 13.
    W.K. Hale, “Frequency assignment: Theory and application,” Proc. IEEE, v.68, pp. 1497–1514.Google Scholar
  14. 14.
    J.C.M. Janssen and K. Kilakos, “An Optimal Solution to the “Philadelphia” Channel Assignment Problem,” IEEE Trans. Veh. Technol., v.48, No. 3, pp. 1012–1014, 1999.CrossRefGoogle Scholar
  15. 15.
    S.Z. Ali and L.F. Turner, “An efficient methodology for optimal channel assignment of large and complex mobile radio networks,” IEEE Trans. Veh. Technol., VTC 2001 Fall. IEEE VTS 54th, v.1, pp. 389–393, 2001.CrossRefGoogle Scholar
  16. 16.
    D. Kunz, “Channel assignment for cellular radio using neural network,” IEEE Trans. Veh. Technol., v.40, No. 1, pp. 188–193, 1991.CrossRefMathSciNetGoogle Scholar
  17. 17.
    N. Funabiki and Y. Takefuji, “A neural network parallel algorithm for channel assignment problems in cellular radio network,” IEEE Trans. Veh. Technol., v.41, pp. 430–437, 1992.CrossRefGoogle Scholar
  18. 18.
    N.A. El-Fishawy, M.M. Hadhood, S. Elnoubi, and W. El-Sersy, “A modified Hop-field neural network algorithm for cellular radio channel assignment,” IEEE VTS Fall VTC 2000. 52nd, v.3, pp. 1128–1133, 2000.CrossRefGoogle Scholar
  19. 19.
    M. Duque-Anton, D. Kunz, and B. Ruber, “Channel assignment for cellular radio using simulation annealing,” IEEE Trans. Veh. Technol., v.42, pp. 14–21, 1993.CrossRefGoogle Scholar
  20. 20.
    R. Mathar and J. Mattfeldt, “Channel assignment in cellular radio networks,” IEEE Trans. Veh. Technol., v.42, pp. 647–656, 1993.CrossRefGoogle Scholar
  21. 21.
    W.K. Lai and G.G. Coghill, “Channel assignment through evolutionary optimization,” IEEE Trans. Veh. Technol., v.45, No. 1, pp. 91–96, 1996.CrossRefGoogle Scholar
  22. 22.
    K.A. Smith, “A genetic algorithm for the channel assignment problem,” IEEE Global Telecommunications Conference, v.4, pp. 2013–2018, 1998.Google Scholar
  23. 23.
    G. Chakraborty and B. Chakraborty “A genetic algorithm approach to solve channel assignment problem in cellular radio networks,” Proc. of SMCia/99, pp. 34–39, 1999.Google Scholar
  24. 24.
    R. Diestel, Graph Theory, Second Edition. Springer-Verlag, New York, pp. 111–112, 2000.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Vladimir V. Shakhov
    • 1
  • Hyunseung Choo
    • 2
  1. 1.Institute of Computational Mathematics and Mathematical GeophysicsSiberian Branch of the Russian Academy of SciencesNovosibirskRussia
  2. 2.School of Information and Communication EngineeringSungkyunkwan UniversitySuwonKorea

Personalised recommendations