DMCA
Towards an Information Theory of Large Networks: An Achievable Rate Region (2003)
Cached
Download Links
| Venue: | IEEE Trans. Inform. Theory |
| Citations: | 202 - 11 self |
BibTeX
@ARTICLE{Gupta03towardsan,
author = {Piyush Gupta and P. R. Kumar},
title = {Towards an Information Theory of Large Networks: An Achievable Rate Region},
journal = {IEEE Trans. Inform. Theory},
year = {2003},
volume = {49},
pages = {1877--1894}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract — We study communication networks of arbitrary size and topology and communicating over a general vector discrete memoryless channel. We propose an information-theoretic constructive scheme for obtaining an achievable rate region in such networks. Many well-known capacity-defining achievable rate regions can be derived as special cases of the proposed scheme. A few such examples are the physically degraded and reverselydegraded relay channels, the Gaussian multiple-access channel, and the Gaussian broadcast channel. The proposed scheme also leads to inner bounds for the multicast and allcast capacities. Applying the proposed scheme to a specific wireless network of nodes located in a region of unit area, we show that a transport capacity of ¡£ ¢ bit-meters/sec is feasible in a certain family of networks, as compared to the best possible transport capacity ¡£¢§ ¦ ¨ ¤ of bit-meters/sec in [16] where the receiver capabilities were limited. Even though the improvement is shown for a specific class of networks, a clear implication is that designing and employing more sophisticated multi-user coding schemes can provide sizable gains in at least some large wireless networks. Index Terms — Discrete memoryless channels, Gaussian channels, multiuser communications, network information theory,
Keyphrases
achievable rate region large network information theory bit-meters sec network information theory index term discrete memoryless channel specific class sizable gain clear implication gaussian channel sophisticated multi-user special case transport capacity communication network relay channel gaussian broadcast channel receiver capability arbitrary size certain family gaussian multiple-access channel unit area large wireless network allcast capacity multiuser communication proposed scheme possible transport capacity information-theoretic constructive scheme general vector discrete memoryless channel specific wireless network
