Network coding-based reliable multicast in wireless networks

Reliable multicast, the lossless dissemination of data from one sender to a group of receivers, has a wide range of important applications. Recently, network coding has been applied to the reliable multicast in wireless networks, where multiple lost packets with distinct intended receivers are XOR-ed together as one packet and forwarded via single retransmission, resulting in a significant reduction of bandwidth consumption. However, the simple XOR operation cannot fully exploit the potential coding opportunities and finding the optimal set of lost packets for XOR-ing is a complex NP-complete optimization problem. In this work, we intend to move beyond the simple XOR to more general coding operations. Specifically, we propose two new schemes (a static scheme which repeatedly retransmits one coding packet until all intended receivers receive it and a dynamic scheme which updates the coding packet once one or more receivers receive it) to encode packets with more general coding operations, which not only can encode lost packets with common intended receivers together to fully exploit the potential coding opportunities but also have polynomial-time complexity. We demonstrate, through both analytical and simulation results, that the proposed schemes can more greatly reduce the bandwidth requirement than the available coding-based schemes, especially in the case of high packet loss probabilities and a larger number of receivers. This reduction can vary from a few percents to over 15% depending on the packet loss probabilities and the number of receivers.