The Community for Technology Leaders
RSS Icon
Issue No.05 - May (2013 vol.25)
pp: 1042-1055
Yi Zhang , Duke University, Durham
Kristian Lum , UFRJ, Rio de Janeiro
Jun Yang , Duke University, Durham
Wireless sensor networks are widely used to continuously collect data from the environment. Because of energy constraints on battery-powered nodes, it is critical to minimize communication. Suppression has been proposed as a way to reduce communication by using predictive models to suppress reporting of predictable data. However, in the presence of communication failures, missing data are difficult to interpret because these could have been either suppressed or lost in transmission. There is no existing solution for handling failures for general, spatiotemporal suppression that uses cascading. While cascading further reduces communication, it makes failure handling difficult, because nodes can act on incomplete or incorrect information and in turn affect other nodes. We propose a cascaded suppression framework that exploits both temporal and spatial data correlation to reduce communication, and applies coding theory and Bayesian inference to recover missing data resulted from suppression and communication failures. Experiment results show that cascaded suppression significantly reduces communication cost and improves missing data recovery compared to existing approaches.
Base stations, Receivers, Correlation, Spatiotemporal phenomena, Predictive models, Vectors, Data models, coding theory, Spatiotemporal suppression, wireless sensor networks
Yi Zhang, Kristian Lum, Jun Yang, "Failure-Aware Cascaded Suppression in Wireless Sensor Networks", IEEE Transactions on Knowledge & Data Engineering, vol.25, no. 5, pp. 1042-1055, May 2013, doi:10.1109/TKDE.2012.26
[1] A. Mainwaring, D. Culler, J. Polastre, R. Szewczyk, and J. Anderson, "Wireless Sensor Networks for Habitat Monitoring," Proc. Int'l Workshop Wireless Sensor Networks and Applications (WSNA), 2002.
[2] G. Tolle et al., "A Macroscope in the Redwoods," Proc. Third Int'l Conf. Embedded Networked Sensor Systems (SenSys), 2005.
[3] D. Chu, A. Deshpande, J. Hellerstein, and W. Hong, "Approximate Data Collection in Sensor Networks Using Probabilistic Models," Proc. Int'l Conf. Data Eng. (ICDE), 2006.
[4] A. Silberstein, A. Gelfand, K. Munagala, G. Puggioni, and J. Yang, "Making Sense of Suppressions and Failures in Sensor Data: A Bayesian Approach," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2007.
[5] R. Johannesson and K.S. Zigangirov, Fundamentals of Convolutional Coding. Wiley-IEEE Press, 1999.
[6] S. Madden, M. Franklin, J. Hellerstein, and W. Hong, "TAG: A Tiny Aggregation Service for Ad-Hoc Sensor Networks," Proc. Fifth Ann. Symp. Operating Systems Design and Implementation (OSDI), 2002.
[7] A. Deshpande, C. Guestrin, S. Madden, J. Hellerstein, and W. Hong, "Model-Driven Data Acquisition in Sensor Networks," Proc. Int'l Conf. Very Large Data Bases (VLDB), 2004.
[8] D. Tulone and S. Madden, "PAQ: Time Series Forecasting for Approximate Query Answering in Sensor Networks," Proc. Third European Conf. Wireless Sensor Networks (EWSN), 2006.
[9] D. Slepian and J. Wolf, "Noiseless Coding of Correlated Information Sources," IEEE Trans. Information Theory, vol. IT-19, no. 4, pp. 471-480, July 1973.
[10] S. Pradhan, J. Kusuma, and K. Ramchandran, "Distributed Compression in a Dense Microsensor Network," IEEE Signal Processing Magazine, vol. 19, no. 2, pp. 51-60, Mar. 2002.
[11] Z. Xiong, A. Liveris, and S. Cheng, "Distributed Source Coding for Sensor Networks," IEEE Signal Processing Magazine, vol. 21, no. 5, pp. 80-94, Sept. 2004.
[12] A. Guitton, N. Trigoni, and S. Helmer, "Fault-Tolerant Compression Algorithms for Delay-Sensitive Sensor Networks with Unreliable Links," Proc. IEEE Int'l Conf. Distributed Computing in Sensor Systems (DCOSS), 2008.
[13] H. Yang and C.-W. Chung, "An Effective and Efficient Method for Handling Transmission Failures in Sensor Networks," Proc. Int'l Conf. Database Systems for Advanced Applications (DASFAA), 2009.
[14] A. Viterbi, "Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm," IEEE Trans. Information Theory, vol. IT-13, no. 2, pp. 260-269, Apr. 1967.
[15] R. Fano, "A Heuristic Discussion of Probabilistic Decoding," IEEE Trans. Information Theory, vol. IT-9, no. 2, pp. 64-74, Apr. 1963.
[16] A. Gelfand and A. Smith, "Sampling-Based Approaches to Calculating Marginal Densities," J. Am. Statistical Assoc., vol. 85, no. 410, pp. 398-409, 1990.
[17] S. Banerjee, B. Carlin, and A. Gelfand, Hierarchical Modeling and Analysis for Spatial Data. Chapman & Hall, 2004.
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool