Optimal and Efficient Algorithms for Projection-Based Compressive Data Gathering
Authors:
- 2 July 2013
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 17 (8) , 1572-1575
Abstract
We investigate the problem of compressive data aggregation in wireless sensor networks. We propose a data gathering scheme using Compressive Sensing (CS) by building up data aggregation trees from sensor nodes to the sink. Our problem aims at minimizing the number of links in the trees to minimize the number of overall transmissions. We formulate the problem of constructing aggregation trees for forwarding the compressed data to the sink as a mixed integer linear program (MILP) and present efficient algorithms to solve the problem. We show that our algorithms have outstanding performance and order of magnitude faster than the optimal model.Keywords
This publication has 6 references indexed in Scilit:
- Data gathering in wireless sensor networks through intelligent compressive sensing2012
- Compressed data aggregation for energy efficient wireless sensor networks2011
- Compressive data gathering for large-scale wireless sensor networks2009
- Compressed Sensing for Networked DataIEEE Signal Processing Magazine, 2008
- An Introduction To Compressive SamplingIEEE Signal Processing Magazine, 2008
- Efficient gathering of correlated data in sensor networksACM Transactions on Sensor Networks, 2008