Network coding has shown the promise of significant throughput improvement. In this paper, we study the throughput of two-hop wireless network coding and explore how the maximum throughput can be achieved under a random medium access scheme. Unlike previous studies, we consider a more practical network where the structure of overhearing status between the intended receivers and the transmitters is arbitrary. We make a formal analysis on the network throughput using network coding upon the concept of network coding cliques (NCCs). The analysis shows that the maximum normalized throughput, subject to fairness requirement, is n/n+m, where n is the number of transmitters and m is the number of NCCs in a 2-hop wireless network. We have also found that this maximum throughput can be achieved under a random medium access scheme when the medium access priority of the relay node is equal to the number of NCCs in the network. Our theoretical findings have been validated by simulation as well.
['Deze Zeng', 'Song Guo', 'Hai Jin', 'Shui Yu']
On the maximum throughput of two-hop wireless network coding