Abstract
Characterizing the capacity region of multi-source wireless relay networks is one of the fundamental issues in network information theory. The problem is, however, quite challenging because the transmission of other sessions acts as inter-user interference when there exist multiple source-destination (S-D) pairs in the network. By focusing on a special class of networks, we show that the capacity can be found. Namely, we study a linear finite-field network with time-varying channels, which exhibits broadcast, interference, and fading natures of wireless communication. We observe that fading can play an important role in mitigating inter-user interference effectively for both single-hop and multi-hop networks. We propose new block Markov encoding and relaying schemes with randomized channel pairing, which exploit such channel variations, and derive their achievable rates. By comparing them with the general cut-set upper bound, the capacity region of single-hop networks and the sum-capacity of multi-hop networks can be characterized for some classes of channel distributions and networks topologies. For these classes, we show that the capacity of multi-source networks can be interpreted as the max-flow min-cut theorem.

This publication has 9 references indexed in Scilit: