Online frequency allocation in cellular networks

  • Authors:

  • Joseph Wun-Tat Chan;Francis Y. L. Chin;Deshi Ye;Yong Zhang

  • Affiliations:

  • King's College London, London, United Kingdom;The University of Hong Kong, Hong Kong, Hong Kong;Zhejiang University, HangZhou, China;The University of Hong Kong, Hong Kong, Hong Kong

  • Venue:
  • Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Given a mobile telephone network, whose geographical coverage area is divided into cells, phone calls are serviced by assigning frequencies to them, so that no two calls emanating from the same or neighboring cells are assigned the same frequency. Assuming an online arrival of calls and the calls will not terminate, the problem is to minimize the span of frequencies used. By first considering χ-colorable networks, which is a generalization of (the 3-colorable) cellular networks, we present a (χ+1)/2-competitive online algorithm. This algorithm, when applied to cellular networks, is effectively a positive solution to the open problem posed in [8]: Does a 2-competitive online algorithm exist for frequency allocation in cellular networks? We further prove a lower bound which shows that our 2-competitive algorithm is optimal. We discover that an interesting phenomenon occurs for the online frequency allocation problem when the number of calls considered becomes large: previously-derived optimal (lower and upper) bounds on competitive ratios no longer hold true. For cellular networks, we show new asymptotic lower and upper bounds of 1.5 and 1.9126, respectively, which breaks through the optimal bound of 2 shown previously.