Network Coding with Low Complexity in Wireless Ad-hoc Multicast Networks

To reduce the cost and complexity of network coding in multicast networks, we propose an algorithm to obtain the routes of the maximum flow and the encoding nodes. Thus the coding operation can be taken at these nodes only, rather than throughout the whole network. A practical approach for wireless Ad-hoc network is also given. Moreover, based on a random graph model of Ad-hoc network, we will show that the encoding node number and the maximum flow value between a source and destination pair approximately obey the geometric and the Poisson distribution, respectively.