skip to main content
10.1145/2348543.2348549acmconferencesArticle/Chapter ViewAbstractPublication PagesmobicomConference Proceedingsconference-collections
research-article

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

Published: 22 August 2012 Publication History

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.

References

[1]
A. Anastasopoulos. Delay-optimal hybrid ARQ protocol design for channels and receivers with memory as a stochastic control problem. In Communications, 2008. ICC'08. IEEE International Conference on, pages 3536--3541, 2008.
[2]
R. Barron, C. Lo, and J. Shapiro. Global design methods for raptor codes using binary and higher-order modulations. In IEEE MILCOM, 2009.
[3]
J. Bicket. Bit-Rate Selection in Wireless Networks. Master's thesis, M.I.T., Feb. 2005.
[4]
J. Camp and E. Knightly. Modulation Rate Adaptation in Urban and Vehicular Environments: Cross-Layer Implementation and Experimental Evaluation. In MobiCom, 2008.
[5]
D. Chase. Code Combining: A Maximum-Likelihood Decoding Approach for Combining an Arbitrary Number of Noisy Packets. IEEE Trans. on Comm., 33(5):385--393, May 1985.
[6]
Erez, U. and Trott, M. and Wornell, G. Rateless Coding for Gaussian Channels. IEEE Trans. Info. Theory, 58(2):530--547, 2012.
[7]
O. Etesami, M. Molkaraie, and A. Shokrollahi. Raptor codes on symmetric channels. In ISIT, 2005.
[8]
R. Ganti, P. Jayachandran, H. Luo, and T. Abdelzaher. Datalink streaming in wireless sensor networks. In SenSys, pages 209--222, 2006.
[9]
A. Gudipati and S. Katti. Strider: Automatic rate adaptation and collision handling. In SIGCOMM, 2011.
[10]
J. Ha, J. Kim, and S. McLaughlin. Rate-compatible puncturing of low-density parity-check codes. IEEE Trans. Info. Theory, 2004.
[11]
J. Hagenauer. Rate-compatible punctured convolutional codes (rcpc codes) and their applications. IEEE Trans. on Comm., 1988.
[12]
B. Han, A. Schulman, F. Gringoli, N. Spring, B. Bhattacharjee, L. Nava, L. Ji, S. Lee, and R. Miller. Maranello: practical partial packet recovery for 802.11. In NSDI, pages 14--14, 2010.
[13]
G. Holland, N. Vaidya, and P. Bahl. A Rate-Adaptive MAC Protocol for Multihop Wireless Networks. In MobiCom, 2001.
[14]
IEEE Standard 802.11: Wireless LAN Medium Access Control and Physical Layer Specifications, Aug. 1999.
[15]
J. Ikuno, M. Wrulich, and M. Rupp. Performance and modeling of LTE H-ARQ. In Proc. International ITG Workshop on Smart Antennas (WSA 2009), Berlin, Germany, 2009.
[16]
K. Jamieson and H. Balakrishnan. PPR: Partial Packet Recovery for Wireless Networks. In SIGCOMM, 2007.
[17]
J. Li and K. Narayanan. Rate-compatible low density parity check codes for capacity-approaching ARQ scheme in packet data communications. In Int. Conf. on Comm., Internet, and Info. Tech., 2002.
[18]
K. C. Lin, N. Kushman, and D. Katabi. ZipTx: Exploiting the Gap Between Bit Errors and Packet Loss. In MobiCom, 2008.
[19]
C. Lott, O. Milenkovic, and E. Soljanin. Hybrid ARQ: theory, state of the art and future directions. In 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks, pages 1--5. IEEE, July 2007.
[20]
M. Luby. LT codes. In FOCS, 2003.
[21]
M. Luby, A. Shokrollahi, M. Watson, and T. Stockhammer. Raptor Forward Error Correction Scheme for Object Delivery. RFC 5053 (Proposed Standard), Oct. 2007.
[22]
R. Palanki and J. Yedidia. Rateless codes on noisy channels. In ISIT, 2005.
[23]
J. Perry, H. Balakrishnan, and D. Shah. Rateless spinal codes. In HotNets-X, Oct. 2011.
[24]
J. Perry, P. A. Iannucci, K. E. Fleming, H. Balakrishnan, and D. Shah. A rateless wireless communication system using spinal codes. In SIGCOMM, Aug. 2012. To appear.
[25]
S. Sen, N. Santhapuri, R. Choudhury, and S. Nelakuditi. AccuRate: Constellation-based rate estimation in wireless networks. NSDI, 2010.
[26]
A. Shokrollahi. Raptor codes. IEEE Trans. Info. Theory, 52(6), 2006.
[27]
E. Soljanin, N. Varnica, and P. Whiting. Incremental redundancy hybrid ARQ with LDPC and Raptor codes. IEEE Trans. Info. Theory, 2005.
[28]
M. Vutukuru, H. Balakrishnan, and K. Jamieson. Cross-Layer Wireless Bit Rate Adaptation. In SIGCOMM, 2009.
[29]
S. Wong, H. Yang, S. Lu, and V. Bharghavan. Robust Rate Adaptation for 802.11 Wireless Networks. In MobiCom, 2006.

Cited By

View all

Index Terms

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

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      Mobicom '12: Proceedings of the 18th annual international conference on Mobile computing and networking
      August 2012
      484 pages
      ISBN:9781450311595
      DOI:10.1145/2348543
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 22 August 2012

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. harq
      2. incremental redundancy
      3. link-layer
      4. protocol
      5. rateless
      6. wireless

      Qualifiers

      • Research-article

      Conference

      Mobicom'12
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 440 of 2,972 submissions, 15%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)10
      • Downloads (Last 6 weeks)1
      Reflects downloads up to 15 Sep 2024

      Other Metrics

      Citations

      Cited By

      View all

      View Options

      Get Access

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media