Optimal and Efficient Algorithms for Projection-Based Compressive Data Gathering

  title={Optimal and Efficient Algorithms for Projection-Based Compressive Data Gathering},
  author={Dariush Ebrahimi and Chadi M. Assi},
  journal={IEEE Communications Letters},
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… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-10 of 14 extracted citations

On Jointly Constructing and Scheduling Multiple Forwarding Trees in Wireless Sensor Networks

2016 13th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON) • 2016
View 5 Excerpts


Publications referenced by this paper.
Showing 1-8 of 8 references

Distributed Sparse Random Projections for Refinable Approximation

2007 6th International Symposium on Information Processing in Sensor Networks • 2007
View 4 Excerpts
Highly Influenced

Compressed data aggregation for energy efficient wireless sensor networks

2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks • 2011
View 4 Excerpts
Highly Influenced

An Introduction To Compressive Sampling

IEEE Signal Processing Magazine • 2008
View 3 Excerpts
Highly Influenced

Compressed Sensing for Networked Data

IEEE Signal Processing Magazine • 2008
View 1 Excerpt

Similar Papers

Loading similar papers…