.png){kind=icon}
Return
Algorithms for Wireless Capacity
.png){kind=icon}
OA
AI
DOI：10.1109/TNET.2013.2258036.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we address two basic questions in wireless communication. First, how long does it take to schedule an arbitrary set of communication requests? Second, given a set of communication requests, how many of them can be scheduled concurrently? Our results are derived in the signal-to-interference-plus-noise ratio (SINR) interference model with geometric path loss and consist of efficient algorithms that find a constant approximation for the second problem and a logarithmic approximation for the first problem. In addition, we show that the interference model is robust to various factors that can influence the signal attenuation. More specifically, we prove that as long as influences on the signal attenuation are constant, they affect the capacity only by a constant factor.
Keywords:
Approximation algorithms
capacity
physical model
scheduling
wireless networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
3.6
Papers:
4.4K
Citations:
9.5K
Organization
View more organizations
Cited Papers
Supply of Neuraminidase Inhibitors Related to Reduced Influenza A (H1N1) Mortality during the 2009–2010 H1N1 Pandemic: An Ecological Study.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAIShareSaveShareSaveShareSaveShareSaveImplications of the Dominant Role of Transporters in Drug Uptake by Cells (Supplementary Material)
PREAI
ShareSave View more