Distributed online frequency assignment in cellular networks
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.
- 3.J. Janssen and K. Kilakos. Optimal multicolouring algorithms with limited recolouring. Submitted for publication, April 1995.Google Scholar
- 4.J. Janssen, K. Kilakos, and O. Marcotte. Fixed preference frequency allocation for cellular telephone systems. Unpublished manuscript, April 1995.Google Scholar
- 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
- 9.C. McDiarmid and B. Reed. Channel assignment and weighted colouring. Submitted for publication, 1997.Google Scholar
- 10.L. Narayanan and S. Shende. Static frequency assignment in cellular networks. In SIROCCO 97, 1997.Google Scholar
- 13.W. Wang and C. Rushforth. An adaptive local-search algorithm for the channel-assignment problem. Technical Report, August 1995.Google Scholar