Fast and Quality-Guaranteed Data Streaming in Resource-Constrained Sensor Networks
Emad Soroush, Kui Wu, Jian Pei

TL;DR
This paper presents fast, online algorithms for data stream compression in resource-limited sensor networks, achieving quality guarantees with minimal computational and space resources, suitable for real-time applications.
Contribution
It introduces linear-time, constant-space online algorithms for quality-guaranteed data stream compression, optimized for resource-constrained sensor networks.
Findings
Algorithms are optimal in segment minimization.
Methods operate in linear time and constant space.
Validated on acoustic wireless sensor networks.
Abstract
In many emerging applications, data streams are monitored in a network environment. Due to limited communication bandwidth and other resource constraints, a critical and practical demand is to online compress data streams continuously with quality guarantee. Although many data compression and digital signal processing methods have been developed to reduce data volume, their super-linear time and more-than-constant space complexity prevents them from being applied directly on data streams, particularly over resource-constrained sensor networks. In this paper, we tackle the problem of online quality guaranteed compression of data streams using fast linear approximation (i.e., using line segments to approximate a time series). Technically, we address two versions of the problem which explore quality guarantees in different forms. We develop online algorithms with linear time complexity and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTime Series Analysis and Forecasting · Data Management and Algorithms · Data Stream Mining Techniques
