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.
Research supported in part by NSERC, Canada.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J.A. Bondy and U.S.R. Murty. Graph Theory with Applications. Macmillan Press Ltd, 1976.
Tomás Feder and Sunil M. Shende. Online channel allocation in fdma networks with reuse constraints. Inform. Process. Lett., 67(6):295–302, 1998.
A. Gamst. Some lower bounds for a class of frequency assignment problems. IEEE Trans. Veh. Technol., 35(1):8–14, 1986.
S. N. T. Gerke. Colouring weighted bipartite graphs with a co-site constraint. unpublished, 1999.
J. Janssen and K. Kilakos. Adaptive multicolouring. To appear in Combinatorica, 1999.
J. Janssen and L. Narayanan. Approximation algorithms for channel assignment with constraints. Available from http://www.cs.concordia.ca/_faculty/lata. Submitted for publication.
C. McDiarmid and B. Reed. Channel assignment and weighted colouring. Submitted for publication, 1997.
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.
N. Schabanel, S. Ubeda, and Zerovnik. A note on upper bounds for the span of frequency planning in cellular networks. Submitted for publication, 1997.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Janssen, J., Narayanan, L. (1999). Approximation Algorithms for Channel Assignment with Constraints. In: Algorithms and Computation. ISAAC 1999. Lecture Notes in Computer Science, vol 1741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46632-0_33
Download citation
DOI: https://doi.org/10.1007/3-540-46632-0_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66916-6
Online ISBN: 978-3-540-46632-1
eBook Packages: Springer Book Archive