Distributed approximation of cellular coverage

Authors:
Boaz Patt-Shamir;Dror Rawitz;Gabriel Scalosub
Affiliations:
The School of Electrical Engineering, Tel Aviv University, Tel Aviv 69978, Israel;The School of Electrical Engineering, Tel Aviv University, Tel Aviv 69978, Israel;The Department of Communication Systems Engineering, Ben Gurion University of the Negev, Beer Sheva 84105, Israel
Venue:
Journal of Parallel and Distributed Computing
Year:
2012

Citing 11
Cited 0

An approximation algorithm for the generalized assignment problem

Mathematical Programming: Series A and B
A PTAS for the multiple knapsack problem

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Distributed computing: a locality-sensitive approach

Distributed computing: a locality-sensitive approach
A unified approach to approximating resource allocation and scheduling

Journal of the ACM (JACM)
Coordinated load balancing, handoff/cell-site selection, and scheduling in multi-cell packet data systems

Proceedings of the 10th annual international conference on Mobile computing and networking
On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique

SIAM Journal on Discrete Mathematics
An efficient approximation for the generalized assignment problem

Information Processing Letters
Improved distributed approximate matching

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
A log-star distributed maximal independent set algorithm for growth-bounded graphs

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Coping with interference: from maximum coverage to planning cellular networks

WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
An algorithm for combined cell-site selection and power control to maximize cellular spread spectrum capacity

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the following model of cellular networks. Each base station has a given finite capacity, and each client has some demand and profit. A client can be covered by a specific subset of the base stations, and its profit is obtained only if its demand is provided in full. The goal is to assign clients to base stations, so that the overall profit is maximized subject to base station capacity constraints. In this work, we present a distributed algorithm for the problem, that runs in polylogarithmic time, and guarantees an approximation ratio close to the best known ratio achievable by a centralized algorithm.