Wireless Network Information Flow

TL;DR

This paper characterizes achievable information rates in deterministic relay networks with broadcasting and interference, generalizing the max-flow min-cut theorem for certain models.

Contribution

It provides a complete characterization of achievable rates when the optimal distribution is a product distribution, extending classical network flow results.

Findings

Achievable rate for general deterministic relay networks is established.

Complete characterization when the optimal distribution is a product distribution.

Generalization of max-flow min-cut theorem for linear deterministic finite-field models.

Abstract

We present an achievable rate for general deterministic relay networks, with broadcasting at the transmitters and interference at the receivers. In particular we show that if the optimizing distribution for the information-theoretic cut-set bound is a product distribution, then we have a complete characterization of the achievable rates for such networks. For linear deterministic finite-field models discussed in a companion paper [3], this is indeed the case, and we have a generalization of the celebrated max-flow min-cut theorem for such a network.