Abstract
We compare the performance of standard data compression techniques in the presence of communication failures. Their performance is inferior to sending data without compression when the packet loss rate of a link is above 10%. We have developed fault-tolerant compression algorithms for sensor networks that are robust against packet loss and achieve low delays in data decoding, thus being particularly suitable for time-critical applications. We show the advantage of our technique by providing results from our extensive experimental evaluation using real sensor datasets.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aguayo, D., Bicket, J., Biswas, S., Judd, G., Morris, R.: Link-level measurements from an 802.11b mesh network. In: SIGCOMM, pp. 121–132 (2004)
Arici, T., Gedik, B., Altunbasak, Y., Liu, L.: Pinco: A pipelined in-network compression scheme for data collection in wireless sensor networks. In: ICCCN (2003)
Baek, S., de Veciana, G., Su, X.: Minimizing energy consumption in large-scale sensor networks through distributed data compression and hierarchical aggregation. Technical report, University of Texas (2004)
Barr, K., Asanovic, K.: Energy aware lossless data compression. In: MOBISYS (2003)
Cerpa, A., Busek, N., Estrin, D.: Scale: a tool for simple connectivity assessment in lossy environments. Tech report CENS-21, UCLA (2003)
Chen, M., Fowler, M.L.: Data compression trade-offs in sensor networks. In: SPIE (2004)
Chou, J., Petrovic, D., Ramchandran, K.: A distributed and adaptive signal processing approach to reducing energy consumption in sensor networks. In: INFOCOM (2003)
Elliot, E.O.: Estimates of error rates for codes on burst-noise channels. Bell Systems Technical Journal 42, 1977–1997 (1963)
Ganesan, D., Krishnamachari, B., Woo, A., Culler, D., Estrin, D., Wicker, S.: Complex behavior at scale: An experimental study of low-power wireless sensor networks. CSD-TR 02-0013, UCLA (February 2002)
Gilbert, E.N.: Capacity of a burst-noise channel. Bell Systems Technical Journal 39, 1252–1265 (1960)
Huffman, D.A.: A method for the construction of minimum redundancy codes. IRE 40, 1098–1101 (1952)
Kotz, D., Newport, C., Elliott, C.: The mistaken axioms of wireless-network research. Technical Report 467, Dartmouth College Computer Science (July 2003)
Pattem, S., Krishnmachari, B., Govindan, R.: The impact of spatial correlation on routing with compression in wireless sensor networks. In: IPSN (2004)
Pradhan, S., Kusuma, J., Ramchandran, K.: Distributed compression in a dense sensor network. IEEE Signal Processing Magazine (2002)
Puri, R., Ishwar, P., Pradhan, S.S., Ramchandran, K.: Rate-constrained robust estimation for unreliable sensor networks. In: AsilomarSSC, vol. 1, pp. 235–239 (2002)
Rachlin, Y., Negi, R., Khosla, P.: On the interdependence of sensing and estimation complexity in sensor networks. In: IPSN, pp. 160–167 (2006)
Sadler, C.M., Martonosi, M.: Data Compression Algorithms for Energy-Constrained Devices in Delay Tolerant Networks. In: SENSYS (November 2006)
Scaglione, A., Servetto, S.D.: On the interdependence of routing and data compression in multi-hop sensor networks. In: MOBICOM, pp. 140–147 (2002)
Slepian, D., Wolf, J.K.: Noiseless coding of correlated information sources. IEEE Trans. Inform. Theory IT-19, 471–480 (1973)
Trigoni, N., Guitton, A., Helmer, S.: Fault-tolerant compression algorithms for sensor networks with unreliable links. In: Technical Report BBKCS-08-01, Birkbeck, University of London (2008), http://www.dcs.bbk.ac.uk/research/techreps/2008/
Vitter, J.S.: Design and analysis of dynamic Huffman codes. J. ACM 34(4), 825–845 (1987)
Welch, T.A.: A technique for high-performance data compression. IEEE Computer 17(6), 8–19 (1984)
Xiao, J.-J., Ribeiro, A., Giannakis, G.B., Luo, Z.-Q.: Distributed compression-estimation using wireless sensor networks. IEEE Signal Processing Magazine 23(4), 27–41 (2006)
Zhao, J., Govindan, R.: Understanding packet delivery performance in dense wireless sensor networks. In: SENSYS, pp. 1–13 (2003)
Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transac. on Inf. Theory 23(3), 337–343 (1977)
Zorzi, M., Rao, R.R., Milstein, L.B.: On the accuracy of a first-order markov model for data transmission on fading channels. In: ICUPC, pp. 211–256 (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guitton, A., Trigoni, N., Helmer, S. (2008). Fault-Tolerant Compression Algorithms for Delay-Sensitive Sensor Networks with Unreliable Links. In: Nikoletseas, S.E., Chlebus, B.S., Johnson, D.B., Krishnamachari, B. (eds) Distributed Computing in Sensor Systems. DCOSS 2008. Lecture Notes in Computer Science, vol 5067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69170-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-69170-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69169-3
Online ISBN: 978-3-540-69170-9
eBook Packages: Computer ScienceComputer Science (R0)