z-logo
Premium
Error resilient data transport in sensor network applications: A generic perspective
Author(s) -
Agarwal Rachit,
Popovici Emanuel,
Sala Massimiliano,
O'Flynn Brendan
Publication year - 2009
Publication title -
international journal of circuit theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.364
H-Index - 52
eISSN - 1097-007X
pISSN - 0098-9886
DOI - 10.1002/cta.550
Subject(s) - computer science , interleaving , error detection and correction , wireless sensor network , network packet , algorithm , code (set theory) , code rate , computer engineering , real time computing , decoding methods , computer network , set (abstract data type) , programming language , operating system
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 (γ) 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 γ 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 © 2008 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here