The Degrees of Freedom of Wireless NetworksVia Cut-Set Integrals
The Degrees of Freedom of Wireless NetworksVia Cut-Set Integrals
复制标题
无线网络的自由度通过割集积分
DOI：
10.1109/tit.2011.2120150
复制
发表时间：
2011
影响因子：
2.5
通讯作者：
F. Schettino
中科院分区：
文献类型：
--
作者：
M. Franceschetti;M. Migliore;Paolo Minero;F. Schettino
空间自由度（d.o.f.）无线网络中携带信息的信号的几何变化被简化为计算环境相对于信息必须流过的切口的几何变化。物理上，这有一个有吸引力的解释，在切割诱导的多样性可能丰富的散射环境。在数学上，这种变化被表示为一个积分沿着切，我们称之为割集积分，其缩放顺序的情况下，平面网络嵌入在任意的三维（3-D）环境中进行评估。提出的结果揭示了一些新的光的无线网络的容量计算的问题，显示了一个基本的限制所施加的削减的大小，通过该信息必须流动。在试图删除什么可能出现明显的不一致与以前的文献，我们还讨论了我们的上限如何与相应的下限使用多跳，分层合作，干扰对齐的技术。
The problem of determining the number of spatial degrees of freedom (d.o.f.) of the signals carrying information in a wireless network is reduced to the computation of the geometric variation of the environment with respect to the cut through which the information must flow. Physically, this has an appealing interpretation in terms of the diversity induced on the cut by the possible richness of the scattering environment. Mathematically, this variation is expressed as an integral along the cut, which we call cut-set integral, and whose scaling order is evaluated exactly in the case of planar networks embedded in arbitrary three-dimensional (3-D) environments. Presented results shed some new light on the problem of computing the capacity of wireless networks, showing a fundamental limitation imposed by the size of the cut through which the information must flow. In an attempt to remove what may appear as apparent inconsistencies with previous literature, we also discuss how our upper bounds relate to corresponding lower bounds obtained using the techniques of multihop, hierarchical cooperation, and interference alignment.