Compressive sensing optimization over ZigBee networks

Efficient data aggregation and compression in sensor networks is becoming fundamental with the increase of the number of nodes in the network. Although several data aggregation and compression techniques have been proposed in the literature only few of them can perform in-network compression and can extend lifetime without prior knowledge of the sensed data or without a central coordination. In this paper we consider a scenario where a wireless sensor network (WSN) exploits ZigBee protocols for smart building application. We study a classical gathering scheme and a distributed compressive sampling approach. We discuss limitations and we propose a new distributed mixed algorithm for in-network compression. With this algorithm each node takes a decision about which scheme to adopt aiming at the reducing the number of packets to transmit. We are interested in scalability of this new method and lifetime of the system with respect to the increase of network dimension. Simulations are performed using real data sets and results show that the use of this algorithm permits to obtain longer network lifetime with small computational complexity. The performances of the algorithm are also investigated when some sensor parameters are modified and sporadic readings rise in the network.

[1]  Sungwon Lee EE-Systems Compressed Sensing and Routing in Multi-Hop Networks , 2007 .

[2]  Margaret Martonosi,et al.  Data compression algorithms for energy-constrained devices in delay tolerant networks , 2006, SenSys '06.

[3]  R. Nowak,et al.  Compressed Sensing for Networked Data , 2008, IEEE Signal Processing Magazine.

[4]  Pramod K. Varshney,et al.  Data-aggregation techniques in sensor networks: a survey , 2006, IEEE Communications Surveys & Tutorials.

[5]  E.J. Candes Compressive Sampling , 2022 .

[6]  Jack K. Wolf,et al.  Noiseless coding of correlated information sources , 1973, IEEE Trans. Inf. Theory.

[7]  Jeffrey Stanford,et al.  Approximation Algorithm for Maximum Lifetime in Wireless Sensor Networks with Data Aggregation , 2006, Seventh ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD'06).

[8]  Richard G. Baraniuk,et al.  An Information-Theoretic Approach to Distributed Compressed Sensing ∗ , 2005 .

[9]  Ramesh Govindan,et al.  The impact of spatial correlation on routing with compression in wireless sensor networks , 2008, TOSN.

[10]  R. A. McDonald,et al.  Noiseless Coding of Correlated Information Sources , 1973 .

[11]  Jun Sun,et al.  Compressive data gathering for large-scale wireless sensor networks , 2009, MobiCom '09.

[12]  Kannan Ramchandran,et al.  Distributed compression in a dense microsensor network , 2002, IEEE Signal Process. Mag..

[13]  Francesco Marcelloni,et al.  A Simple Algorithm for Data Compression in Wireless Sensor Networks , 2008, IEEE Communications Letters.

[14]  Wei Wang,et al.  Distributed Sparse Random Projections for Refinable Approximation , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[15]  E.J. Candes,et al.  An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.

[16]  Michele Zorzi,et al.  On the interplay between routing and signal representation for Compressive Sensing in wireless sensor networks , 2009, 2009 Information Theory and Applications Workshop.