2009 · 36 citations · 24 references
ComputingComputer ScienceComputer SystemsComputer NetworksSchedulingWireless CommunicationsCoding TheoryError Control CodingWireless Communication ProtocolsWireless NetworksCodingFair SchedulingHeterogeneous NetworksNetwork CodingPacket Loss RecoveryRetransmission MechanismsRetransmission ProtocolsWireless Network Performance
It is well-known that wireless links are error-prone and require retransmissions for recovering frames from errors and losses. Network coding (NC) has been proposed for more efficient MAC-layer retransmissions in WLANs. However, existing schemes employed the reception report mechanism, which is both inefficient and expensive. Furthermore, they considered neither fairness nor the effects of time-varying heterogeneous wireless networks. These issues are critical for achieving full benefit of network coding. Without addressing them, these schemes may even impair system performance. In this paper, a novel MAC-layer retransmission scheme, namely XOR rescue (XORR) is proposed. It estimates the reception status without extra overheads and devises a new coding metric, which accommodates the effects of the frames size and the channel condition. Finally, XORR employs NC-aware fair opportunistic scheduling, which is theoretically proven to be fair, i.e. not only the service time is evenly allocated, but also it always improves the expected goodput for every wireless station. It is further verified by theoretic analyses, extensive simulations and testbed experiments. Our results show that XORR outperforms the non-coding fair opportunistic scheduling and 802.11 by 25% and 40%, respectively.
24
Rudolf Ahlswede, Ning Cai, Shuo Li et al. · IEEE Transactions on Information Theory · 2000 · 7.9K citations
A high-throughput path metric for multi-hop wireless routing
Douglas S. J. De Couto, Daniel Aguayo, John Bicket et al. · 2003 · 3.4K citations
XORs in the Air: Practical Wireless Network Coding
S. Katti, Hariharan Rahul, Wenjun Hu et al. · IEEE/ACM Transactions on Networking · 2008 · 2.3K citations
Clique is hard to approximate within n1−ε
Johan Håstad · Acta Mathematica · 1999 · 1.4K citations · Full text