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 (8)
- Interference Alignment and the Degrees of Freedom for the K User Interference Channel
- Wireless Network Information Flow
- 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 on the Deterministic Channel and Application to Fully Connected AWGN Interference Networks
- Diversity-Multiplexing Tradeoff of the Half-Duplex Relay Channel
- On the Diversity-Multiplexing Tradeoff in Multiple-Relay Network