Name
Abstract | ||
|---|---|---|
We present a deterministic channel model which captures several key features of multiuser wireless communi- cation. 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. To make further progress, in this paper we present a new multiuser channel model which is analytically simpler than Gaussian models but yet still captures the two key features of wireless communication of broadcast and superposition. The key feature of this model is that the channels are deterministic: the signal received at a node in the network is a (determin- istic) function of the transmitted signals. This model is a good approximation of the corresponding multiuser Gaussian model under two assumptions that are quite common in many wireless communication scenarios: |
Year | Venue | Keywords |
|---|---|---|
2007 | Clinical Orthopaedics and Related Research | information theory,wireless network,wireless communication,relay channel,discrete mathematics,upper bound |
Field | DocType | Volume |
Relay channel,Wireless network,Topology,Mathematical optimization,Wireless,Upper and lower bounds,Communication channel,Theoretical computer science,Deterministic system,Deterministic system (philosophy),Relay,Mathematics | Journal | abs/0710.3 |
Citations | PageRank | References |
144 | 18.09 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Amir Salman Avestimehr | 1 | 1880 | 157.39 |
| Suhas N. Diggavi | 2 | 797 | 91.19 |
| David N. C. Tse | 3 | 2078 | 246.17 |