๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On-line algorithms for the channel assignment problem in cellular networks

โœ Scribed by Pilu Crescenzi; Giorgio Gambosi; Paolo Penna

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
364 KB
Volume
137
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

โœฆ Synopsis

We consider the on-line channel assignment problem in the case of cellular networks and we formalize this problem as an on-line load balancing problem for temporary tasks with restricted assignment. For the latter problem, we provide a general solution (denoted as the cluster algorithm) and we characterize its competitive ratio in terms of the combinatorial properties of the graph representing the network. We then compare the cluster algorithm with the greedy one when applied to the channel assignment problem: it turns out that the competitive ratio of the cluster algorithm is strictly better than the competitive ratio of the greedy algorithm. The cluster method is general enough to be applied to other on-line load balancing problems and, for some topologies, it can be proved to be optimal.

๐Ÿ“œ SIMILAR VOLUMES

An expanded maximum neural network algor
An expanded maximum neural network algorithm for a channel assignment problem in cellular radio networks
โœ Katsuyoshi Ikenaga; Yoichi Takenaka; Nobuo Funabiki ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 247 KB ๐Ÿ‘ 2 views

In this paper, we propose a neural network algorithm that uses the expanded maximum neuron model to solve the channel assignment problem of cellular radio networks, which is an NP-complete combinatorial optimization problem. The channel assignment problem demands minimizing the total interference be

A Greedy On-Line Algorithm for thek-Trac
A Greedy On-Line Algorithm for thek-Track Assignment Problem
โœ U Faigle; W Kern; W.M Nawijn ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 107 KB

Given a collection I I of n jobs that are represented by intervals, we seek a maximal feasible assignment of the jobs to k machines such that not more than ลฝ . c M intervals overlap pairwise on any machine M and that a job is only assigned to a machine if it fits into one of several prescribed time

A compact dynamic channel assignment sch
A compact dynamic channel assignment scheme based on Hopfield networks for cellular radio systems
โœ A. Dang; S. Zhu ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 193 KB

## Abstract In this paper, a new channel assignment strategy named compact dynamic channel assignment (CDCA) is proposed. The CDCA differs from other strategies by consistently keeping the system in the utmost optimal state, and thus the scheme allows to determine a call succeeding or failing by lo