2016 International Conference on Distributed Computing in Sensor Systems (DCOSS) 2016
DOI: 10.1109/dcoss.2016.37
|View full text |Cite
|
Sign up to set email alerts
|

Tree-Structured Linear Approximation for Data Compression over WSNs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…Some methods are very simple based on constant approximation and some methods are slightly more complex [4]. Very simple methods suitable for constrained sensor nodes in PSNs are for example Piecewise Constant Approximation (PCA), Adaptive Piecewise Constant Approximation (APCA), Poor man's compression and Piecewise Linear Histogram (PWLH) [6][7][8] [9][10] [11]. These methods are so called model-based methods [1].…”
Section: Linearity Based Compression Algorithms and Their Suitabimentioning
confidence: 99%
“…Some methods are very simple based on constant approximation and some methods are slightly more complex [4]. Very simple methods suitable for constrained sensor nodes in PSNs are for example Piecewise Constant Approximation (PCA), Adaptive Piecewise Constant Approximation (APCA), Poor man's compression and Piecewise Linear Histogram (PWLH) [6][7][8] [9][10] [11]. These methods are so called model-based methods [1].…”
Section: Linearity Based Compression Algorithms and Their Suitabimentioning
confidence: 99%