Myopic Coding in Multiterminal Networks
From MaRDI portal
Publication:3604432
DOI10.1109/TIT.2008.924675zbMATH Open1318.94036arXiv0806.4874OpenAlexW2050902239MaRDI QIDQ3604432FDOQ3604432
Authors: Lawrence Ong, Mehul Motani 
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: This paper investigates the interplay between cooperation and achievable rates in multi-terminal networks. Cooperation refers to the process of nodes working together to relay data toward the destination. There is an inherent tradeoff between achievable information transmission rates and the level of cooperation, which is determined by how many nodes are involved and how the nodes encode/decode the data. We illustrate this trade-off by studying information-theoretic decode-forward based coding strategies for data transmission in multi-terminal networks. Decode-forward strategies are usually discussed in the context of omniscient coding, in which all nodes in the network fully cooperate with each other, both in encoding and decoding. In this paper, we investigate myopic coding, in which each node cooperates with only a few neighboring nodes. We show that achievable rates of myopic decode-forward can be as large as that of omniscient decode-forward in the low SNR regime. We also show that when each node has only a few cooperating neighbors, adding one node into the cooperation increases the transmission rate significantly. Furthermore, we show that myopic decode-forward can achieve non-zero rates as the network size grows without bound.
Full work available at URL: https://arxiv.org/abs/0806.4874
Recommendations
This page was built for publication: Myopic Coding in Multiterminal Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604432)
