Asynchronous Sampling Benefits Wireless Sensor Networks

Intensive research has focused on redundance reduction in wireless sensor networks among sensory data due to the spatial and temporal correlation embedded therein. In this paper, we propose a novel approach termed asynchronous sampling that complements existing study. The key idea of asynchronous sampling is to spread the sampling times of the sensor nodes over the time line instead of performing them in a synchronous manner. Compared with existing strategies, asynchronous sampling introduces another dimension for optimization, without additional computation or communication overhead on sensor nodes. Theoretically, we show that asynchronous sampling benefits sensor networks through increased entropy of the sensory data or reduced reconstruction distortion. Furthermore, we formulate the optimal asynchronous sampling problem for determining the time shifts among the nodes. A heuristic solution, termed O-ASYN, is presented that uses local optimum search to approximate the global optimal solution. Simulation results based on simulated data and real experimental data both demonstrate the entropy increases.

[1]  Cauligi S. Raghavendra,et al.  Correlation analysis and applications in wireless microsensor networks , 2004, The First Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services, 2004. MOBIQUITOUS 2004..

[2]  Saurabh Ganeriwal,et al.  Aggregation in sensor networks: an energy-accuracy trade-off , 2003, Ad Hoc Networks.

[3]  Baochun Li,et al.  Distributed Data Gathering in Multi-sink Sensor Networks with Correlated Sources , 2006, Networking.

[4]  R. Nowak,et al.  Backcasting: adaptive sampling for sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[5]  Lui Sha,et al.  Optimal real-time sampling rate assignment for wireless sensor networks , 2006, TOSN.

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

[7]  Brahim Bensaou,et al.  Tradeoff between network lifetime and fair rate allocation in wireless sensor networks with multi-path routing , 2006, MSWiM '06.

[8]  Chieh-Yih Wan,et al.  CODA: congestion detection and avoidance in sensor networks , 2003, SenSys '03.

[9]  C. Guestrin,et al.  Distributed regression: an efficient framework for modeling sensor network data , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[10]  Alan M. Frieze,et al.  A new rounding procedure for the assignment problem with applications to dense graph arrangement problems , 2002, Math. Program..

[11]  David Mackay,et al.  Gaussian Processes - A Replacement for Supervised Neural Networks? , 1997 .

[12]  Konstantinos Psounis,et al.  Modeling spatially correlated data in sensor networks , 2006, TOSN.

[13]  P. Diggle,et al.  Model‐based geostatistics , 2007 .

[14]  Andreas Krause,et al.  Near-optimal sensor placements in Gaussian processes , 2005, ICML.

[15]  Ramesh Govindan,et al.  RCRT: rate-controlled reliable transport for wireless sensor networks , 2007, SenSys '07.

[16]  J. Chou,et al.  Tracking and exploiting correlations in dense sensor networks , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..

[17]  Robert Nowak,et al.  Distributed optimization in sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[18]  Konstantinos Psounis,et al.  Modeling spatially-correlated sensor network data , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[19]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[20]  Mehul Motani,et al.  Exploiting wireless broadcast in spatially correlated sensor networks , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.