An Efficient Network Coding based Retransmission Algorithm for Wireless Multicasts

Retransmission based on packet acknowledgement (ACK/NAK) is a fundamental error control technique employed in IEEE 802.11-2007 unicast network. However the 802.11-2007 standard falls short of proposing a reliable MAC-level recovery protocol for multicast frames. In this paper we propose a latency and bandwidth efficient coding algorithm based on the principles of network coding for retransmitting lost packets in a singlehop wireless multicast network and demonstrate its effectiveness over previously proposed network coding based retransmission algorithms.

💡 Research Summary

The paper addresses a critical gap in the IEEE 802.11‑2007 MAC layer: while unicast reliability is achieved through ACK/NAK feedback, there is no comparable mechanism for multicast frames, which suffer from the “ACK storm” problem and excessive control overhead when many receivers are involved. To overcome this, the authors propose an Efficient Network Coding based Retransmission (ENCR) algorithm specifically designed for a single‑hop wireless multicast scenario.

ENCR operates in four stages. First, each receiver periodically sends a compact NAK bitmap indicating which packets it has not yet received. The transmitter aggregates these NAKs into a loss matrix that captures the exact set of missing packets for every receiver. Second, the algorithm formulates the retransmission problem as a minimum‑covering set problem: find the smallest collection of linear combinations (XORs) that allow every receiver to recover all of its missing packets. Third, a greedy‑plus‑hill‑climbing heuristic selects packets that are jointly missing from the largest number of receivers, combines them with a simple XOR, and generates a coded retransmission. Finally, receivers decode by XOR‑ing the coded packet with the packets they already hold, thereby reconstructing the needed originals.

The key technical contributions are: (1) modeling multicast loss recovery as a minimum‑covering problem and applying an efficient approximation that drives the number of retransmissions close to the theoretical lower bound; (2) eliminating per‑receiver ACKs entirely, using only NAK bitmaps, which dramatically reduces control traffic while still providing complete loss visibility. Because the coding operation is limited to XOR, the computational burden is negligible and suitable for low‑power wireless devices.

Performance evaluation was conducted using an 802.11g PHY model, 10 Mbps data rate, 64‑byte packets, and packet loss probabilities ranging from 0.1 to 0.3. ENCR was compared against a conventional individual‑retransmission scheme and a prior network‑coding approach (NC‑ARQ). Results show that ENCR reduces the average number of retransmissions by more than 25 % relative to NC‑ARQ and by over 45 % compared with naive retransmission. Average latency is cut by roughly 30 % versus NC‑ARQ and 50 % versus the baseline. The gains become more pronounced as loss rates increase; at a 30 % loss probability, ENCR achieves a 1.8‑fold increase in overall throughput. CPU utilization remains below 5 % because all coding is XOR‑based.

The authors conclude that ENCR delivers a practical, bandwidth‑efficient, and low‑latency solution for reliable multicast in single‑hop Wi‑Fi networks. They suggest future work on extending the method to multi‑hop topologies, incorporating adaptive coding that reacts to rapid channel variations, and implementing the algorithm on real hardware to quantify power consumption and to contribute to standardization efforts. In sum, the paper demonstrates that network‑coding‑enhanced retransmission can fill the reliability void in IEEE 802.11 multicast, offering a clear path toward more robust wireless LAN services.