Please use this identifier to cite or link to this item:
|Title:||Myopic coding in multiterminal networks|
|Citation:||Ong, L., Motani, M. (2008-07). Myopic coding in multiterminal networks. IEEE Transactions on Information Theory 54 (7) : 3295-3314. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2008.924675|
|Abstract:||This correspondence investigates the interplay between cooperation and achievable rates in multiterminal 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 tradeoff by studying information-theoretic decode-forward-based coding strategies for data transmission in multiterminal 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 correspondence, 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 signal-to-noise ratio (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 nonzero rates as the network size grows without bound. © 2008 IEEE.|
|Source Title:||IEEE Transactions on Information Theory|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 20, 2018
WEB OF SCIENCETM
checked on Sep 10, 2018
checked on Aug 3, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.