arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0802.0534cs.ITmath.IT
收藏

o(log(SNR))内无线网络的容量-中继、反馈、协作和全双工操作的影响

Capacity of Wireless Networks within o(log(SNR)) - the Impact of Relays, Feedback, Cooperation and Full-Duplex Operation

Viveck R. Cadambe, Syed A. Jafar

摘要:

最近的工作已经表征了$o(\log({SNR}))$内的时变/频率选择性无线干扰网络和$X$网络的总容量,即,在高SNR(信噪比)下精度接近100%。在本文中,我们寻求类似的容量特性的无线网络中继,反馈,全双工操作,通过嘈杂的信道和发射机/接收机的合作。首先,我们考虑一个网络与$S$源节点,$R$中继节点和$D$目的地节点与随机时变/频率选择性信道系数和全局信道知识在所有节点。我们允许在所有节点的全双工操作,以及因果无噪声反馈的所有接收到的信号的所有源和中继节点。该网络的总容量被表征为$\frac{SD}{S+D-1}\log({SNR})+o(\log({SNR}))$。其结果的含义是,中继,因果反馈,通过物理信道和全双工操作的发射机/接收机的合作的能力的好处成为一个可以忽略不计的一部分,在高信噪比的网络容量。文中还指出了这一结果的一些例外。其次,我们考虑一个网络与$K$全双工节点与一个独立的消息从每个节点到每个其他节点的网络。我们发现,该网络的总容量是有界的下由$\frac{K(K-1)}{2K-2}+o(\log({SNR}))$和$\frac{K(K-1)}{2K-3}+o(\log({SNR}))$上界。

英文摘要:

Recent work has characterized the sum capacity of time-varying/frequency-selective wireless interference networks and $X$ networks within $o(\log({SNR}))$, i.e., with an accuracy approaching 100% at high SNR (signal to noise power ratio). In this paper, we seek similar capacity characterizations for wireless networks with relays, feedback, full duplex operation, and transmitter/receiver cooperation through noisy channels. First, we consider a network with $S$ source nodes, $R$ relay nodes and $D$ destination nodes with random time-varying/frequency-selective channel coefficients and global channel knowledge at all nodes. We allow full-duplex operation at all nodes, as well as causal noise-free feedback of all received signals to all source and relay nodes. The sum capacity of this network is characterized as $\frac{SD}{S+D-1}\log({SNR})+o(\log({SNR}))$. The implication of the result is that the capacity benefits of relays, causal feedback, transmitter/receiver cooperation through physical channels and full duplex operation become a negligible fraction of the network capacity at high SNR. Some exceptions to this result are also pointed out in the paper. Second, we consider a network with $K$ full duplex nodes with an independent message from every node to every other node in the network. We find that the sum capacity of this network is bounded below by $\frac{K(K-1)}{2K-2}+o(\log({SNR}))$ and bounded above by $\frac{K(K-1)}{2K-3}+o(\log({SNR}))$.

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

↑