Frame Fountain: Coding and decoding MAC frames

To address the large latency and degraded network throughput due to the retransmission triggered by frame loss in high speed wireless networks, this paper proposes a solution called Frame Fountain that encodes and decodes data frames in the MAC layer. This solution intelligently encodes a number of redundant frames from original frames upon link loss rate so that a receiver can effectively recover lost original frames without significant retransmissions. Meanwhile, various probability distributions are investigated to find an optimal one as the degree distribution adopted by this coding solution. Extensive experiments show that, working with a degree distribution improved upon the robust Soliton distribution, Frame Fountain can recover most of the original frames with large probability.

[1]  Muriel Médard,et al.  XORs in the Air: Practical Wireless Network Coding , 2006, IEEE/ACM Transactions on Networking.

[2]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[3]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

[4]  Xuemin Chen,et al.  Error-Control Coding for Data Networks , 1999 .

[5]  G. Ungerboeck,et al.  Trellis-coded modulation with redundant signal sets Part I: Introduction , 1987, IEEE Communications Magazine.

[6]  Peter Elias,et al.  List decoding for noisy channels , 1957 .

[7]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[8]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[9]  Fred Daneshgaran,et al.  High-rate recursive convolutional codes for concatenated channel codes , 2004, IEEE Transactions on Communications.

[10]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[11]  Richard W. Hamming,et al.  Error detecting and error correcting codes , 1950 .

[12]  Andrew J. Viterbi,et al.  Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[13]  Andrew J. Viterbi,et al.  Very Low Rate Convolutional Codes for Maximum Theoretical Performance of Spread-Spectrum Multiple-Access Channels , 1990, IEEE J. Sel. Areas Commun..