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

Authors:
Pilu Crescenzi;Giorgio Gambosi;Paolo Penna
Affiliations:
Dipartimento di Sistemi e Informatica, Università di Firenze, via C. Lombroso 6/17, I-50134 Firenze, Italy;Dipartimento di Matematica, Università di Roma "Tot Vergata", via della Ricerca Scientifica, I-00133 Roma, Italy;Dipartimento di Matematica, Università di Roma "Tot Vergata", via della Ricerca Scientifica, I-00133 Roma, Italy
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 20
Cited 12

Approximation algorithms for scheduling unrelated parallel machines

Mathematical Programming: Series A and B
The competitiveness of on-line assignments

Journal of Algorithms
On-line load balancing

Theoretical Computer Science - Special issue on dynamic and on-line algorithms
Wireless information networks

Wireless information networks
On-line load balancing of temporary tasks

Journal of Algorithms
Better bounds for online scheduling

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A dynamic load balancing strategy for channel assignment using selective borrowing in cellular mobile environment

Wireless Networks - Special issue: mobile computing and networking: selected papers from MobiCom '96
Distributed job scheduling in rings

Journal of Parallel and Distributed Computing
Dynamic channel allocation for linear macrocellular topology

Proceedings of the 1999 ACM symposium on Applied computing
Online resource minimization

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Footprint handover rerouting protocol for low earth orbit satellite networks

Wireless Networks
Efficient on-line communication in cellular networks

Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Worst-case analysis of a dynamic channel assignment strategy (extended abstract)

DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Distributed online frequency assignment in cellular networks

Journal of Algorithms
Fault-tolerant broadcasting in radio networks

Journal of Algorithms
A graph theoretic approach for channel assignment in cellular networks

Wireless Networks
Topological design, routing, and handover in satellite networks

Handbook of wireless networks and mobile computing
On-Line Load Balancing in a Hierarchical Server Topology

SIAM Journal on Computing
On-line Load Balancing

Developments from a June 1996 seminar on Online algorithms: the state of the art
On-Line Load Balancing of Temporary Tasks on Identical Machines

ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)

On-line load balancing made simple: Greedy strikes back

Journal of Discrete Algorithms
Preemptive scheduling on a small number of hierarchical machines

Information and Computation
Optimization of satellite link design

Proceedings of the 2008 Spring simulation multiconference
A Mathematical Programming Approach for Online Hierarchical Scheduling

COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Online parallel machines scheduling with two hierarchies

Theoretical Computer Science
A multifrequency MAC specially designed for wireless sensor network applications

ACM Transactions on Embedded Computing Systems (TECS)
Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Online hierarchical scheduling: An approach using mathematical programming

Theoretical Computer Science
Online and semi-online hierarchical scheduling for load balancing on uniform machines

Theoretical Computer Science
Optimal online algorithms on two hierarchical machines with resource augmentation

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Online and semi-online scheduling of two machines under a grade of service provision

Operations Research Letters
Online scheduling on uniform machines with two hierarchies

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.05

Visualization

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.