## Towards an Information Theory of Large Networks: An Achievable Rate Region (2003)

### Cached

### Download Links

Venue: | IEEE Trans. Inform. Theory |

Citations: | 174 - 10 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}

}

### Years of Citing Articles

### 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,

### Citations

9231 |
Elements of Information Theory
- Cover, Thomas
- 1990
(Show Context)
Citation Context ...e transmits the codeword , where, for each forward estimates : are obtained by applying the encoding procedure given in Appendix II to . Decoding: Each node decodes using successive cancellation [5], =-=[9]-=-, [30]. Thus, each node defines an order in which it successively decodes the signals received from different levels of the different flowgraphs that it belongs to. While decoding a particular level o... |

2427 | The Capacity of Wireless Networks
- Gupta, Kumar
- 2000
(Show Context)
Citation Context ... we show that a transport capacity of( ) bit-meters per second (bit-meters/s) is feasible in a certain family of networks, as compared to the best possible transport capacity of ( ) bit-meters/s 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 multiuser ... |

2052 | Capacity of Multi-antenna Gaussian Channels
- Telatar
- 1999
(Show Context)
Citation Context ...ort capacity of bit-meters/s is achieved. VI. FEASIBILITY OF TRANSPORT CAPACITY OF BIT-METERS/S Our constructive example is motivated by the multiple transmit–receive antenna architecture [11], [12], =-=[29]-=-, and the basic idea is as follows. Consider a network of nodes, where source nodes (for notational simplicity, let be even) are placed “close” to the origin and destination nodes are placed “close” t... |

1759 | On limits of wireless communications in a fading environment when using multiple antennas,” Wireless Personal Commun
- Foschini, Gans
- 1998
(Show Context)
Citation Context ...transport capacity of bit-meters/s is achieved. VI. FEASIBILITY OF TRANSPORT CAPACITY OF BIT-METERS/S Our constructive example is motivated by the multiple transmit–receive antenna architecture [11], =-=[12]-=-, [29], and the basic idea is as follows. Consider a network of nodes, where source nodes (for notational simplicity, let be even) are placed “close” to the origin and destination nodes are placed “cl... |

1564 | Information theory and reliable communication - Gallager - 1968 |

1341 | survey on sensor networks
- Akyildiz, Su, et al.
- 2002
(Show Context)
Citation Context ...g mobile users of portable-yet-powerful computing devices (laptops, PDAs, smart phones) on a campus using, for instance, IEEE 802.11 wireless local-area network (LAN) technology [20], sensor networks =-=[3]-=-, automated transportation systems [10], Bluetooth [17], and HomeRF [24]. Ad hoc wireless networks differ from conventional cellular networks in that all links are wireless and there is no centralized... |

1218 | Network information flow
- Ahlswede, Cai, et al.
- 2000
(Show Context)
Citation Context ...lowgraphs . Generalization of the approach for the case where there are multiple source–destination pairs is straightforward. A limitation of the above approach is that it does not use network coding =-=[2]-=-. That is, since intermediate nodes handle information sent by different virtual source–destination pairs independently, they do not perform coding of bits received over different paths. It is shown i... |

1070 |
Layered Space-Time Architecture for Wireless Communication in a Fading Environment When using Multi-element Antennas
- Foschini
- 1996
(Show Context)
Citation Context ...ere a transport capacity of bit-meters/s is achieved. VI. FEASIBILITY OF TRANSPORT CAPACITY OF BIT-METERS/S Our constructive example is motivated by the multiple transmit–receive antenna architecture =-=[11]-=-, [12], [29], and the basic idea is as follows. Consider a network of nodes, where source nodes (for notational simplicity, let be even) are placed “close” to the origin and destination nodes are plac... |

927 |
Noiseless coding of correlated information sources
- Slepian, Wolf
- 1973
(Show Context)
Citation Context ...rawn according to Random Partitions We next construct a nested set of random partitions of . These nested random partitions will allow us to recursively use the random binning argument, introduced in =-=[27]-=- and used in [8] for the single-relay channel, to show that is achievable. Let . Having obtained we generate a random partition of by randomly and independently assigning to according to a uniform dis... |

