Two-Flow Capacity Region of the COPE Principle for Wireless Butterfly Networks With Broadcast Erasure Channels
Two-Flow Capacity Region of the COPE Principle for Wireless Butterfly Networks With Broadcast Erasure Channels
复制标题
具有广播擦除通道的无线蝶形网络COPE原理的双流容量区域
DOI：
--
复制
发表时间：
2013
影响因子：
2.5
通讯作者：
Chih
中科院分区：
文献类型：
--
作者：
W. Kuo;Chih
本文对具有广播包擦除信道的2流无线蝶形网络的科普原理的全容量区域进行了刻画。本文中的容量结果允许随机偷听与任意偷听概率，任意调度策略，网络范围内的信道状态信息（CSI）反馈后，每次传输，和潜在的使用非线性网络代码。信息理论的外边界推导出，考虑到延迟的CSI反馈的基础广播数据包擦除信道。为了提高线性网络码的可扩展性，本文提出了一类新的线性网络码，称为基于空间的线性网络码（SBLNC），它能达到容量的外界。此外，所提出的外边界和内边界稍后被推广用于其中传输可以被其2跳邻居听到的设置，即所谓的机会路由场景。当允许机会路由的可能性时，所提出的内边界和外边界并不总是满足。数值实验表明，这两个边界的相对差距平均小于0.08%。因此，建议的界限紧括号的容量区域，即使结合科普原则与机会路由。
This paper characterizes the full capacity region of the COPE principle for 2-flow wireless butterfly networks with broadcast packet erasure channels (PECs). The capacity results in this paper allow for random overhearing with arbitrary overhearing probabilities, arbitrary scheduling policies, network-wide channel state information (CSI) feedback after each transmission, and potential use of nonlinear network codes. An information-theoretic outer bound is derived that takes into account the delayed CSI feedback of the underlying broadcast packet erasure channels. For the achievability, this paper proposes a new class of linear network codes, named as the space-based linear network coding (SBLNC), that achieves the capacity outer bound. Further, the proposed outer and inner bounds are later generalized for the setting in which a transmission may be heard by its 2-hop neighbor(s), the so-called opportunistic routing scenario. When allowing the possibility of opportunistic routing, the proposed inner and outer bounds do not always meet. Numerical experiments, however, show that the relative gap of the two bounds is less than 0.08% in average. The proposed bounds thus tightly bracket the capacity region even when combining the COPE principle with opportunistic routing.