Capacity Scaling of Wireless Ad Hoc Networks: Shannon Meets Maxwell
Capacity Scaling of Wireless Ad Hoc Networks: Shannon Meets Maxwell
复制标题
DOI：
10.1109/tit.2011.2177741
复制
发表时间：
2010-02
影响因子：
2.5
通讯作者：
Si-Hyeon Lee;Sae-Young Chung
中科院分区：
文献类型：
--
作者：
Si-Hyeon Lee;Sae-Young Chung
在本文中，我们描述了随机分布的节点的无线ad hoc网络的信息理论容量缩放。通过使用一个精确的信道模型从麦克斯韦方程组，我们成功地解决了文献中的冲突之间的线性容量缩放O zgu r和自由度限制的网络直径和波长的比率由Franceschetti在密集的网络中，网络面积是固定的，容量缩放的最小值和自由度限制在一个任意小的指数。在网络面积呈线性的扩展网络中，容量扩展为最小值，自由度限制在任意小的指数内。因此，如果在密集网络中，如果在扩展网络中，我们恢复的线性容量缩放O zgu r。另外，容量缩放被定义为Franceschetti定义的自由度限制。对于可扩展性，本文提出了一种改进的层次协作模型，该模型基于两个节点簇之间的多输入多输出信道容量的下界。
In this paper, we characterize the information-theoretic capacity scaling of wireless ad hoc networks with randomly distributed nodes. By using an exact channel model from Maxwell's equations, we successfully resolve the conflict in the literature between the linear capacity scaling by Özgür and the degrees of freedom limit given as the ratio of the network diameter and the wavelength by Franceschetti In dense networks where the network area is fixed, the capacity scaling is given as the minimum of and the degrees of freedom limit to within an arbitrarily small exponent. In extended networks where the network area is linear in , the capacity scaling is given as the minimum of and the degrees of freedom limit to within an arbitrarily small exponent. Hence, we recover the linear capacity scaling by Özgür if in dense networks and if in extended networks. Otherwise, the capacity scaling is given as the degrees of freedom limit characterized by Franceschetti For achievability, a modified hierarchical cooperation is proposed based on a lower bound on the capacity of multiple-input multiple-output channel between two node clusters using our channel model.