711 |
Gamal, “Capacity theorems for the relay channel
- Cover, E
- 1979
(Show Context)
Citation Context ...only referred to as a relay channel, which was introduced in [22]. The capacities of two special types of relay channels—the physically degraded and reversely degraded relay channels—were obtained in =-=[8]-=-. The achievable rate given by our result for a relay channel is exactly the maximum of those in [8, Theorems 1 and 2]. Specifically, two flowgraphs are possible for a relay channel. 1) , , and . For ... |

480 |
Principle of Mobile Communication
- Stüber
- 1996
(Show Context)
Citation Context ...be real-valued random variables. Here, we will also consider a more general model that, in addition to the signal-power path loss, also incorporates channel variation due to Rayleigh flat fading [6], =-=[28]-=-. Specifically, the channel gain from node to node is given by (8) where : is an i.i.d. complex Gaussian collection with .2 Furthermore, each use of the channel involves independent . Under this chann... |

429 | Capacity of fading channels with channel side information - Goldsmith, Varaiya - 1986 |

398 | Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading
- Hochwald, Marzetta
- 1999
(Show Context)
Citation Context ...riance matrix . 3Alternatively, one can consider a block-fading channel model where the fading coefficients remain fixed over a block of transmissions and take i.i.d. values from block to block [6], =-=[18]-=-, [26]. If the length of the blocks over which the fading coefficients remain constant is sufficiently long, the above scenario holds by learning the channel gains implicitly or explicitly. 1882 IEEE ... |

383 | Broadcast channels
- Cover
- 1972
(Show Context)
Citation Context ...aign, Urbana, IL 61801 USA (e-mail: prkumar@uiuc.edu). Communicated by P. Narayan, Associate Editor for Shannon Theory. Digital Object Identifier 10.1109/TIT.2003.814480 and the deterministic channel =-=[7]-=-, and even fewer results are available for the interference channel [23]. It should be further noted that the above applications as well as the channel models used for analyzing them involve mainly si... |

199 | The Bluetooth Radio System - Haartsen - 2000 |

184 |
der Meulen. Three-terminal communication channels
- van
- 1971
(Show Context)
Citation Context ...al model that have been considered in the literature. When has only three nodes— , , and one additional node —the resultant network is commonly referred to as a relay channel, which was introduced in =-=[22]-=-. The capacities of two special types of relay channels—the physically degraded and reversely degraded relay channels—were obtained in [8]. The achievable rate given by our result for a relay channel ... |

142 |
Multi-way communication channels
- Ahlswede
- 1971
(Show Context)
Citation Context ...ions given by Theorem 4.1 for the -user Gaussian multiple-access channel and the -user Gaussian broadcast channel are exactly the capacity-defining achievable rate regions given for these channels in =-=[1]-=-, [21] as well as [4], [14], respectively. We next extend Theorems 3.1 and 4.1 so as to allow different information to be sent over different flowgraphs between a source–destination pair . The basic i... |

140 |
Recent results in the Shannon theory
- Wyner
- 1974
(Show Context)
Citation Context ...nsmits the codeword , where, for each forward estimates : are obtained by applying the encoding procedure given in Appendix II to . Decoding: Each node decodes using successive cancellation [5], [9], =-=[30]-=-. Thus, each node defines an order in which it successively decodes the signals received from different levels of the different flowgraphs that it belongs to. While decoding a particular level of a pa... |

101 |
Shitz), “Fading channels: Information-theoretic and communications aspects
- Biglieri, Proakis, et al.
- 1998
(Show Context)
Citation Context ... all be real-valued random variables. Here, we will also consider a more general model that, in addition to the signal-power path loss, also incorporates channel variation due to Rayleigh flat fading =-=[6]-=-, [28]. Specifically, the channel gain from node to node is given by (8) where : is an i.i.d. complex Gaussian collection with .2 Furthermore, each use of the channel involves independent . Under this... |

95 |
Random coding theorem for broadcast channels with degraded components
- Bergmans
- 1973
(Show Context)
Citation Context ... 4.1 for the -user Gaussian multiple-access channel and the -user Gaussian broadcast channel are exactly the capacity-defining achievable rate regions given for these channels in [1], [21] as well as =-=[4]-=-, [14], respectively. We next extend Theorems 3.1 and 4.1 so as to allow different information to be sent over different flowgraphs between a source–destination pair . The basic idea is to colocate vi... |

93 | Matrix variate distributions - Gupta, Nagar - 2000 |

