Data Gathering with Tunable Compression in Sensor Networks

Authors:
Yang Yu;Bhaskar Krishnamachari;Viktor K. Prasanna
Affiliations:
IEEE;IEEE;IEEE
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2008

Citing 0
Cited 13

An in-network reduction algorithm for real-time wireless sensor network applications

Proceedings of the 4th ACM workshop on Wireless multimedia networking and performance modeling
Adaptive In-Network Processing for Bandwidth and Energy Constrained Mission-Oriented Multi-hop Wireless Networks

DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
Optimal communication-computation tradeoff for wireless multimedia sensor network lifetime maximization

WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Energy-efficient data gathering in wireless sensor networks with asynchronous sampling

ACM Transactions on Sensor Networks (TOSN)
Maximizing lifetime of sensor-target surveillance in wireless sensor networks

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Optimal data compression and forwarding in wireless sensor networks

IEEE Communications Letters
A novel approach for trade-off between computation and communication cost in wireless sensor networks

ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
DPLC: dynamic packet length control in wireless sensor networks

INFOCOM'10 Proceedings of the 29th conference on Information communications
Communication/computation tradeoffs for prolonging network lifetime in wireless sensor networks: The case of digital signatures

Information Sciences: an International Journal
A survey of visual sensor network platforms

Multimedia Tools and Applications
A cross-layer framework for optimal delay-margin, network lifetime and utility tradeoff in wireless visual sensor networks

Ad Hoc Networks
A novel trade-off between communication and computation costs for data aggregation in wireless sensor networks

International Journal of Ad Hoc and Ubiquitous Computing
Prolonging wireless sensor network lifetime in stealth mode through intelligent data compression

Proceedings of the 10th ACM symposium on Performance evaluation of wireless ad hoc, sensor, & ubiquitous networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a set of source nodes to the sink. This problem is crucial for advanced computation-intensive applications, where traditional "maximum" in-network compression may result in significant computation energy. We investigate a tunable data compression technique that enables effective tradeoffs between the computation and communication costs. We derive the optimal compression strategy for a given data gathering tree and then investigate the performance of different tree structures for networks deployed on a grid topology as well as general graphs. Our analytical results pertaining to the grid topology and simulation results pertaining to the general graphs indicate that the performance of a simple greedy approximation to the Minimal Steiner Tree (MST) provides a constantfactor approximation for the grid topology and good average performance on the general graphs. Although theoretically, a more complicated randomized algorithm offers a poly-logarithmic performance bound, the simple greedy approximation of MST is attractive for practical implementation.