Abstract
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.
Research supported by NSERC, Canada.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
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.
S. Irani. Coloring inductive graphs online. Algorithmica, 11:53–72, 1994.
J. Janssen and K. Kilakos. Optimal multicolouring algorithms with limited recolouring. Submitted for publication, April 1995.
J. Janssen, K. Kilakos, and O. Marcotte. Fixed preference frequency allocation for cellular telephone systems. Unpublished manuscript, April 1995.
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.
A. Karlin, M. Manasse, L. Rudolph, and D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):74–119, 1988.
S. Kim and S. L. Kim. A two-phase algorithm for frequency assignment in cellular mobile systems. IEEE Transactions on Vehicular Technology, 1994.
L. Lovasz, M. Saks, and W. Trotter. An online graph coloring algorithm with sublinear performance ratio. Discrete Math, 75:319–325, 1989.
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 SIROCCO 97, 1997.
P. Raymond. Performance analysis of cellular networks. IEEE Transactions on Communications, 39(12):1787–1793, 1991.
S. Vishwanathan.Randomized online graph coloring. Journal of Algorithms, 13:657–669, 1992.
W. Wang and C. Rushforth. An adaptive local-search algorithm for the channel-assignment problem. Technical Report, August 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag
About this paper
Cite this paper
Janssen, J., Krizanc, D., Narayanan, L., Shende, S. (1998). Distributed online frequency assignment in cellular networks. In: Morvan, M., Meinel, C., Krob, D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028544
Download citation
DOI: https://doi.org/10.1007/BFb0028544
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64230-5
Online ISBN: 978-3-540-69705-3
eBook Packages: Springer Book Archive