2010
DOI: 10.1093/comjnl/bxp128
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive Linear Filtering Compression on Realtime Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(11 citation statements)
references
References 27 publications
0
11
0
Order By: Relevance
“…The presented system design and deployment experience clears the doubts of domain scientists and proves that the low-cost sensor network system can work in extremely harsh environments. Our next plan is to integrate a localized TDMA MAC protocol [25] and light-weighted compression algorithm [16], and deploy a larger scale sensor network with multiple sinks and multiple channels for real-time volcano monitoring in summer/fall 2009.…”
Section: Conclusion and Future Plansmentioning
confidence: 99%
“…The presented system design and deployment experience clears the doubts of domain scientists and proves that the low-cost sensor network system can work in extremely harsh environments. Our next plan is to integrate a localized TDMA MAC protocol [25] and light-weighted compression algorithm [16], and deploy a larger scale sensor network with multiple sinks and multiple channels for real-time volcano monitoring in summer/fall 2009.…”
Section: Conclusion and Future Plansmentioning
confidence: 99%
“…However, WSNs are generally deployed with the purpose of monitoring a particular phenomenon of interest [12]. Therefore, we show that, if the statistics of this phenomenon are known beforehand from general datasets, and if the data collected by the sensor nodes presents relatively low resolution, by employing simple Huffman encoding, it is possible to achieve compression ratios higher than those obtained by state-of-the-art algorithms such as those presented in [24]. More specifically, we show that by constructing a fixed Huffman dictionary to encode the differences between two consecutive samples from a large general dataset, the compression ratio obtained on test datasets of the same phenomenon at different locations and periods is very close to what would be achieved if a specific dictionary was constructed for each test dataset.…”
Section: Introductionmentioning
confidence: 93%
“…In this work, however, we consider approaches that attempt to achieve efficient lossless data compression by leveraging solely on the temporal correlation of the data collected by each sensor node and performing all the computations locally, without relying on information from other nodes. Two of the most recent and effective approaches in this category are Marcelloni and Vecchio's lossless entropy compression (LEC) [2, 3] and Kiely et al's adaptive linear filtering compression (ALFC) [4].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Data compression is an important and efficient approach to maximize data return over the unreliable and low rate radio links [26][27][28]. We have developed a lightweight compression scheme for sensor networks, called Adaptive Linear Filtering Compression (ALFC) [12]. ALFC performs predictive compression, using adaptive linear filtering to predict sample values followed by entropy coding of prediction residuals, encoding a variable number of samples into fixed-length packets.…”
Section: Configurable Data Processing Tasksmentioning
confidence: 99%