Efficient on-line communication in cellular networks

Authors:
Ioannis Caragiannis;Christos Kaklamanis;Evi Papaioannou
Affiliations:
Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, 26500 Rio, Greece;Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, 26500 Rio, Greece;Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, 26500 Rio, Greece
Venue:
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Year:
2000

Citing 7
Cited 4

Amortized efficiency of list update and paging rules

Communications of the ACM
Randomized algorithms

Randomized algorithms
Lower bounds for on-line graph problems with application to on-line circuit and optical routing

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On-line randomized call control revisited

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Competitive Call Control in Mobile Networks

ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Distributed Online Frequency Assignment in Cellular Networks

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
On-line Competive Algorithms for Call Admission in Optical Networks

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms

Channel assignment and graph multicoloring

Handbook of wireless networks and mobile computing
Competitive Analysis of On-line Randomized Call Control in Cellular Networks

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
On-line algorithms for the channel assignment problem in cellular networks

Discrete Applied Mathematics
Worst-case analysis of a dynamic channel assignment strategy

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider communication issues arising in mobile networks that utilize Frequency Division Multiplexing (FDM) technology. In such networks, many users within the same geographical region can communicate simultaneously with other users of the network using distinct frequencies. The spectrum of available frequencies is limited; thus, efficient solutions to the frequency allocation and the call control problem are essential. In the frequency allocation problem, given users that wish to communicate, the objective is to minimize the required spectrum of frequencies so that communication can be established without signal interference. The objective of the call control problem is, given a spectrum of available frequencies and users that wish to communicate, to maximize the number of users served. We consider cellular, planar, and arbitrary network topologies.In particular, we study the on-line version of both problems using competitive analysis. For frequency allocation in cellular networks, we improve the best known competitive ratio upper bound of 3 achieved by the folklore Fixed Allocation algorithm, by presenting an almost tight competitive analysis for the greedy algorithm; we prove that its competitive ratio is between 2.429 and 2.5. For the call control problem, we present the first randomized algorithm that beats the deterministic lower bound of 3 achieving a competitive ratio of 2.934 in cellular networks. Our analysis has interesting extensions to arbitrary networks. Also, using Yao's Minimax Principle, we prove two lower bounds of 1.857 and 2.086 on the competitive ratio of randomized call control algorithms for cellular and arbitrary planar networks, respectively.