A Deterministic Approach to Wireless Relay Networks
arXiv:0710.3777
Abstract
We present a deterministic channel model which captures several key features of multiuser wireless communication. We consider a model for a wireless network with nodes connected by such deterministic channels, and present an exact characterization of the end-to-end capacity when there is a single source and a single destination and an arbitrary number of relay nodes. This result is a natural generalization of the max-flow min-cut theorem for wireline networks. Finally to demonstrate the connections between deterministic model and Gaussian model, we look at two examples: the single-relay channel and the diamond network. We show that in each of these two examples, the capacity-achieving scheme in the corresponding deterministic model naturally suggests a scheme in the Gaussian model that is within 1 bit and 2 bit respectively from cut-set upper bound, for all values of the channel gains. This is the first part of a two-part paper; the sequel [1] will focus on the proof of the max-flow min-cut theorem of a class of deterministic networks of which our model is a special case.
References in corpus (1)
Cited by in corpus (52)
- Wireless Network Information Flow: A Deterministic Approach
- Interference Alignment and the Degrees of Freedom for the K User Interference Channel
- Rethinking Information Theory for Mobile Ad Hoc Networks
- Approximate Capacity of Gaussian Relay Networks
- Wireless Network Information Flow
- Divide-and-conquer: Approaching the capacity of the two-pair bidirectional Gaussian relay network
- The Capacity Region of Multiway Relay Channels Over Finite Fields with Full Data Exchange
- Aligned Interference Neutralization and the Degrees of Freedom of the 2x2x2 Interference Channel
- On the Capacity of the Half-Duplex Diamond Channel
- The finite-dimensional Witsenhausen counterexample
- On the Sum Capacity of A Class of Cyclically Symmetric Deterministic Interference Channels
- Feedback Capacity of the Gaussian Interference Channel to Within 1.7075 Bits: the Symmetric Case
- On the Capacity and Generalized Degrees of Freedom of the X Channel
- Multi-hop Cooperative Wireless Networks: Diversity Multiplexing Tradeoff and Optimal Code Design
- DMT of Multi-hop Cooperative Networks - Part I: Basic Results
- Interference Alignment and a Noisy Interference Regime for Many-to-One Interference Channels
- Generalized Degrees of Freedom of the Symmetric Gaussian User Interference Channel
- Fading Broadcast Channels with State Information at the Receivers
- Two Birds and One Stone: Gaussian Interference Channel with a Shared Out-of-Band Relay of Limited Rate
- Transmission Techniques for Relay-Interference Networks
- Gaussian Relay Channel Capacity to Within a Fixed Number of Bits
- Capacity of Wireless Networks within o(log(SNR)) - the Impact of Relays, Feedback, Cooperation and Full-Duplex Operation
- Upper Bounds and Duality Relations of the Linear Deterministic Sum Capacity for Cellular Systems
- Interference Alignment on the Deterministic Channel and Application to Fully Connected AWGN Interference Networks
- Approximate Capacity of Gaussian Interference-Relay Networks with Weak Cross Links
- Algebraic Network Coding Approach to Deterministic Wireless Relay Networks
- Diversity-Multiplexing Tradeoff of the Half-Duplex Relay Channel
- The Capacity Region of the Linear Shift Deterministic Y-Channel
- On approximating Gaussian relay networks by deterministic networks
- Fast Algorithm for Finding Unicast Capacity of Linear Deterministic Wireless Relay Networks
- Deterministic Network Model Revisited: An Algebraic Network Coding Approach
- Signal Space Alignment for the Gaussian Y-Channel
- Interference Alignment with Asymmetric Complex Signaling - Settling the Host-Madsen-Nosratinia Conjecture
- Achieving Net Feedback Gain in the Butterfly Network with a Full-Duplex Bidirectional Relay
- Deriving Pareto-optimal performance bounds for 1 and 2-relay wireless networks
- Nested Lattice Codes for Gaussian Two-Way Relay Channels
- On Interference Alignment and the Deterministic Capacity for Cellular Channels with Weak Symmetric Cross Links
- The Approximate Capacity Region of the Gaussian Y-Channel
- Feedback Capacity of the Gaussian Interference Channel to within 2 Bits
- Scaling Laws and Techniques in Decentralized Processing of Interfered Gaussian Channels
- Capacity of 1-to-K Broadcast Packet Erasure Channels with Channel Output Feedback (Full Version)
- On Models of Multi-user Gaussian Channels with Fading
- On Source-Channel Separation in Networks
- The Two-User Deterministic Interference Channel with Rate-Limited Feedback
- On Achievable Schemes of Interference Alignment in Constant Channels via Finite Amplify-and-Forward Relays
- On the Deterministic Sum-Capacity of the Multiple Access Wiretap Channel
- On the Diversity-Multiplexing Tradeoff in Multiple-Relay Network
- Capacity of a Class of Symmetric SIMO Gaussian Interference Channels within O(1)
- Approximate Sum-Capacity of K-user Cognitive Interference Channels with Cumulative Message Sharing
- Lattice Coding and the Generalized Degrees of Freedom of the Interference Channel with Relay
- The Generalized Degrees of Freedom of the Interference Relay Channel with Strong Interference
- Improved Combinatorial Algorithms for Wireless Information Flow