Wei Wang
ABSTRACT
We propose random distributed multiresolution representations of sensor network data, so that the most significant encoding coefficients are easily accessible by querying a few sensors, anywhere in the network. Less significant encoding coefficients are available by querying a larger number of sensors, local to the region of interest. Significance can be defined in a multiresolution way, without any prior knowledge of the source data, as global summaries versus local details. Alternatively, significance can be defined in a data-adaptive way, as large differences between neighboring data values. We propose a distributed encoding algorithm that is robust to arbitrary wireless communication connectivity graphs, where links can fail or change with time. This randomized algorithm allows distributed computation that does not require strict global coordination or awareness of network connectivity at individual sensors. Because computations involve sensors in local neighborhoods of the communication graph, they are communication-efficient. Our framework uses local interaction among sensors to enable flexible information retrieval at the global level.
- L. Xiao, S. Boyd, and S. Lall. A Scheme for Robust Distributed Sensor Fusion Based on Average Consensus. Proceedings of the 4th International Symposium on Information Processing in Sensor Networks (IPSN), 2005. Google Scholar
Digital Library
- D.S. Scherber and H.C. Papadopoulos. Locally Constructed algorithms for Distributed Computations in Ad-hoc Networks. Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks, 2004.D.S. Scherber and H.C. Papadopoulos. Locally Constructed algorithms for Distributed Computations in Ad-hoc Networks. Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks, 2004. Google ScholarDigital Library
- V. Saligrama, M. Alanyali, and O. Savas. Asynchronous Distributed Detection in Sensor Networks. submitted to IEEE Transactions on Signal Processing, 2005.Google Scholar
- M. Alanyali, S. Venkatesh, O. Savas, and S. Aeron. Distributed Bayesian Hypothesis Testing in Sensor Networks. Proceedings of American Control Conference, 2004.Google ScholarCross Ref
- R.A. Horn and C.R. Johnson. Matrix Analysis. Cambridge University Press, New York, NY, 1985. Google ScholarDigital Library
- M. Vetterli and J. Kovačević. Wavelets and Subband Coding. Prentice Hall, Englewood Cliffs, NJ, 1995. Google ScholarDigital Library
- S. Mallat. A Wavelet Tour of Signal Processing. Academic Press, San Diego, CA, 1999.Google ScholarDigital Library
- A. Giridhar and P.R. Kumar. Computing and Communicating Functions Over Sensor Networks. IEEE Journal on Selected Areas in Communications, vol. 23, no. 4, pp. 755--764, 2003. Google ScholarDigital Library
- R. Wagner, S. Sarvotham, and R. Baraniuk. A Multiscale Data Representation for Distributed Sensor Networks. Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 2005.Google Scholar
- R. Wagner, H. Choi, R. Baraniuk, and V. Delouille. Distributed Wavelet Transform for Irregular Sensor Network Grids. Proceedings of the IEEE Workshop on Statistical Signal Processing, 2005.Google ScholarCross Ref
- D. Ganesan, D. Estrin, and J. Heidemann. DIMENSIONS: Why Do We Need a New Data Handling Architecture for Sensor Networks? ACM SIGCOMM Computer Communications Review, vol. 33, no. 1, pp. 143--148, 2003. Google ScholarDigital Library
- D. Ganesan, B. Greenstein, D. Perelyubskiy, D. Estrin, and J. Heidemann. An Evaluation of Multi-resolution Storage for Sensor Networks. Proceedings of the ACM SenSys Conference, 2003. Google ScholarDigital Library
- W. Sweldens. The Lifting Scheme: a Construction of Second Generation Wavelets. SIAM Journal on Mathematical Analysis, vol. 29, no. 2, pp. 511--546, 1998. Google ScholarDigital Library
- J.M. Hellerstein, W. Hong, S. Madden, and K. Stanek. Beyond Average: Towards Sophisticated Sensing with Queries. Proceedings of the 2nd International Symposium on Information Processing in Sensor Networks, 2003. Google ScholarDigital Library
- J.M. Hellerstein and W. Wang. Optimization of In-Network Data Reduction. Proceedings of the International Workshop on Data Management for Sensor Networks (DMSN), 2004. Google ScholarDigital Library
- M. Luby. LT Codes. Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2002. Google ScholarDigital Library
- R.G. Gallager. Low Density Parity-Check Codes. MIT Press, Cambridge, MA, 1963.Google ScholarCross Ref
- A.G. Dimakis, V. Prabhakaran, and K. Ramchandran. Ubiquitous access to distributed data in large-scale sensor networks through decentralized erasure codes. Proceedings of IPSN, 2005. Google ScholarDigital Library
Index Terms
- Random distributed multiresolution representations with significance querying
Recommendations
Multi-factor and Distributed Clustering Routing Protocol in Wireless Sensor Networks
One of important issues in wireless sensor networks is how to effectively use the limited node energy to prolong the lifetime of the networks. Clustering is a promising approach in wireless sensor networks, which can increase the network lifetime and ...
A distributed clustering method for energy-efficient data gathering in sensor networks
Since sensor nodes operate on batteries, energy-efficient mechanisms for gathering sensor data are indispensable in prolonging the lifetime of a sensor network as long as possible. In this paper, we propose a novel clustering method where energy-...
Distributed algorithms for barrier coverage via sensor rotation in wireless sensor networks
When deploying sensors to monitor boundaries of battlefields or country borders, sensors are usually dispersed from an aircraft following a predetermined path. In such scenarios sensing gaps are usually unavoidable. We consider a wireless sensor network ...
Comments