ABSTRACT
Wireless sensor networks have created new opportunities for data collection in a variety of scenarios, such as environmental and industrial, where we expect data to be temporally and spatially correlated. Researchers may want to continuously collect all sensor data from the network for later analysis. Suppression, both temporal and spatial, provides opportunities for reducing the energy cost of sensor data collection. We demonstrate how both types can be combined for maximal benefit. We frame the problem as one of monitoring node and edge constraints. A monitored node triggers a report if its value changes. A monitored edge triggers a report if the difference between its nodes' values changes. The set of reports collected at the base station is used to derive all node values. We fully exploit the potential of this global inference in our algorithm, CONCH, short for constraint chaining. Constraint chaining builds a network of constraints that are maintained locally, but allow a global view of values to be maintained with minimal cost. Network failure complicates the use of suppression, since either causes an absence of reports. We add enhancements to CONCH to build in redundant constraints and provide a method to interpret the resulting reports in case of uncertainty. Using simulation we experimentally evaluate CONCH's effectiveness against competing schemes in a number of interesting scenarios.
- K. Chintalapudi and R. Govindan. Localized edge detection in sensor fields. In Proc. of the 2003 IEEE Sensor Network Protocols and Applications, May 2003.Google ScholarCross Ref
- D. Chu, A. Deshpande, J. Hellerstein, and W. Hong. Approximate data collection in sensor networks using probabilistic models. In Proc. of the 2006 Intl. Conf. on Data Engineering, Apr. 2006. Google ScholarDigital Library
- Chuck Conner. Modeling Heat Transfer in Parallel. http://www.cas.usf.edu/~cconnor/parallel/2dheat/2dheat.html.Google Scholar
- T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms, chapter 23. McGraw-Hill/MIT Press, 2001. Google ScholarDigital Library
- Crossbow Inc. MPR-Mote Processor Radio Board User's Manual.Google Scholar
- A. Deligiannakis, Y. Kotidis, and N. Roussopoulos. Compressing historical information in sensor networks. In Proc. of the 2004 ACM SIGMOD Intl. Conf. on Management of Data, June 2004. Google ScholarDigital Library
- C. Intanagonwiwat, R. Govindan, D. Estrin, J. Heidemann, and F. Silva. Directed diffusion for wireless sensor ACM/IEEE Trans. on Networking, 11(1):2--16, 2002. Google ScholarDigital Library
- A. Jain, E. Chang, and Y. Wang. Adaptive stream resource management using kalman Filters. In Proc. of the 2004 ACM SIGMOD Intl. Conf. on Management of Data, June 2004. Google ScholarDigital Library
- Y. Kotidis. Snapshot queries: Towards data-centric sensor networks. In Proc. of the 2005 Intl. Conf. on Data Engineering, Apr. 2005. Google ScholarDigital Library
- S. Madden, M. Franklin, J. Hellerstein, and W. Hong. Tag: a tiny aggregation service for ad-hoc sensor networks. In Proc. of the 2002 USENIX Symp. on Operating Systems Design and Implementation, Dec. 2002. Google ScholarDigital Library
- A. Manjhi, S. Nath, and P. Gibbons. Tributaries and deltas: Efficient and robust aggregation in sensor network streams. In Proc. of the 2005 ACM SIGMOD Intl. Conf. on Management of Data, June 2005. Google ScholarDigital Library
- X. Meng, L. Li, T. Nandagopal, and S. Lu. Event contour: An efficient and robust mechanism for tasks in sensor networks. Technical report, UCLA, 2004.Google Scholar
- S. Pattem, B. Krishnamachari, and R. Govindan. The impact of spatial correlation on routing with compression in wireless sensor networks. In Proc. of the 2004 Intl. Conf. on Information Processing in Sensor Networks, Apr. 2004. Google ScholarDigital Library
- D. Petrovic, R. Shah, K. Ramchandran, and J. Rabaey. Data funneling: Routing with aggregation and compression for wireless sensor networks. In Proc. of the 2003 IEEE Sensor Network Protocols and Applications, May 2003.Google ScholarCross Ref
- G. Pottie and W. Kaiser. Wireless integrated network sensors. Communications of the ACM, 43(5):51--58, 2000. Google ScholarDigital Library
- M. Sharaf, J. Beaver, A. Labrinidis, and P. Chryanthis. Tina: A scheme for temporal coherency-aware in-network aggregation. In Proc. of the 2003 ACM Workshop on Data Engineering for Wireless and Mobile Access, Sept. 2003. Google ScholarDigital Library
- I. Solis and K. Obraczka. Efficient continuous mapping in sensor networks using isolines. In Proc. of the 2005 Mobiquitous, July 2005. Google ScholarDigital Library
- A. Woo, T. Tong, and D. Culler. Taming the underlying challenges of reliable multihop routing in sensor networks. In Proc. of the 2003 ACM Conf. on Embedded Networked Sensor Systems, Nov. 2003. Google ScholarDigital Library
- Y. Yao and J. Gehrke. The cougar approach to in-network query processing in sensor networks. ACM SIGMOD Record, 31(3), 2002. Google ScholarDigital Library
- Z. Zhou, S. Das, and H. Gupta. Connected k-coverage problem in sensor networks. In Proc. of the 2004 IEEE Intl. Conf. on Computer Communications and Networks, Oct. 2004.Google Scholar
Index Terms
- Constraint chaining: on energy-efficient continuous monitoring in sensor networks
Recommendations
An efficient cluster-based communication protocol for wireless sensor networks
A wireless sensor network is a network of large numbers of sensor nodes, where each sensor node is a tiny device that is equipped with a processing, sensing subsystem and a communication subsystem. The critical issue in wireless sensor networks is how ...
On Prolonging the Lifetime for Wireless Video Sensor Networks
This paper investigates strategies for prolonging the system lifetime for wireless video sensor networks, by adopting a mobile sink and solar-powered video sensors. Issues of tracking moving objects in wireless video sensor networks are studied, and the ...
Single versus multi-hop wireless reprogramming in sensor networks
TridentCom '08: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communitiesWireless reprogramming of the sensor network is useful for uploading new code or for changing the functionality of the existing code. In recent years, the research focus has shifted from single hop reprogramming to multi-hop reprogramming primarily ...
Comments