Distributed approximation of cellular coverage

Boaz Patt-Shamir*, Dror Rawitz, Gabriel Scalosub

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review


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 languageEnglish
Pages (from-to)331-345
Number of pages15
JournalLecture Notes in Computer Science
Volume5401 LNCS
StatePublished - 2008
Event12th International Conference on Principles of Distributed Systems, OPODIS 2008 - Luxor, Egypt
Duration: 15 Dec 200818 Dec 2008


Dive into the research topics of 'Distributed approximation of cellular coverage'. Together they form a unique fingerprint.

Cite this