Home > Research > Publications & Outputs > Adaptive hybrid compression for wireless sensor...

Links

Text available via DOI:

View graph of relations

Adaptive hybrid compression for wireless sensor networks

Research output: Contribution to journalJournal articlepeer-review

Published

Standard

Adaptive hybrid compression for wireless sensor networks. / Ali, A.; Khelil, A.; Suri, Neeraj; Mahmudimanesh, M.

In: ACM Transactions on Sensor Networks, Vol. 11, No. 4, 53, 01.12.2015.

Research output: Contribution to journalJournal articlepeer-review

Harvard

Ali, A, Khelil, A, Suri, N & Mahmudimanesh, M 2015, 'Adaptive hybrid compression for wireless sensor networks', ACM Transactions on Sensor Networks, vol. 11, no. 4, 53. https://doi.org/10.1145/2754932

APA

Ali, A., Khelil, A., Suri, N., & Mahmudimanesh, M. (2015). Adaptive hybrid compression for wireless sensor networks. ACM Transactions on Sensor Networks, 11(4), [53]. https://doi.org/10.1145/2754932

Vancouver

Ali A, Khelil A, Suri N, Mahmudimanesh M. Adaptive hybrid compression for wireless sensor networks. ACM Transactions on Sensor Networks. 2015 Dec 1;11(4). 53. https://doi.org/10.1145/2754932

Author

Ali, A. ; Khelil, A. ; Suri, Neeraj ; Mahmudimanesh, M. / Adaptive hybrid compression for wireless sensor networks. In: ACM Transactions on Sensor Networks. 2015 ; Vol. 11, No. 4.

Bibtex

@article{d6825683b9004037b73d3d3c8d59dbbd,
title = "Adaptive hybrid compression for wireless sensor networks",
abstract = "Wireless Sensor Networks (WSNs) are often deployed to sample the desired environmental attributes and deliver the acquired samples to a central station, termed as the sink, for processing as needed by the application. Many applications stipulate high granularity and data accuracy that results in high data volumes. However, sensor nodes are battery powered, and sending the requested large amounts of data rapidly depletes their energy. Fortunately, environmental attributes (e.g., temperature, pressure) often exhibit spatial and temporal correlations. Moreover, a large class of applications such as scientific analysis and simulations tolerate high latency for sensor data collection. Hence, we exploit the spatiotemporal correlation of sensor readings while benefiting from possible data delivery latency tolerance to minimize the amount of data to be transported to the sink. Accordingly, we develop a fully distributed adaptive hybrid compression scheme that exploits both spatial and temporal data redundancies and fuses both temporal and spatial compression for maximal data compression with accuracy guarantees. We present two main contributions: (i) an adaptive modeling technique that allows frugal and maximized temporal compression on resource-constraint sensor nodes by exploiting the data collection latency, and (ii) a novel model-based hierarchical clustering technique that allows for maximized spatial compression resulting into a hybrid compression scheme. Compared to the existing spatiotemporal compression approaches, our approach is fully decentralized and the proposed clustering scheme is based on sensor data models rather than instantaneous sensor data values, which allows merging nearby nodes with similar models into large clusters over a longer period of time rather than specific time instances. The analysis for computation and message overheads, the analysis for theoretical compressibility, and simulations using real-world data demonstrate that our proposed scheme can provide significant communication/energy savings without sacrificing the accuracy of collected data. {\textcopyright} 2015 ACM 1550-4859/2015/05-ART53 15.00.",
keywords = "Data analysis, Delay-tolerant networks, Model-based clustering, Spatiotemporal compression, Data acquisition, Data reduction, Delay tolerant networks, Sensor nodes, Wireless sensor networks, Data collection latencies, Environmental attributes, Hier-archical clustering, Spatial and temporal correlation, Spatio-temporal compressions, Spatiotemporal correlation, Wireless sensor network (WSNs), Data compression",
author = "A. Ali and A. Khelil and Neeraj Suri and M. Mahmudimanesh",
year = "2015",
month = dec,
day = "1",
doi = "10.1145/2754932",
language = "English",
volume = "11",
journal = "ACM Transactions on Sensor Networks",
issn = "1550-4859",
publisher = "Association for Computing Machinery (ACM)",
number = "4",

}

RIS

TY - JOUR

T1 - Adaptive hybrid compression for wireless sensor networks

