.png){kind=icon}
返回
Distributed approximation of cellular coverage
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2011.12.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (C) 2012 Published by Elsevier Inc.
Keyword:
Distributed algorithms
Cellular networks
Assignment problem
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
.png){kind=icon}
没有更多内容
没有更多内容