No symbol left behind: a link-layer protocol for rateless codes

Authors:
Peter Anthony Iannucci;Jonathan Perry;Hari Balakrishnan;Devavrat Shah
Affiliations:
Massachusetts Institute of Technology, Cambridge, MA, USA;Massachusetts Institute of Technology, Cambridge, MA, USA;Massachusetts Institute of Technology, Cambridge, MA, USA;Massachusetts Institute of Technology, Cambridge, MA, USA
Venue:
Proceedings of the 18th annual international conference on Mobile computing and networking
Year:
2012

Citing 15
Cited 2

A rate-adaptive MAC protocol for multi-Hop wireless networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Robust rate adaptation for 802.11 wireless networks

Proceedings of the 12th annual international conference on Mobile computing and networking
Datalink streaming in wireless sensor networks

Proceedings of the 4th international conference on Embedded networked sensor systems
PPR: partial packet recovery for wireless networks

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Modulation rate adaptation in urban and vehicular environments: cross-layer implementation and experimental evaluation

Proceedings of the 14th ACM international conference on Mobile computing and networking
Cross-layer wireless bit rate adaptation

Proceedings of the ACM SIGCOMM 2009 conference on Data communication
AccuRate: constellation based rate estimation in wireless networks

NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Maranello: practical partial packet recovery for 802.11

NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Global design methods for raptor codes using binary and higher-order modulations

MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Strider: automatic rate adaptation and collision handling

Proceedings of the ACM SIGCOMM 2011 conference
Rateless spinal codes

Proceedings of the 10th ACM Workshop on Hot Topics in Networks
Rate-compatible puncturing of low-density parity-check codes

IEEE Transactions on Information Theory
Raptor codes

IEEE Transactions on Information Theory
Rateless Coding for Gaussian Channels

IEEE Transactions on Information Theory
Spinal codes

Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication

Spinal codes

Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Spinal codes

ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, rateless codes have introduced a promising approach to obtaining wireless throughput higher than what is achieved by fixed-rate codes, especially over time-varying channels. Rateless codes like Raptor, Strider, and spinal codes naturally process all the information available at the receiver corresponding to a packet, whether from one or many frame transmissions. However, a profitable deployment of rateless codes in a wireless network requires a link-layer protocol to coordinate between sender and receiver. This protocol needs to determine how much coded data should be sent before the sender pauses for feedback from the receiver. Without such feedback, an open-loop sender would not know when the packet has been decoded, but sending this feedback is not free and consumes a significant fraction of the packet transmission time. This paper develops RateMore, a protocol that learns the probability distribution of the number of symbols required to decode a packet (the decoding CDF), and uses the learned distribution in a dynamic programming strategy to produce an optimal transmission schedule. Our experiments show that RateMore reduces overhead by between 2.6x and 3.9x compared to 802.11-style ARQ and between 2.8x and 5.4x compared to 3GPP-style "Try-after-n" HARQ.