Online computation and competitive analysis
Online computation and competitive analysis
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Dynamic Channel Allocation for Real-Time Connections in Highway Macrocellular Networks
Wireless Personal Communications: An International Journal
On-line Competive Algorithms for Call Admission in Optical Networks
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Greedy online frequency allocation in cellular networks
Information Processing Letters
Online frequency allocation in cellular networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Frequency allocation problems for linear cellular networks
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Online call control in cellular networks revisited
Information Processing Letters
| Hi-index | 5.23 |
We study an on-line call control problem in cellular networks that are based on the Frequency Division Multiplexing (FDM) technology. In such networks, interference may occur when the same frequency is assigned to two different calls emanating from the same cell or its neighboring cells. The number of frequencies supporting the networks is limited. The goal is to maximize the number of calls served without causing any interference. We focus on the case that the number of frequencies is sufficiently large and the calls stay forever. We give a deterministic on-line algorithm with asymptotic competitive ratio of 2.5 and show a general lower bound of 2. For the special case of linear cellular networks, we achieve a best possible deterministic on-line algorithm with asymptotic competitive ratio of 3/2.