Reading Damaged Scripts: Partial Packet Recovery Based on Compressive Sensing for Efficient Random Linear Coded Transmission

TY - JOUR

T1 - Reading Damaged Scripts: Partial Packet Recovery Based on Compressive Sensing for Efficient Random Linear Coded Transmission

AU - Mohammadi, Mohammad Sadegh

AU - Zhang, Qi

AU - Dutkiewicz, Eryk

PY - 2016/8

Y1 - 2016/8

N2 - Random linear coding (RLC) can improve the performance of multicast transmissions in terms of throughput and energy efficiency. However, RLC and linear codes in general cannot necessarily attain the optimal performance in arbitrary networks. In this regard, partial packet recovery can be considered as a nonlinear strategy to complement such approaches for more general networks. In this paper, we propose a partial packet recovery scheme that benefits from the sparsity of bit errors in partially corrupted RLC packets. As opposed to many previous schemes, it performs without introducing preliminary checksums or preambles, demanding physical layer soft information, or requesting post-redundancy from the transmitter. It relies only on algebraic coding and data processing techniques, the existing knowledge at the receiver, and the conventional acknowledgment messages in RLC. By reconstructing and utilizing the partially corrupted packets that are usually discarded, it can reduce the average number of transmitted RLC packets required for successful decoding by typically 50%, which improves throughput and energy efficiency at the transmitter. We formulate our partial packet recovery in the form of a sparse recovery problem, present its different solutions using compressive sensing theory, discuss their complexity, and present and evaluate a Markov chain model for its performance.

AB - Random linear coding (RLC) can improve the performance of multicast transmissions in terms of throughput and energy efficiency. However, RLC and linear codes in general cannot necessarily attain the optimal performance in arbitrary networks. In this regard, partial packet recovery can be considered as a nonlinear strategy to complement such approaches for more general networks. In this paper, we propose a partial packet recovery scheme that benefits from the sparsity of bit errors in partially corrupted RLC packets. As opposed to many previous schemes, it performs without introducing preliminary checksums or preambles, demanding physical layer soft information, or requesting post-redundancy from the transmitter. It relies only on algebraic coding and data processing techniques, the existing knowledge at the receiver, and the conventional acknowledgment messages in RLC. By reconstructing and utilizing the partially corrupted packets that are usually discarded, it can reduce the average number of transmitted RLC packets required for successful decoding by typically 50%, which improves throughput and energy efficiency at the transmitter. We formulate our partial packet recovery in the form of a sparse recovery problem, present its different solutions using compressive sensing theory, discuss their complexity, and present and evaluate a Markov chain model for its performance.

KW - Partial packet recovery

KW - compressive sensing

KW - efficient transmission

KW - random linear coding

UR - http://www.scopus.com/inward/record.url?scp=84985993752&partnerID=8YFLogxK

U2 - 10.1109/TCOMM.2016.2582487

DO - 10.1109/TCOMM.2016.2582487

M3 - Journal article

SN - 0090-6778

VL - 64

SP - 3296

EP - 3310

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

IS - 8

M1 - 7494948

ER -