Fast and quality-guaranteed data streaming in resource-constrained sensor networks

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 constant cost in space. Our algorithms are optimal in the sense they generate the minimum number of...

• Type: Conference
• Year: 2008
• Where: MOBIHOC
• Authors: Emad Soroush, Kui Wu, Jian Pei
• Keywords: Compress Data Streams, Data Streams, Linear Time Complexity, MOBIHOC 2008, Wireless Networks