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. (C) 2003 Elsevier B.V. All rights reserved.

Crescenzi, P., Gambosi, G., & Penna, P. (2004). On-line algorithms for the channel assignment problem in cellular networks. DISCRETE APPLIED MATHEMATICS, 137(3), 237-266 [10.1016/S0166-218X(03)00341-X].

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

GAMBOSI, GIORGIO;
2004

Abstract

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. (C) 2003 Elsevier B.V. All rights reserved.
Pubblicato
Rilevanza internazionale
Articolo
Sì, ma tipo non specificato
Settore INF/01 - Informatica
English
Algorithms; Communication channels (information theory); Graph theory; Problem solving; Cellular networks; Channel assignment; Mobile telecommunication systems
http://hdl.handle.net/2108/53656
Crescenzi, P., Gambosi, G., & Penna, P. (2004). On-line algorithms for the channel assignment problem in cellular networks. DISCRETE APPLIED MATHEMATICS, 137(3), 237-266 [10.1016/S0166-218X(03)00341-X].
Crescenzi, P; Gambosi, G; Penna, P
Articolo su rivista
File in questo prodotto:
File Dimensione Formato  
crescenzigambosipenna.pdf

accesso aperto

Descrizione: Main article
Dimensione 363.92 kB
Formato Adobe PDF
363.92 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/2108/24995
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 28
  • ???jsp.display-item.citation.isi??? 26
social impact