The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Data compression algorithms for energy-constrained devices in delay tolerant networks
Abstract
Sensor networks are fundamentally constrained by the difficulty and energy expense of delivering information from sensors to sink. Our work has focused on garnering additional significant energy improvements by devising computationally-efficient lossless compression algorithms on the source node. These reduce the amount of data that must be passed through the network and to the sink, and thus have energy benefits that are multiplicative with the number of hops the data travels through the network.Currently, if sensor system designers want to compress acquired data, they must either develop application-specific compression algorithms or use off-the-shelf algorithms not designed for resource-constrained sensor nodes. This paper discusses the design issues involved with implementing, adapting, and customizing compression algorithms specifically geared for sensor nodes. While developing Sensor LZW (S-LZW) and some simple, but effective, variations to this algorithm, we show how different amounts of compression can lead to energy savings on both the compressing node and throughout the network and that the savings depends heavily on the radio hardware. To validate and evaluate our work, we apply it to datasets from several different real-world deployments and show that our approaches can reduce energy consumption by up to a factor of 4.5X across the network.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Method for the Construction of Minimum-Redundancy Codes
Huffman, D. (1952) · Proceedings of the IRE · doi:10.1109/jrproc.1952.273898 · Cited by 6,334
A universal algorithm for sequential data compression
Ziv, J., & Lempel, A. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055714 · Cited by 5,456
Directed diffusion: a scalable and robust communication paradigm for sensor networks
Intanagonwiwat, C., Govindan, R., & Estrin, D. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345920 · Cited by 5,393
Epidemic routing for partially-connected ad hoc networks
Vahdat, A. M. (2000) · Cited by 4,624
A delay-tolerant network architecture for challenged internets
Fall, K. (2003) · Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/863955.863960 · Cited by 3,082
Arithmetic coding for data compression
Witten, I. H., Neal, R. M., & Cleary, J. G. (1987) · Communications of the ACM · doi:10.1145/214762.214771 · Cited by 2,877
A Block-sorting Lossless Data Compression Algorithm
Burrows, M. T., & Wheeler, D. J. (1994) · Cited by 2,333
A Technique for High-Performance Data Compression
Welch (1984) · Computer · doi:10.1109/mc.1984.1659158 · Cited by 2,182
Data Compression Using Adaptive Coding and Partial String Matching
Cleary, J., & Witten, I. (1984) · IEEE Transactions on Communications · doi:10.1109/tcom.1984.1096090 · Cited by 1,241
Simulating the power consumption of large-scale sensor network applications
Shnayder, V., Hempstead, M., Chen, B.-R., Allen, G. W., & Welsh, M. (2004) · ACM Conference on Embedded Networked Sensor Systems (SenSys) · doi:10.1145/1031495.1031518 · Cited by 1,109
Bell, T., Cleary, J. G., & Witten, I. H. (1990) · Cited by 988
An analysis of a large scale habitat monitoring application
Szewczyk, R., Mainwaring, A., Polastre, J., Anderson, J., & Culler, D. (2004) · Proceedings of the 2nd international conference on Embedded networked sensor systems · doi:10.1145/1031495.1031521 · Cited by 978
Data compression via textual substitution
Storer, J. A., & Szymanski, T. G. (1982) · Journal of the ACM · doi:10.1145/322344.322346 · Cited by 634
Distributed compression in a dense microsensor network
Pradhan, S. S., Kusuma, J., & Ramchandran, K. (2002) · IEEE Signal Processing Magazine · doi:10.1109/79.985684 · Cited by 537
Hardware design experiences in ZebraNet
Zhang, P., Sadler, C. M., Lyon, S. A., & Martonosi, M. (2004) · Proceedings of the 2nd international conference on Embedded networked sensor systems · doi:10.1145/1031495.1031522 · Cited by 519
Self-citationThe impact of spatial correlation on routing with compression in wireless sensor networks
Pattem, S., Krishnamachari, B., & Govindan, R. (2008) · ACM Transactions on Sensor Networks · doi:10.1145/1387663.1387670 · Cited by 492
Energy-aware lossless data compression
Barr, K. C., & Asanović, K. (2006) · ACM Transactions on Computer Systems · doi:10.1145/1151690.1151692 · Cited by 346
On the interdependence of routing and data compression in multi-hop sensor networks
Scaglione, A., & Servetto, S. D. (2002) · Proceedings of the 8th annual international conference on Mobile computing and networking · doi:10.1145/570645.570663 · Cited by 243
An evaluation of multi-resolution storage for sensor networks
Ganesan, D., Greenstein, B., Perelyubskiy, D., Estrin, D., & Heidemann, J. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958502 · Cited by 202
Energy aware lossless data compression
Barr, K., & Asanović, K. (2003) · Proceedings of the 1st international conference on Mobile systems, applications and services · doi:10.1145/1066116.1066123 · Cited by 180
Fundamentals of energy-constrained sensor network systems
Sadler, B. M. (2005) · IEEE Aerospace and Electronic Systems Magazine · doi:10.1109/maes.2005.1499273 · Cited by 138
Data compression with the Burrows-Wheeler Transform
Nelson, M. (1996) · Cited by 71
Cited by
Wearable and implantable wireless sensor network solutions for healthcare monitoring
Darwish, A., & Hassanien, A. E. (2011) · Sensors · doi:10.3390/s110605561 · Cited by 556
Predicting link quality using supervised learning in wireless sensor networks
Wang, Y., Martonosi, M., & Peh, L.-S. (2007) · ACM SIGMOBILE Mobile Computing and Communications Review · doi:10.1145/1317425.1317434 · Cited by 101
“Even with in-network processing techniques, such as data aggregation [6, 7], compression [ 8 ] and coding [9], the expected data rate is still very challenging for current systems to cope with.”
Self-citation
Metadata
- Authors
- Sadler, C. M., & Martonosi, M.
- Venue
- Proceedings of the 4th international conference on Embedded networked sensor systems
- Publisher
- ACM
- Published
- 2006-10-31
- Pages
- 265-278
- OpenAlex
- W2107106521
- Cited by
- 418
- References
- 22
- FWCI
- 16.55
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.