We consider ad hoc sensor network topologies that aim for distributed delivery of correlated delay-sensitive
data. In order for efficient data delivery, network coding technique in conjunction with approximate decoding
algorithm is deployed. The approximate decoding algorithm enables receivers to recover the original source
data even when the number of received data packets is not sufficient for decoding. Therefore, it leads to
significantly improved decoding performance and enhanced robustness for delay-sensitive data. In this paper,
we further improve the approximate decoding algorithm by explicitly considering the characteristics of the
correlation. Specifically, we study the case where the source data are correlated by a simple linear correlation,
which is quantified by a similarity factor. We investigate several properties of the proposed algorithm and
analyze the impact of the similarity factor on the decoding performance. Our experimental results confirm
the properties of the proposed approximate decoding algorithm with linear correlation.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.