Abstract
Purchase PDF (623 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (5)
Purchase PDF (504 K)
doi:10.1016/j.comnet.2005.09.038 
Copyright © 2005 Elsevier B.V. All rights reserved.
Contour maps: Monitoring and diagnosis in sensor networks
Received 26 January 2005;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Large-scale sensor networks impose energy and communication constraints, thus it is difficult to collect data from each individual sensor node and process it at the sink. In this paper, we propose an efficient data-collection scheme that can be used for event monitoring or network-wide diagnosis. Our scheme relies on the well-known representation of data—contour maps, which trade off accuracy with the amount of samples. The scheme consists of three novel algorithms to build contour maps: distributed spatial and temporal data suppression, contour reconstruction at the sink via interpolation and smoothing, and an efficient mechanism to convey routing information over multiple hops. By reducing the number of transmissions required to convey relevant information to the sink, the proposed contour mapping scheme saves energy and improves network lifetime. In a sharp contrast to related work in this area, the scheme does not require all nodes to explicitly share information.
The contour mapping scheme can be applied for tasks such as: (1) presenting a global picture of the network in both temporal and spatial domains, (2) being used as a diagnosis tool, e.g., to detect faulty sensors and to scan for residual energy, (3) working in concert with in-network aggregation schemes to further reduce the communication overhead of aggregation schemes. The proposed scheme imposes little processing and storage overhead, allowing for the sensor networking paradigm of ‘dumb sensor, smart sink’ which enables economical deployment of large-scale sensor networks.
Simulation results show that our scheme is resilient to both high packet loss rate and measurement noise. The design is also energy efficient, resulting in up to an-order-of-magnitude power savings when compared with the base line scheme where every sensor sends its report to the sink.
Keywords: Sensor network; Contour map; Spatio-temporal sampling
Article Outline
- 1. Introduction
- 2. Network model
- 3. Problem description and design overview
- 4. Related work
- 5. Algorithms for contour map construction
- 5.1. Local suppression at each sensor
- 5.1.1. Spatial suppression
- 5.1.2. Temporal suppression
- 5.2. Interpolation and smoothing at the sink
- 5.2.1. Interpolation algorithm
- 5.2.2. Smoothing constructed contour
- 5.3. Discussions
- 6. Extensions
- 6.1. Multihop local suppression
- 6.1.1. Routing information
- 6.1.2. Interpolation algorithm at the sink
- 6.2. Interaction with data aggregation
- 7. Application scenarios
- 8. Performance evaluation
- 8.1. Experimental settings
- 8.2. Performance of contour construction algorithm
- 8.2.1. Quality of reconstructed contour maps
- 8.2.2. Impact of δ
- 8.2.3. Sensitivity to noise
- 8.2.4. Energy saving
- 8.3. Detection of faulty sensors
- 8.4. Spatial–temporal event monitoring
- 8.5. Contour maps for residual energy monitoring
- 8.6. Comparison with CAG
- 9. Conclusion
- References
- Vitae
