Himanshu Gupta
Abstract
In this article, we design techniques that exploit data correlations in sensor data to minimize communication costs (and hence, energy costs) incurred during data gathering in a sensor network. Our proposed approach is to select a small subset of sensor nodes that may be sufficient to reconstruct data for the entire sensor network. Then, during data gathering only the selected sensors need to be involved in communication. The selected set of sensors must also be connected, since they need to relay data to the data-gathering node. We define the problem of selecting such a set of sensors as the connected correlation-dominating set problem, and formulate it in terms of an appropriately defined correlation structure that captures general data correlations in a sensor network.
We develop a set of energy-efficient distributed algorithms and competitive centralized heuristics to select a connected correlation-dominating set of small size. The designed distributed algorithms can be implemented in an asynchronous communication model, and can tolerate message losses. We also design an exponential (but nonexhaustive) centralized approximation algorithm that returns a solution within O(log n) of the optimal size. Based on the approximation algorithm, we design a class of centralized heuristics that are empirically shown to return near-optimal solutions. Simulation results over randomly generated sensor networks with both artificially and naturally generated data sets demonstrate the efficiency of the designed algorithms and the viability of our technique—even in dynamic conditions.
- Alzoubi, K. M., Wan, P.-J., and Frieder, O. 2002. Message-optimal connected dominating sets in mobile ad hoc networks. In Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). Google Scholar
Digital Library
- Badrinath, B., Srivastava, M., Mills, K., Scholtz, J., and Sollins, K., Eds. 2000. IEEE Perso. Comm. Special Issue on Smart Spaces and Environments.Google Scholar
- Berman, P. and Ramaiyer, V. 1994. Improved approximation algorithms for the Steiner tree problem. J. Algor. 17. Google ScholarDigital Library
- Cerpa, A. and Estrin, D. 2002. Ascent: Adaptive self-configuring sensor networks topologies. In Proceedings of the IEEE INFOCOM.Google Scholar
- Chen, B., Jamieson, K., Balakrishnan, H., and Morris, R. 2001. Span: An energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks. In Proceedings of the International Conference on Mobile Computing and Networking (MobiCom). Google ScholarDigital Library
- Chen, Y. and Liestman, A. 2002. Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks. In Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). Google ScholarDigital Library
- Chou, J., Petrovic, D., and Ramchandran, K. 2003. A distributed and adaptive signal processing approach to reducing energy consumption in sensor networks. In Proceedings of the IEEE INFOCOM.Google Scholar
- Chu, M., Haussecker, H., and Zhao, F. 2002. Scalable information-driven sensor querying and routing for ad hoc heterogeneous sensor networks. IEEE J. High Perfor. Comput. Appl.Google Scholar
- Cormen, T., Lieserson, C., Rivest, R., and Stein, C. 2001. Introduction to Algorithms. McGraw Hill. Google ScholarDigital Library
- Cristescu, R., Beferull-Lozano, B., and Vetterli, M. 2004. On network correlated data gathering. In Proceedings of the IEEE INFOCOM.Google Scholar
- Cristescu, R. and Vetterli, M. 2003. Power efficient gathering of correlated data: Optimization, NP-completeness and heuristics. SIGMOBILE Mob. Comput. Comm. Rev. 7, 3, 31--32. Google ScholarDigital Library
- D. Culler et al. 2004. TinyOS. http://www.tinyos.net.Google Scholar
- Das, B., Sivakumar, R., and Bhargavan, V. 1997. Routing in ad hoc networks using a spine. In Proceedings of the International Conference on Computer Communications and Networks (IC3N). Google ScholarDigital Library
- Deb, B., Bhatnagar, S., and Nath, B. 2003. Multi-resolution state retrieval in sensor networks. In Proceedings of International Workshop on Sensor Network Protocols and Applications.Google Scholar
- Doherty, L. and Pister, K. 2004. Scattered data selection for dense sensor networks. In Proceedings of the International Workshop on Information Processing in Sensor Networks (IPSN). Google ScholarDigital Library
- Dubhashi, D., Mei, A., Panconesi, A., Radhakrishnan, J., and Srinivasan, A. 2003. Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons. In Proceedings of the ACM Symposium on Discrete Algorithms (SODA). Google ScholarDigital Library
- Enachescu, M., Goel, A., Govindan, R., and Motwani, R. 2004. Scale free aggregation in sensor networks. In Proceedings of the 1st International Workshop on Algorithmic Aspects of Wireless Sensor Networks (Algosensors).Google Scholar
- Estrin, D., Govindan, R., and Heidemann, J. 2000. eds. Comm. the ACM (Special Issue on Embedding the Internet) 43. Google ScholarDigital Library
- Goel, A. and Estrin, D. 2003. Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk. In Proceedings of the ACM Symposium on Discrete Algorithms (SODA). Google ScholarDigital Library
- Guha, S. and Khuller, S. 1998. Approximation algorithms for connected dominating sets. Algorithmica 20, 4. Google ScholarDigital Library
- Gupta, H. 1997. Selection of views to materialize in a data warehouse. In Proceedings of the International Conference on Database Theory. Google ScholarDigital Library
- Gupta, H. 1999. Selection and maintenance of materialized views in a data warehouse. Ph.D. thesis, Stanford University. Google ScholarDigital Library
- Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D. E., and Pister, K. S. J. 2000. System architecture directions for networked sensors. In Proceedings of the Conference on Architectural Support for Programming Languages and Operating Systems. 93--104. Google ScholarDigital Library
- Intanagonwiwat, C., Govindan, R., and Estrin, D. 2000. Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Proceedings of the International Conference on Mobile Computing and Networking (MobiCom). Google ScholarDigital Library
- James Reserve Data Management Systems. http://dms.jamesreserve.edu/.Google Scholar
- Kay, S. M. 1998. Fundamentals of Statistical Signal Processing: Detection Theory Vol. II. Prentice-Hall. Google ScholarDigital Library
- Laouiti, A., Qayyum, A., and Viennot, L. 2002. Multipoint relaying: An efficient technique for flooding in mobile wireless networks. In Proceedings of the Hawaii International Conference on System Sciences.Google Scholar
- Marco, D., Duarte-Melo, E., Liu, M., and Neuhoff, D. L. 2003. On the many-to-one transport capacity of a dense wireless sensor network and the compressibility of its data. In Proceedings of the International Workshop on Information Processing in Sensor Networks (IPSN). Google ScholarDigital Library
- National Climatic Data Center. www.ncdc.noaa.gov/cgi-bin/res40.pl?page=gsod.html.Google Scholar
- Pattem, S., Krishnamachari, B., and Govindan, R. 2004. The impact of spatial correlation on routing with compression in wireless sensor networks. In Proceedings of the International Workshop on Information Processing in Sensor Networks (IPSN). Google ScholarDigital Library
- Scaglione, A. and Servetto, S. D. 2002. On the interdependence of routing and data compression in multi-hop sensor networks. In Proceedings of the International Conference on Mobile Computing and Networking (MobiCom). Google ScholarDigital Library
- Shnayder, V., Hempstead, M., Chen, B., Allen, G. W., and Welsh, M. 2004. Simulating the power consumption of large-scale sensor network applications. In Proceedings of the International Conference on Embedded Networked Sensor Systems (SenSys). Google ScholarDigital Library
- von Rickenbach, P. and Wattenhofer, R. 2004. Gathering correlated data in sensor networks. In Proceedings of the Joint Workshop on Foundations of Mobile Computing (DIALM-POMC). Google ScholarDigital Library
- Vuran, M. C. and Akyildiz, I. F. 2006. Spatial correlation-based collaborative medium access control in wireless sensor networks. IEEE/ACM Trans. Network. 14, 2. Google ScholarDigital Library
- Wattenhofer, R., Li, L., Bahl, P., and Wang, Y.-M. 2001. Distributed topology control for wireless muitihop ad-hoc networks. In Proceedings of the IEEE INFOCOM.Google Scholar
- Wu, J. and Dai, F. 2003. Broadcasting in ad hoc networks based on self-pruning. In Proceedings of the IEEE INFOCOM.Google Scholar
- Wu, J. and Li, H. 2001. A dominating-set-based routing scheme in ad hoc wireless networks. Telecomm. Syst. J. 3.Google Scholar
- Xu, Y., Heidemann, J. S., and Estrin, D. 2001. Geography-informed energy conservation for ad hoc routing. In Proceedings of the International Conference on Mobile Computing and Networking (MobiCom). Google ScholarDigital Library
- Ye, F., Zhong, G., Cheng, J., Lu, S., and Zhang, L. 2003. PEAS: A robust energy conserving protocol for long-lived sensor networks. In Proceedings of the International Conference on Distributed Computing Systems. Google ScholarDigital Library
- Yoon, S. and Shahabi, C. 2005. Exploiting spatial correlation towards an energy efficient clustered aggregation technique (cag). In Proceedings of the International Conference on Communications (ICC).Google Scholar
Index Terms
- Efficient gathering of correlated data in sensor networks
Recommendations
Efficient gathering of correlated data in sensor networks
MobiHoc '05: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computingIn this paper, we design techniques that exploit data correlations in sensor data to minimize communication costs (and hence, energy costs) incurred during data gathering in a sensor network. Our proposed approach is to select a small subset of sensor ...
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-...
Active node determination for correlated data gathering in wireless sensor networks
In wireless sensor network applications where data gathered by different sensor nodes is correlated, not all sensor nodes need to be active for the wireless sensor network to be functional. Given that the sensor nodes that are selected as active form a ...
Comments