arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0711.2745cs.ITmath.IT
收藏

任意无线网络中的容量扩展

On Capacity Scaling in Arbitrary Wireless Networks

Urs Niesen, Piyush Gupta, Devavrat Shah

摘要:

在最近的工作中,Ozgur,Leveque和Tse(2007)获得了随机扩展无线网络(即,$n$节点随机均匀地放置在面积为$n$的正方形区域中。结果表明,在路径损耗指数较小的情况下,$α\in(2,3]$协作通信是阶最优的,而在路径损耗指数较大的情况下,$α> 3$多跳通信是阶最优的。然而,他们的结果(包括通信方案和证明技术)强烈依赖于随机节点放置引起的高概率规律性。在本文中,我们考虑的问题,在扩展的无线网络中的任意节点放置的吞吐量缩放的特征。作为主要结果,我们提出了一个更一般的新的合作通信方案,适用于任意放置的节点。对于小的路径损耗指数$α\in (2,3]$,我们表明,我们的计划是为了最佳的所有节点的位置,并达到完全相同的吞吐量缩放Ozgur等人。这表明,节点的位置的规律性不影响缩放的可实现的速率为$α\in (2,3]$。然而,对于大路径损耗指数$α>3$,情况明显不同。我们表明,在这种制度下,可实现的每节点速率的缩放关键取决于节点位置的规律性。然后,我们提出了一个家庭的计划,顺利“插值”之间的多跳和合作通信,这取决于在节点位置的规律性水平。我们建立了$α> 3$在对抗节点配置下的序最优性。

英文摘要:

In recent work, Ozgur, Leveque, and Tse (2007) obtained a complete scaling characterization of throughput scaling for random extended wireless networks (i.e., $n$ nodes are placed uniformly at random in a square region of area $n$). They showed that for small path-loss exponents $α\in(2,3]$ cooperative communication is order optimal, and for large path-loss exponents $α> 3$ multi-hop communication is order optimal. However, their results (both the communication scheme and the proof technique) are strongly dependent on the regularity induced with high probability by the random node placement. In this paper, we consider the problem of characterizing the throughput scaling in extended wireless networks with arbitrary node placement. As a main result, we propose a more general novel cooperative communication scheme that works for arbitrarily placed nodes. For small path-loss exponents $α\in (2,3]$, we show that our scheme is order optimal for all node placements, and achieves exactly the same throughput scaling as in Ozgur et al. This shows that the regularity of the node placement does not affect the scaling of the achievable rates for $α\in (2,3]$. The situation is, however, markedly different for large path-loss exponents $α>3$. We show that in this regime the scaling of the achievable per-node rates depends crucially on the regularity of the node placement. We then present a family of schemes that smoothly "interpolate" between multi-hop and cooperative communication, depending upon the level of regularity in the node placement. We establish order optimality of these schemes under adversarial node placement for $α> 3$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