Worst-case analysis of a dynamic channel assignment strategy

Authors:
Lata Narayanan;Yihui Tang
Affiliations:
Department of Computer Science, Concordia University, Montreal, Quebec, Canada H3G IM8;Department of Computer Science, Concordia University, Montreal, Quebec, Canada H3G IM8
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 8
Cited 5

Distributed dynamic channel allocation for mobile computing

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Worst-case performance of cellular channel assignment policies

Wireless Networks - Special issue on performance evaluation methods for wireless networks
Online channel allocation in FDMA networks with reuse constraints

Information Processing Letters
Colouring proximity graphs in the plane

Discrete Mathematics
Efficient on-line communication in cellular networks

Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Distributed online frequency assignment in cellular networks

Journal of Algorithms
Graph labeling and radio channel assignment

Journal of Graph Theory
Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey

IEEE Communications Surveys & Tutorials

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
SIGACT news online algorithms column 14

ACM SIGACT News
Frequency assignment and multicoloring powers of square and triangular meshes

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
A 1-local 13/9-competitive algorithm for multicoloring hexagonal graphs

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.04

Visualization

Abstract

We consider the problem of channel assignment in cellular networks with arbitrary reuse distance. We show upper and lower bounds for the competitive ratio of a previously proposed and widely studied version of dynamic channel assignment, which we refer to as the greedy algorithm. We study two versions of this algorithm: one that performs reassignment of channels, and one that never reassigns channels to calls. For reuse distance 2, we show tight bounds on the competitive ratio of both versions of the algorithm. For reuse distance 3, we show non-trivial lower bounds for both versions of the algorithm.