Advertisement

Approximation Algorithms for Channel Assignment with Constraints

  • Jeannette Janssen
  • Lata Narayanan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1741)

Abstract

Cellular networks are generally modeled as node-weighted graphs, where the nodes represent cells and the edges represent the possibility of radio interference. An algorithm for the channel assignment problem must assign as many channels as the weight indicates to every node, such that any two channels assigned to the same node satisfy the co-site constraint, and any two channels assigned to adjacent nodes satisfy the inter-site constraint.

We describe several approximation algorithms for channel assignment with arbitrary co-site and inter-site constraints and reuse distance 2 for odd cycles and so-called hexagon graphs that are often used to model cellular networks. The algorithms given for odd cycles are optimal for some values of constraints, and have performance ratio at most 1+1/(n−1) for all other cases, where n is the length of the cycle. Our main result is an algorithm of performance ratio at most 4/3 + ε for hexagon graphs with arbitrary co-site and inter-site constraints.

Keywords

Approximation Algorithm Bipartite Graph Cellular Network Channel Assignment Performance Ratio 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BM76.
    J.A. Bondy and U.S.R. Murty. Graph Theory with Applications. Macmillan Press Ltd, 1976.Google Scholar
  2. FS98.
    Tomás Feder and Sunil M. Shende. Online channel allocation in fdma networks with reuse constraints. Inform. Process. Lett., 67(6):295–302, 1998.CrossRefMathSciNetGoogle Scholar
  3. Gam86.
    A. Gamst. Some lower bounds for a class of frequency assignment problems. IEEE Trans. Veh. Technol., 35(1):8–14, 1986.CrossRefGoogle Scholar
  4. Ger99.
    S. N. T. Gerke. Colouring weighted bipartite graphs with a co-site constraint. unpublished, 1999.Google Scholar
  5. JK95.
    J. Janssen and K. Kilakos. Adaptive multicolouring. To appear in Combinatorica, 1999.Google Scholar
  6. JN99.
    J. Janssen and L. Narayanan. Approximation algorithms for channel assignment with constraints. Available from http://www.cs.concordia.ca/_faculty/lata. Submitted for publication.Google Scholar
  7. MR97.
    C. McDiarmid and B. Reed. Channel assignment and weighted colouring. Submitted for publication, 1997.Google Scholar
  8. NS97.
    L. Narayanan and S. Shende. Static frequency assignment in cellular networks. In Proceedings of SIROCCO 97, pages 215–227. Carleton Scientific Press, 1997. To appear in Algorithmica.Google Scholar
  9. SUZ97.
    N. Schabanel, S. Ubeda, and Zerovnik. A note on upper bounds for the span of frequency planning in cellular networks. Submitted for publication, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Jeannette Janssen
    • 1
  • Lata Narayanan
    • 2
  1. 1.Department of Mathematics and StatisticsDalhousie UniversityHalifaxCanada
  2. 2.Department of Computer ScienceConcordia UniversityMontrealCanada

Personalised recommendations