Distributed approximation of cellular coverage

Boaz Patt-Shamir; Dror Rawitz; Gabriel Scalosub

doi:10.1016/j.jpdc.2011.12.003

Distributed approximation of cellular coverage

Boaz Patt-Shamir, Dror Rawitz, Gabriel Scalosub

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

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	https://doi.org/10.1016/j.jpdc.2011.12.003
State	Published - 1 Mar 2012

Keywords

Assignment problem
Cellular networks
Distributed algorithms

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computer Networks and Communications
Artificial Intelligence

Access to Document

10.1016/j.jpdc.2011.12.003

Cite this

@article{5412f8e91aa14a91adbadaf4b331742e,

title = "Distributed approximation of cellular coverage",

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.",

keywords = "Assignment problem, Cellular networks, Distributed algorithms",

author = "Boaz Patt-Shamir and Dror Rawitz and Gabriel Scalosub",

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 . ",

year = "2012",

month = mar,

day = "1",

doi = "10.1016/j.jpdc.2011.12.003",

language = "English",

volume = "72",

pages = "402--408",

journal = "Journal of Parallel and Distributed Computing",

issn = "0743-7315",

publisher = "Academic Press Inc.",

number = "3",

}

TY - JOUR

T1 - Distributed approximation of cellular coverage

AU - Patt-Shamir, Boaz

AU - Rawitz, Dror

AU - Scalosub, Gabriel

N1 - 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 .

PY - 2012/3/1

Y1 - 2012/3/1

N2 - 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.

AB - 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.

KW - Assignment problem

KW - Cellular networks

KW - Distributed algorithms

UR - http://www.scopus.com/inward/record.url?scp=84856324418&partnerID=8YFLogxK

U2 - 10.1016/j.jpdc.2011.12.003

DO - 10.1016/j.jpdc.2011.12.003

M3 - Article

AN - SCOPUS:84856324418

SN - 0743-7315

VL - 72

SP - 402

EP - 408

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

IS - 3

ER -

Distributed approximation of cellular coverage

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this