A Deterministic Approach to Wireless Relay Networks
| dc.creator | Avestimehr, A. S. | |
| dc.creator | Diggavi, S. N. | |
| dc.creator | Tse, D. N. C. | |
| dc.date | 2007-10-19 | |
| dc.date.accessioned | 2026-07-07T08:37:32Z | |
| dc.date.available | 2026-07-07T08:37:32Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0710.3777 | |
| dc.identifier | http://arxiv.org/abs/0710.3777 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/140432 | |
| dc.subject | Information Theory | |
| dc.subject | Discrete Mathematics | |
| dc.subject | Probability | |
| dc.title | A Deterministic Approach to Wireless Relay Networks | |
| dc.type | text |