On capacity achieving property of rotational coding for acyclic deterministic wireless networks

It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and forwarding overhead of random coding scheme prohibits its application in practice. Recently, a practical low complexity alternative, rotational coding scheme, was proposed in where it was proved that the rotational coding can achieve the capacity of the layered deterministic wireless networks. In this paper, we extend the result and prove that the rotational coding is in fact capacity achieving for a general acyclic network. Our result adds to the practical property of rotational coding scheme and makes it desirable for communication networks with arbitrary topology as long as there is no directional cycle in the network.