A data compression algorithm for wireless sensor networks based on an optimal order estimation model and distributed coding

6Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

In many wireless sensor network applications, the possibility of exceptions occurring is relatively small, so in a normal situation, data obtained at sequential time points by the same node are time correlated, while, spatial correlation may exist in data obtained at the same time by adjacent nodes. A great deal of node energy will be wasted if data which include time and space correlation is transmitted. Therefore, this paper proposes a data compression algorithm for wireless sensor networks based on optimal order estimation and distributed coding. Sinks can obtain correlation parameters based on optimal order estimation by exploring time and space redundancy included in data which is obtained by sensors. Then the sink restores all data based on time and space correlation parameters and only a little necessary data needs to be transmitted by nodes. Because of the decrease of redundancy, the average energy cost per node will be reduced and the life of the wireless sensor network will obviously be extended as a result. © 2010 by the authors; licensee MDPI, Basel, Switzerland.

Cite

CITATION STYLE

APA

Jiang, P., & Li, S. Q. (2010). A data compression algorithm for wireless sensor networks based on an optimal order estimation model and distributed coding. Sensors (Switzerland), 10(10), 9065–9083. https://doi.org/10.3390/s101009065

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free