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

Title:
On-line algorithms for the channel assignment problem in cellular networks
Authors:
CRESCENZI, Pilu, GAMBOSI, Giorgio, PENNA, Paolo
Source:
Discrete applied mathematics. 137(3):237-266
Publisher Information:
Amsterdam; Lausanne; New York, NY: Elsevier, 2004.
Publication Year:
2004
Physical Description:
print, 27 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Théorie des graphes, Graph theory, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Automates. Machines abstraites. Machines de turing, Automata. Abstract machines. Turing machines, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithme compétitif, Competitive algorithms, Algorithme glouton, Greedy algorithm, Algoritmo glotón, Equilibrage charge, Load balancing, Equilibrio de carga, Informatique théorique, Computer theory, Informática teórica, Théorie graphe, Graph theory, Teoría grafo, Traitement en ligne, On line processing, Tratamiento en línea, Algorithme amas, Cluster algorithm, Assignation canal, Channel assignment, Réseau cellulaire, Cellular network, cellu
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
Dipartimento di Sistemi e Informatica, Università di Firenze, via C. Lombroso 6117, 50134 Firenze, Italy
Dipartimento di Matematica, Università di Roma Tor Vergata, via della Ricerca Scientifica, 00133 Roma, Italy
ISSN:
0166-218X
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=15516114
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems

Mathematics
Accession Number:
edscal.15516114
Database:
PASCAL Archive

Further Information

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.