A short note on the approximability of the maximum leaves spanning tree problem
Information Processing Letters
Combinatorial optimization
Introduction to algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
TAG: a Tiny AGgregation service for ad-hoc sensor networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Gathering correlated data in sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
A unified energy-efficient topology for unicast and broadcast
Proceedings of the 11th annual international conference on Mobile computing and networking
Proceedings of the 5th international conference on Information processing in sensor networks
Network correlated data gathering with explicit communication: NP-completeness and algorithms
IEEE/ACM Transactions on Networking (TON)
Efficient gathering of correlated data in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Rendezvous design algorithms for wireless sensor networks with a mobile base station
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Spatially-Localized Compressed Sensing and Routing in Multi-hop Sensor Networks
GSN '09 Proceedings of the 3rd International Conference on GeoSensor Networks
Compressive data gathering for large-scale wireless sensor networks
Proceedings of the 15th annual international conference on Mobile computing and networking
Compressive oversampling for robust data transmission in sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
CoSaMP: iterative signal recovery from incomplete and inaccurate samples
Communications of the ACM
IEEE/ACM Transactions on Networking (TON)
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
Noiseless coding of correlated information sources
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Duty-cycle-aware minimum-energy multicasting in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
We focus on wireless sensor networks (WSNs) that perform data collection with the objective of obtaining the whole dataset at the sink (as opposed to a function of the dataset). In this case, energy-efficient data collection requires the use of data aggregation. Whereas many data aggregation schemes have been investigated, they either compromise the fidelity of the recovered data or require complicated in-network compressions. In this paper, we propose a novel data aggregation scheme that exploits compressed sensing (CS) to achieve both recovery fidelity and energy efficiency in WSNs with arbitrary topology. We make use of diffusion wavelets to find a sparse basis that characterizes the spatial (and temporal) correlations well on arbitrary WSNs, which enables straightforward CS-based data aggregation as well as high-fidelity data recovery at the sink. Based on this scheme, we investigate the minimum-energy compressed data aggregation problem. We first prove its NP-completeness, and then propose a mixed integer programming formulation along with a greedy heuristic to solve it. We evaluate our scheme by extensive simulations on both real datasets and synthetic datasets. We demonstrate that our compressed data aggregation scheme is capable of delivering data to the sink with high fidelity while achieving significant energy saving.