Error Resilient Data Transport In Sensor Network Applications: A Generic Perspective

Typeset version

 

TY  - JOUR
  - Agarwal, R, Popovici, E, Sala, M, O'Flynn, B
  - 2009
  - March
  - International Journal of Circuit Theory and Applications
  - Error Resilient Data Transport In Sensor Network Applications: A Generic Perspective
  - Validated
  - ()
  - 37
  - 2
  - 377
  - 396
  - The error recovery problem in wireless sensor networks is studied from a generic resource-constrained energy-optimization perspective. To characterize the features of error recovery schemes that suit the majority of applications, an energy model is developed and inferences are drawn based on a suitable performance metric. For applications that require error control coding, an efficient scheme is proposed based on an interesting observation related to shortened Reed-Solomon (RS) codes for packet reliability. It is shown that multiple instances (gamma) of RS codes defined on a smaller alphabet combined with interleaving results in smaller resource usage, while the performance exceeds the benefits of a shortened RS code defined over a larger alphabet. In particular, the proposed scheme can have an error correction capability of up to gamma times larger than that of the conventional RS scheme without changing the rate of the code with much lower power, timing and memory requirements. Implementation results show that such a scheme is 43% more power efficient compared with the RS scheme with the same code rate. Besides, such an approach results in 46% faster computations and 53% reduction in memory requirements. Copyright (C) 2008 John Wiley ; Sons, Ltd..
  - DOI 10.1002/cta.550
DA  - 2009/03
ER  - 
@article{V721418,
   = {Agarwal,  R and  Popovici,  E and  Sala,  M and  O'Flynn,  B },
   = {2009},
   = {March},
   = {International Journal of Circuit Theory and Applications},
   = {Error Resilient Data Transport In Sensor Network Applications: A Generic Perspective},
   = {Validated},
   = {()},
   = {37},
   = {2},
  pages = {377--396},
   = {{The error recovery problem in wireless sensor networks is studied from a generic resource-constrained energy-optimization perspective. To characterize the features of error recovery schemes that suit the majority of applications, an energy model is developed and inferences are drawn based on a suitable performance metric. For applications that require error control coding, an efficient scheme is proposed based on an interesting observation related to shortened Reed-Solomon (RS) codes for packet reliability. It is shown that multiple instances (gamma) of RS codes defined on a smaller alphabet combined with interleaving results in smaller resource usage, while the performance exceeds the benefits of a shortened RS code defined over a larger alphabet. In particular, the proposed scheme can have an error correction capability of up to gamma times larger than that of the conventional RS scheme without changing the rate of the code with much lower power, timing and memory requirements. Implementation results show that such a scheme is 43% more power efficient compared with the RS scheme with the same code rate. Besides, such an approach results in 46% faster computations and 53% reduction in memory requirements. Copyright (C) 2008 John Wiley ; Sons, Ltd..}},
   = {DOI 10.1002/cta.550},
  source = {IRIS}
}
AUTHORSAgarwal, R, Popovici, E, Sala, M, O'Flynn, B
YEAR2009
MONTHMarch
JOURNAL_CODEInternational Journal of Circuit Theory and Applications
TITLEError Resilient Data Transport In Sensor Network Applications: A Generic Perspective
STATUSValidated
TIMES_CITED()
SEARCH_KEYWORD
VOLUME37
ISSUE2
START_PAGE377
END_PAGE396
ABSTRACTThe error recovery problem in wireless sensor networks is studied from a generic resource-constrained energy-optimization perspective. To characterize the features of error recovery schemes that suit the majority of applications, an energy model is developed and inferences are drawn based on a suitable performance metric. For applications that require error control coding, an efficient scheme is proposed based on an interesting observation related to shortened Reed-Solomon (RS) codes for packet reliability. It is shown that multiple instances (gamma) of RS codes defined on a smaller alphabet combined with interleaving results in smaller resource usage, while the performance exceeds the benefits of a shortened RS code defined over a larger alphabet. In particular, the proposed scheme can have an error correction capability of up to gamma times larger than that of the conventional RS scheme without changing the rate of the code with much lower power, timing and memory requirements. Implementation results show that such a scheme is 43% more power efficient compared with the RS scheme with the same code rate. Besides, such an approach results in 46% faster computations and 53% reduction in memory requirements. Copyright (C) 2008 John Wiley ; Sons, Ltd..
PUBLISHER_LOCATION
ISBN_ISSN
EDITION
URL
DOI_LINKDOI 10.1002/cta.550
FUNDING_BODY
GRANT_DETAILS