.png){kind=icon}
返回
Algorithms for Wireless Capacity
.png){kind=icon}
OA
AI
DOI：10.1109/TNET.2013.2258036.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Approximation algorithms
capacity
physical model
scheduling
wireless networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
引用论文
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
OAAI分享收藏分享收藏Implications of the Dominant Role of Transporters in Drug Uptake by Cells (Supplementary Material)
PREAI
分享收藏
查看更多内容