92 |
The Gaussian parallel relay network
- Schein, Gallager
- 2000
(Show Context)
Citation Context ...f the achievable rate for the one-relay channel in [8, Theorems 1 and 2] to networks having more than one relay node. A network having four nodes— , , and two relays: and —with being , is analyzed in =-=[25]-=- when the network is communicating over the Gaussian channel. In this case, one of the achievable rates obtained there is a special case of our result. Later, in Section IV, we will extend our main re... |

85 |
Multiple access channels
- Liao
- 1972
(Show Context)
Citation Context ...given by Theorem 4.1 for the -user Gaussian multiple-access channel and the -user Gaussian broadcast channel are exactly the capacity-defining achievable rate regions given for these channels in [1], =-=[21]-=- as well as [4], [14], respectively. We next extend Theorems 3.1 and 4.1 so as to allow different information to be sent over different flowgraphs between a source–destination pair . The basic idea is... |

79 | Capacity and coding for degraded broadcast channel - Gallager - 1974 |

55 | Cooperative broadcasting
- Bergmans, Cover
- 1974
(Show Context)
Citation Context ...h node transmits the codeword , where, for each forward estimates : are obtained by applying the encoding procedure given in Appendix II to . Decoding: Each node decodes using successive cancellation =-=[5]-=-, [9], [30]. Thus, each node defines an order in which it successively decodes the signals received from different levels of the different flowgraphs that it belongs to. While decoding a particular le... |

39 | Space-time multiple access: Linear growth in sum rate
- Hochwald, Vishwanath
- 2002
(Show Context)
Citation Context ...ty for large (since is given by (20), , for large ). Thus, is nearly distributed as , which has mean and variance (see [15, Theorem 3.3.28] and its generalization to complex vectors, for instance, in =-=[19]-=-). Furthermore, it is easy to show that, for and any Hence, (22) holds if Therefore, rate is feasible from to with high probability if (23) 3) Finally, destination should be able to successfully decod... |

25 | HomeRF: Wireless networking for the connected home
- Negus, Stephens, et al.
- 2000
(Show Context)
Citation Context ...s, smart phones) on a campus using, for instance, IEEE 802.11 wireless local-area network (LAN) technology [20], sensor networks [3], automated transportation systems [10], Bluetooth [17], and HomeRF =-=[24]-=-. Ad hoc wireless networks differ from conventional cellular networks in that all links are wireless and there is no centralized control. As every node may not be in direct communication range of ever... |

14 |
Multiuser capacity in block fading with no channel state information
- Shamai, Marzetta
- 2002
(Show Context)
Citation Context ... matrix . 3Alternatively, one can consider a block-fading channel model where the fading coefficients remain fixed over a block of transmissions and take i.i.d. values from block to block [6], [18], =-=[26]-=-. If the length of the blocks over which the fading coefficients remain constant is sufficiently long, the above scenario holds by learning the channel gains implicitly or explicitly. 1882 IEEE TRANSA... |

4 | Gamal,"Capacity Theorems for the relay channel - Cover, El - 1979 |

4 | Network information - Ahlswede, Cai, et al. - 2000 |

2 | Shamai (Shitz), "Fading channels: Information-theoretic and communications aspects - Biglieri, Proakis, et al. - 1998 |

2 |
Dynamic channel allocation for vehicle-to-vehicle communication in automated highway systems
- Eskali, Petty, et al.
- 1997
(Show Context)
Citation Context ...l computing devices (laptops, PDAs, smart phones) on a campus using, for instance, IEEE 802.11 wireless local-area network (LAN) technology [20], sensor networks [3], automated transportation systems =-=[10]-=-, Bluetooth [17], and HomeRF [24]. Ad hoc wireless networks differ from conventional cellular networks in that all links are wireless and there is no centralized control. As every node may not be in d... |

2 | der Meulen,"Three-terminal communication channels - Van - 1971 |

2 | Principles of Mobile Communication - Stfiber - 1996 |

1 |
reflections on the interference channel,” in Communications and Cryptography: Two Sides of One Tapestry
- “Some
- 1994
(Show Context)
Citation Context ...P. Narayan, Associate Editor for Shannon Theory. Digital Object Identifier 10.1109/TIT.2003.814480 and the deterministic channel [7], and even fewer results are available for the interference channel =-=[23]-=-. It should be further noted that the above applications as well as the channel models used for analyzing them involve mainly single-hop wireless communication. Recently, there has been considerable i... |