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

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.

REFERENCES

• 1: Henri Dubois-Ferrière , Deborah Estrin , Martin Vetterli, Packet combining in sensor networks, Proceedings of the 3rd international conference on Embedded networked sensor systems, November 02-04, 2005, San Diego, California, USA [doi>10.1145/1098918.1098930]
• 2: Raghu K. Ganti , Praveen Jayachandran , Haiyun Luo , Tarek F. Abdelzaher, Datalink streaming in wireless sensor networks, Proceedings of the 4th international conference on Embedded networked sensor systems, October 31-November 03, 2006, Boulder, Colorado, USA [doi>10.1145/1182807.1182829]
• 3: B. A. Harvey and S. B. Wicker. Packet combining systems based on the Viterbi decoder. IEEE Trans. on Communications, 42(2):1544--1557, Feb. 1994.
• 4: S. Kallel. Analysis of a type-II hybrid ARQ scheme with code combining. IEEE Trans. on Communications, 38(8):1133--1137, Aug. 1990.
• 5: P. Lettieri and M. Srivastava. Adaptive frame length control for improving wireless link throughput, range and energy efficiency. In Proc. INFOCOM 1998, pages 564--571, San Francisco, CA, 1998. IEEE.
• 6: Hang Liu , Hairuo Ma , Magda El Zarki , Sanjay Gupta, Error control schemes for networks: an overview, Mobile Networks and Applications, v.2 n.2, p.167-182, Oct. 1997 [doi>10.1023/A:1013676531988]
• 7: M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman. Efficient erasure correcting codes. IEEE Trans. on Information Theory, 47(2):569--584, Feb. 2001.
• 8: J. R. Norris. Markov Chains. Cambridge University Press, Cambridge, UK, 1997.
• 9: S. B. Wicker. Adaptive rate error control through the use of diversity combining and majority-logic decoding in a hybrid-arq protocol. IEEE Trans. on Communications, 39(3):380--385, Mar. 1991.
• 10: A. Willig. Intermediate Checksums for Improving Goodput over Error-Prone Links. In Proc. IEEE Vehicular Technology Conference (VTC), Fall 04, Los Angeles, CA, Sept. 2004.
• 11: A. Willig. Intermediate checksum schemes in the presence of deadlines. TKN Technical Report Series TKN-08-002, Telecommunication Networks Group, Technical University Berlin, Jan. 2008.
• 12: A. Willig. Simulative investigation of intermediate checksum schemes in the presence of deadlines. In Proc. 13th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2008, Hamburg, Germany, Sept. 2008.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.2 Network Protocols

Additional Classification:
  C. Computer Systems Organization
  C.4 PERFORMANCE OF SYSTEMS

General Terms:
Performance

Keywords:
deadline constraints, hard-decision packet combining, memory-efficiency, stochastic/Markov modeling