Memory-efficient segment-based packet-combining schemes in face of deadlines

  • Authors:
  • Andreas Willig

  • Affiliations:
  • Technische Universität Berlin

  • Venue:
  • Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we consider segment-based hard-decision packet-combining schemes. The schemes presented here are memory-efficient and easy to implement, and some of them appproach the performance of majority-voting schemes without having the same memory requirements. One particularly interesting scheme combines segment-based transmission with Luby-type erasure codes.