AU - Ali, A.

AU - Khelil, A.

AU - Suri, Neeraj

AU - Mahmudimanesh, M.

PY - 2015/12/1

Y1 - 2015/12/1

N2 - Wireless Sensor Networks (WSNs) are often deployed to sample the desired environmental attributes and deliver the acquired samples to a central station, termed as the sink, for processing as needed by the application. Many applications stipulate high granularity and data accuracy that results in high data volumes. However, sensor nodes are battery powered, and sending the requested large amounts of data rapidly depletes their energy. Fortunately, environmental attributes (e.g., temperature, pressure) often exhibit spatial and temporal correlations. Moreover, a large class of applications such as scientific analysis and simulations tolerate high latency for sensor data collection. Hence, we exploit the spatiotemporal correlation of sensor readings while benefiting from possible data delivery latency tolerance to minimize the amount of data to be transported to the sink. Accordingly, we develop a fully distributed adaptive hybrid compression scheme that exploits both spatial and temporal data redundancies and fuses both temporal and spatial compression for maximal data compression with accuracy guarantees. We present two main contributions: (i) an adaptive modeling technique that allows frugal and maximized temporal compression on resource-constraint sensor nodes by exploiting the data collection latency, and (ii) a novel model-based hierarchical clustering technique that allows for maximized spatial compression resulting into a hybrid compression scheme. Compared to the existing spatiotemporal compression approaches, our approach is fully decentralized and the proposed clustering scheme is based on sensor data models rather than instantaneous sensor data values, which allows merging nearby nodes with similar models into large clusters over a longer period of time rather than specific time instances. The analysis for computation and message overheads, the analysis for theoretical compressibility, and simulations using real-world data demonstrate that our proposed scheme can provide significant communication/energy savings without sacrificing the accuracy of collected data. © 2015 ACM 1550-4859/2015/05-ART53 15.00.

AB - Wireless Sensor Networks (WSNs) are often deployed to sample the desired environmental attributes and deliver the acquired samples to a central station, termed as the sink, for processing as needed by the application. Many applications stipulate high granularity and data accuracy that results in high data volumes. However, sensor nodes are battery powered, and sending the requested large amounts of data rapidly depletes their energy. Fortunately, environmental attributes (e.g., temperature, pressure) often exhibit spatial and temporal correlations. Moreover, a large class of applications such as scientific analysis and simulations tolerate high latency for sensor data collection. Hence, we exploit the spatiotemporal correlation of sensor readings while benefiting from possible data delivery latency tolerance to minimize the amount of data to be transported to the sink. Accordingly, we develop a fully distributed adaptive hybrid compression scheme that exploits both spatial and temporal data redundancies and fuses both temporal and spatial compression for maximal data compression with accuracy guarantees. We present two main contributions: (i) an adaptive modeling technique that allows frugal and maximized temporal compression on resource-constraint sensor nodes by exploiting the data collection latency, and (ii) a novel model-based hierarchical clustering technique that allows for maximized spatial compression resulting into a hybrid compression scheme. Compared to the existing spatiotemporal compression approaches, our approach is fully decentralized and the proposed clustering scheme is based on sensor data models rather than instantaneous sensor data values, which allows merging nearby nodes with similar models into large clusters over a longer period of time rather than specific time instances. The analysis for computation and message overheads, the analysis for theoretical compressibility, and simulations using real-world data demonstrate that our proposed scheme can provide significant communication/energy savings without sacrificing the accuracy of collected data. © 2015 ACM 1550-4859/2015/05-ART53 15.00.

KW - Data analysis

KW - Delay-tolerant networks

KW - Model-based clustering

KW - Spatiotemporal compression

KW - Data acquisition

KW - Data reduction

KW - Delay tolerant networks

KW - Sensor nodes

KW - Wireless sensor networks

KW - Data collection latencies

KW - Environmental attributes

KW - Hier-archical clustering

KW - Spatial and temporal correlation

KW - Spatio-temporal compressions

KW - Spatiotemporal correlation

KW - Wireless sensor network (WSNs)

KW - Data compression

U2 - 10.1145/2754932

DO - 10.1145/2754932

M3 - Journal article

VL - 11

JO - ACM Transactions on Sensor Networks

JF - ACM Transactions on Sensor Networks

SN - 1550-4859

IS - 4

M1 - 53

ER -