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.
Original language | English |
---|---|
Pages (from-to) | 402-408 |
Number of pages | 7 |
Journal | Journal of Parallel and Distributed Computing |
Volume | 72 |
Issue number | 3 |
DOIs | |
State | Published - Mar 2012 |
Externally published | Yes |
Bibliographical note
Funding Information:The work of Boaz Patt-Shamir is supported in part by Israel Science Foundation (grant 1372/09 ) and by the Israel Ministry of Science and Technology .
Funding
The work of Boaz Patt-Shamir is supported in part by Israel Science Foundation (grant 1372/09 ) and by the Israel Ministry of Science and Technology .
Funders | Funder number |
---|---|
Israel Ministry of Science and Technology | |
Israel Science Foundation | 1372/09 |
Keywords
- Assignment problem
- Cellular networks
- Distributed algorithms