Sciweavers

Share
WD
2010

Measured performance of a memory-efficient segment-based packet-combining scheme

11 years 7 months ago
Measured performance of a memory-efficient segment-based packet-combining scheme
Abstract--Packet-combining schemes are an attractive improvement to ARQ schemes, since they allow receivers to keep the good parts of an otherwise erroneous packet and use these with good parts from subsequent packets to allow for quicker decoding. In the previous paper [1] a memory-efficient hard-decision packet combining scheme has been described and analysed, which relies on intermediate checksums spread into the user data part of a packet. In this paper we provide experimental data on the performance of the proposed packet-combining scheme, showing that a significant percentage of the wireless links found in a large indoor wireless testbed (the TKN TWIST testbed [2]) indeed benefits from introducing such a packet-combining scheme.
Danil Kipnis, Tobias Jacob, Andreas Willig
Added 15 Feb 2011
Updated 15 Feb 2011
Type Journal
Year 2010
Where WD
Authors Danil Kipnis, Tobias Jacob, Andreas Willig
Comments (0)
books