Wireless Network Information Flow: A Deterministic Approach
Reads0
Chats0
TLDR
An exact characterization of the capacity of a network with nodes connected by deterministic channels is obtained, a natural generalization of the celebrated max-flow min-cut theorem for wired networks.Abstract:
In a wireless network with a single source and a single destination and an arbitrary number of relay nodes, what is the maximum rate of information flow achievable? We make progress on this long standing problem through a two-step approach. First, we propose a deterministic channel model which captures the key wireless properties of signal strength, broadcast and superposition. We obtain an exact characterization of the capacity of a network with nodes connected by such deterministic channels. This result is a natural generalization of the celebrated max-flow min-cut theorem for wired networks. Second, we use the insights obtained from the deterministic analysis to design a new quantize-map-and-forward scheme for Gaussian networks. In this scheme, each relay quantizes the received signal at the noise level and maps it to a random Gaussian codeword for forwarding, and the final destination decodes the source's message based on the received signal. We show that, in contrast to existing schemes, this scheme can achieve the cut-set upper bound to within a gap which is independent of the channel parameters. In the case of the relay channel with a single relay as well as the two-relay Gaussian diamond network, the gap is 1 bit/s/Hz. Moreover, the scheme is universal in the sense that the relays need no knowledge of the values of the channel parameters to (approximately) achieve the rate supportable by the network. We also present extensions of the results to multicast networks, half-duplex networks, and ergodic networks.read more
Citations
More filters
Book
Network Information Theory
Abbas El Gamal,Young-Han Kim +1 more
TL;DR: In this article, a comprehensive treatment of network information theory and its applications is provided, which provides the first unified coverage of both classical and recent results, including successive cancellation and superposition coding, MIMO wireless communication, network coding and cooperative relaying.
Journal ArticleDOI
Compute-and-Forward: Harnessing Interference Through Structured Codes
Bobak Nazer,Michael Gastpar +1 more
TL;DR: In this article, the authors proposed a new strategy, compute-and-forward, that exploits interference to obtain significantly higher rates between users in a network by decoding linear functions of transmitted messages according to their observed channel coefficients rather than ignoring the interference as noise.
Book
Interference Alignment: A New Look at Signal Dimensions in a Communication Network
TL;DR: This monograph introduces to the reader the idea of interference alignment, traces its origins, reviews a variety of interference aligned schemes, summarizes the diverse settings where the idea is applicable and highlights the common principles that cut across these diverse applications.
Journal ArticleDOI
Noisy Network Coding
TL;DR: In this article, a noisy network coding scheme for communicating messages between multiple sources and destinations over a general noisy network is presented, where the relays do not use Wyner-Ziv binning as in previous compress-forward schemes and each decoder performs simultaneous decoding of the received signals from all the blocks without uniquely decoding the compression indices.
Journal ArticleDOI
Real Interference Alignment: Exploiting the Potential of Single Antenna Systems
TL;DR: It is proved that constellations can be aligned in a similar fashion as that of vectors in multiple antenna systems and space can be broken up into fractional dimensions.
References
More filters
Book
Elements of information theory
Thomas M. Cover,Joy A. Thomas +1 more
TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Journal ArticleDOI
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
TL;DR: Using distributed antennas, this work develops and analyzes low-complexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks and develops performance characterizations in terms of outage events and associated outage probabilities, which measure robustness of the transmissions to fading.
Journal ArticleDOI
Network information flow
TL;DR: This work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated, and by employing coding at the nodes, which the work refers to as network coding, bandwidth can in general be saved.
Journal ArticleDOI
User cooperation diversity. Part I. System description
TL;DR: Results show that, even though the interuser channel is noisy, cooperation leads not only to an increase in capacity for both users but also to a more robust system, where users' achievable rates are less susceptible to channel variations.
Journal ArticleDOI
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
J.N. Laneman,Gregory W. Wornell +1 more
TL;DR: This work develops and analyzes space-time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network and demonstrates that these protocols achieve full spatial diversity in the number of cooperating terminals, not just theNumber of decoding relays, and can be used effectively for higher spectral efficiencies than repetition-based schemes.