Distributed online frequency assignment in cellular networks

(Extended Abstract)
  • Jeannette Janssen
  • Danny Krizanc
  • Lata Narayanan
  • Sunil Shende
Algorithm and Data Structures I
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1373)


In this paper, we develop a general framework for studying distributed online frequency assignment in cellular networks. The problem can be abstracted as a multicoloring problem on a node-weighted graph whose weights change over time. The graph, with nodes corresponding to network cells, is usually modeled as a subgraph of the triangular lattice and the instantaneous weight at a node models the number of calls requiring service at the corresponding network cell. In this setting, we present several distributed online algorithms for this problem and prove bounds on their competitive ratios. Specifically, we demonstrate a series of such algorithms that utilize information about increasingly larger neighborhoods around nodes, and thereby achieve progressively better competitive ratios. We also exhibit lower bounds on the competitive ratios of some natural classes of distributed online algorithms for the problem; in some cases, our bounds are shown to be optimal.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. Dimitrijević and J. Vuětić. Design and performance analysis of algorithms for channel allocation in cellular networks. IEEE Transactions on Vehicular Technology, 42(4):526–534, 1993.CrossRefGoogle Scholar
  2. 2.
    S. Irani. Coloring inductive graphs online. Algorithmica, 11:53–72, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    J. Janssen and K. Kilakos. Optimal multicolouring algorithms with limited recolouring. Submitted for publication, April 1995.Google Scholar
  4. 4.
    J. Janssen, K. Kilakos, and O. Marcotte. Fixed preference frequency allocation for cellular telephone systems. Unpublished manuscript, April 1995.Google Scholar
  5. 5.
    T. Kahwa and N. Georganas. A hybrid channel assignment scheme in large-scale cellular-structured mobile communication systems. IEEE Transactions on Communications, 4:432–438, 1978.CrossRefGoogle Scholar
  6. 6.
    A. Karlin, M. Manasse, L. Rudolph, and D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):74–119, 1988.CrossRefMathSciNetGoogle Scholar
  7. 7.
    S. Kim and S. L. Kim. A two-phase algorithm for frequency assignment in cellular mobile systems. IEEE Transactions on Vehicular Technology, 1994.Google Scholar
  8. 8.
    L. Lovasz, M. Saks, and W. Trotter. An online graph coloring algorithm with sublinear performance ratio. Discrete Math, 75:319–325, 1989.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    C. McDiarmid and B. Reed. Channel assignment and weighted colouring. Submitted for publication, 1997.Google Scholar
  10. 10.
    L. Narayanan and S. Shende. Static frequency assignment in cellular networks. In SIROCCO 97, 1997.Google Scholar
  11. 11.
    P. Raymond. Performance analysis of cellular networks. IEEE Transactions on Communications, 39(12):1787–1793, 1991.CrossRefGoogle Scholar
  12. 12.
    S. Vishwanathan.Randomized online graph coloring. Journal of Algorithms, 13:657–669, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    W. Wang and C. Rushforth. An adaptive local-search algorithm for the channel-assignment problem. Technical Report, August 1995.Google Scholar

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Jeannette Janssen
    • 1
  • Danny Krizanc
    • 2
  • Lata Narayanan
    • 3
  • Sunil Shende
    • 4
  1. 1.Department of MathematicsAcadia UniversityWolfvilleCanada
  2. 2.School of Computer ScienceCarleton UniversityOttawaCanada
  3. 3.Department of Computer ScienceConcordia UniversityMontrealCanada
  4. 4.Department of Computer Science and Eng.University of Nebraska-LincolnLincolnUSA

Personalised recommendations