首页> 外文期刊>Information Theory, IEEE Transactions on >Rate-Constrained Wireless Networks With Fading Channels: Interference-Limited and Noise-Limited Regimes
【24h】

Rate-Constrained Wireless Networks With Fading Channels: Interference-Limited and Noise-Limited Regimes

机译:具有衰落信道的速率受限无线网络:干扰受限和噪声受限的机制

获取原文
获取原文并翻译 | 示例

摘要

A network of $n$ wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power $P$ or remain silent. The objective is to maximize the number of active links such that each active link can transmit with a constant rate $lambda $. In a Rayleigh fading environment, an upper bound is derived that shows the number of active links scales at most like $ {{ 1}over { lambda }} log n$. To obtain a lower bound, a decentralized link activation strategy is described and analyzed. It is shown that for small values of $lambda $, the number of supported links by this strategy meets the upper bound; however, as $lambda $ grows, this number becomes far below the upper bound. To shrink the gap between the upper bound and the achievability result, a modified link activation strategy is proposed and analyzed based on some results from random graph theory. It is shown that this modified strategy performs very close to the optimum. Specifically, this strategy is asymptotically almost surely optimum when $lambda $ approaches $infty $ or 0. It turns out that the optimality results are obtained in an interference-limited regime. It is demonstrated that, by proper selection of the algorithm parameters, the proposed scheme also allows the network to operate in a noise-limited regime in which the transmission rates can be adjusted by the transmission powers. The price for this-n-n flexibility is a decrease in the throughput scaling law by a multiplicative factor of $log log n$. Finally, both decentralized and centralized schemes are evaluated in a distance-dependent fading environment with a pathloss exponent of $m$ and are shown to achieve throughput that scale like $Theta left ( n^{{ m}over { m+2}} log n right )$ and $Theta left ( n^{{ m^{2} + 2m}over { m^{2}+2m+4}} right )$, respectively.
机译:在瑞利衰落环境中考虑了$ n $个无线通信链路的网络。假定每个链路可以处于活动状态并以恒定功率$ P $传输或保持静音。目的是最大化活动链接的数量,以使每个活动链接可以以恒定速率$ lambda $发送。在瑞利衰落环境中,得出一个上限,该上限显示活动链接比例的数量最多为$ {{1}超过{lambda}} log n $。为了获得下限,描述并分析了分散链路激活策略。结果表明,对于$ lambda $的较小值,此策略支持的链接数满足上限;但是,随着$ lambda $的增长,该数字变得远远低于上限。为了缩小上限和可达到性结果之间的差距,基于随机图论的一些结果,提出了一种改进的链路激活策略并进行了分析。结果表明,这种改进的策略非常接近最佳性能。具体来说,当$ lambda $接近$ infty $或0时,此策略几乎肯定是最优的。事实证明,最优结果是在干扰受限的情况下获得的。事实证明,通过适当选择算法参数,提出的方案还允许网络在噪声受限的状态下运行,在该状态下可以通过传输功率来调整传输速率。这种n-n灵活性的代价是吞吐量缩放定律降低了乘数$ log log n $。最后,分散式和集中式方案均在路径损耗指数为$ m $的距离相关衰落环境中进行评估,并显示出达到$ Theta left(n ^ {{m} over {m + 2}} log n right)$和$ Theta left(n ^ {{m ^ {2} + 2m}分别位于{m ^ {2} + 2m + 4}} right)$之上。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号