On capacity of deterministic relay networks

In this paper, we study network coding for a single multicast session in wireless networks based on ldquodeterministic channel modelrdquo introduced recently in [2], [3]. We propose a network coding scheme for acyclic deterministic wireless network which can achieve the well-known cutset upper bound for such networks. While the original approach in [3] first proves the achievability of cutset upper bound for the layered networks and then extends the result to acyclic networks, we provide a short and direct proof for acyclic networks which trivially includes the layered networks.