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

IEEE Transactions on Industrial Informatics

Volumn 5, Issue 3, 2009, Pages 338-350

  Willig, Andreas ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Deadline constraints; Hard decision packet combining; Memory efficiency; Stochastic markov modeling

Indexed keywords

COMBINING SCHEMES; DEADLINE CONSTRAINTS; HARD-DECISION PACKET COMBINING; MEMORY REQUIREMENTS; MEMORY-EFFICIENCY; SEGMENT-BASED; STOCHASTIC/MARKOV MODELING; TYPE ERASURE; VOTING SCHEMES;

EID: 69249212151     PISSN: 15513203     EISSN: None     Source Type: Journal    
DOI: 10.1109/TII.2009.2024936     Document Type: Article

References (20)

1. A. Willig, K. Matheus, and A. Wolisz, "Wireless technology in industrial networks," Proc. IEEE, vol.93, pp. 1130-1151, Jun. 2005.
2. H. Liu, H. Ma, M. E. Zarki, and S. Gupta, "Error control schemes for networks: An overview," MONET-Mobile Networks and Applications, vol.2, no.2, pp. 167-182, 1997.
3. S. Kallel, "Analysis of a type-II hybrid ARQ scheme with code combining," IEEE Trans. Commun., vol.38, no.8, pp. 1133-1137, Aug. 1990.
4. S. Kallel, " Complementary punctured convolutional (cpc) codes and their applications," IEEE Trans. Commun., vol.43, no.6, pp. 2005-2009, Jun. 1995.
5. M. G.Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inf. Theory, vol.47, no.2, pp. 569-584, Feb. 2001.
6. D. V. Sarwate, "Computation of cyclic redundancy checks via table look-up," Commun.ACM, vol.31, no.8, pp. 1008-1013, Aug. 1988.
7. A. Willig, "Memory-efficient segment-based packet-combining schemes in face of deadlines," in Proc. 5th Int. Wireless Commun. Mobile Comput. Conf. (IWCMC'09), Leipzig, Germany, 2009.
8. A. Willig, "Memory-efficient segment-based packet-combining schemes in face of deadlines (extended version)," Telecommunication Networks Group, Technical University Berlin, Berlin, Germany, TKN Tech. Rep. Series TKN-09-1001, 2009.
9. J. R. Norris, Markov Chains. Cambridge, UK: Cambridge Univ. Press, 1997.
10. A. Willig, "Intermediate checksum schemes in the presence of deadlines," Telecommunication Networks Group, Technical University Berlin, Berlin, Germany, TKN Tech. Rep. Series TKN-08-1002, 2008.
11. J. Banks, J. S. Carson, B. L. Nelson, and D. M. Nicol, Discrete-Event System Simulation, 3rd ed. Upper Saddle River, NJ: Prentice-Hall, 2000.
12. P. S. Sindhu, "Retransmission error control with memory," IEEE Trans. Commun., vol.25, no.5, pp. 473-479, May 1977.
13. A.-G. A. Dairaseh and C. W. Baum, "Methods for packet combining in HARQ systems over bursty channels," MONET-Mobile Networks and Applications, vol.2, pp. 213-224, Oct. 1997.
14. B. A. Harvey and S. B. Wicker, "Packet combining systems based on the Viterbi decoder," IEEE Trans. Commun., vol.42, no.2, pp. 1544-1557, Feb. 1994.
15. S. B. Wicker,"Adaptive rate error control through the use of diversity combining and majority-logic decoding in a hybrid-ARQ protocol," IEEE Trans. Commun., vol.39, no.3, pp. 380-385, Mar. 1991.
16. A. Willig, "Intermediate checksums for improving goodput over error-prone links," in Proc. IEEE Veh. Technol. Conf. (VTC), Fall 04, Los Angeles, CA, Sep. 2004.
17. P. Lettieri and M. Srivastava, "Adaptive frame length control for improving wireless link throughput, range and energy efficiency," in Proc. INFOCOM 1998., San Francisco, CA, 1998, pp. 564-571.
18. R. K. Ganti, P. Jayachandran, H. Luo, and T. F. Abdelzaher, "Datalink streaming in wireless sensor networks," in Proc. 4th Int. Conf. Embedded Networked Sensor Syst. (ACM SenSys), 2006, pp. 209-222.
19. H. Dubois-Ferriere, D. Estrin, and M. Vetterli, "Packet combining in sensor networks," in Proc. 3rd Int. Conf. Embedded Networked Sensor Syst. (SenSys), San Diego, CA, Nov. 2005.
20. Y. Zhou and J. Wang, "Optimum subpacket transmission for hybrid ARQ systems, " IEEE Trans. Commun., vol.54, no.5, pp. 934-942, 2006.