Cut-set Theorems for Multi-state Networks

We derive new cut-set bounds on the achievable rates in a general multi-terminal network with finite number of states. Multiple states are common in communication networks in the form of multiple channel and nodes’ states. Our results are broadly applicable and provide much tighter upper bounds than the known single state min-cut max-flow theorem, and hence form an important new tool to bound the performance of multi-node networks. Two examples are presented to illustrate the tightness and the utility of the new bounds. In each of the example applications, the known single-state max-flow min-cut theorem provides a bound strictly looser than the new cut-set bounds. The first illustrative example is single-user compound channels, where both the transmitter and receiver have channel state information. The example of compound channels represents the smallest possible network with only two nodes, but has multiple states due to channel variations. The upper bound derived using the proposed bounds turns out to be the capacity of the compound channel, which implies that the bound is tight in this case. The second example is from a contemporary network problem. Here, we demonstrate the application of new bounds to characterize the limits on rate of information transfer in ‘cheap’ relay networks, where the relay nodes can either transmit or receive, but not both simultaneously. In this case, each constituent channel has a single state but relay nodes can be in one of the two states, transmit or receive mode, giving rise to multiple network states. Here, again, the upper bound coincide with the capacity of the channel if the relay channel is degraded.

[1]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[2]  Michael Gastpar,et al.  On the capacity of wireless networks: the relay case , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[3]  Ashutosh Sabharwal,et al.  On capacity of Gaussian 'cheap' relay channel , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[4]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[5]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[6]  J. Wolfowitz Coding Theorems of Information Theory , 1962, Ergebnisse der Mathematik und Ihrer Grenzgebiete.

[7]  Ashutosh Sabharwal,et al.  Network Channel Estimation in Cooperative Wireless Networks , 2003 .

[8]  Ashutosh Sabharwal,et al.  On the Capacity of 'Cheap' Relay Networks , 2003 .

[9]  Ashutosh Sabharwal,et al.  Achievable Rates for Arbitrary Network Topologies with â Cheapâ Nodes , 2003 .

[10]  Mohammad Ali Khojastepour,et al.  The capacity of average and peak power constrained fading channels with channel side information , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[11]  Anthony Ephremides,et al.  Information Theory and Communication Networks: An Unconsummated Union , 1998, IEEE Trans. Inf. Theory.

[12]  Pravin Varaiya,et al.  Capacity of fading channels with channel side information , 1997, IEEE Trans. Inf. Theory.

[13]  R. Gallager,et al.  The Gaussian parallel relay network , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).