Efficient, Decentralized Detection of Qualitative Spatial Events in a Dynamic Scalar Field
AbstractThis paper describes an efficient, decentralized algorithm to monitor qualitative spatial events in a dynamic scalar field. The events of interest involve changes to the critical points (i.e., peak, pits and passes) and edges of the surface network derived from the field. Four fundamental types of event (appearance, disappearance, movement and switch) are defined. Our algorithm is designed to rely purely on qualitative information about the neighborhoods of nodes in the sensor network and does not require information about nodes’ coordinate positions. Experimental investigations confirm that our algorithm is efficient, with O(n) overall communication complexity (where n is the number of nodes in the sensor network), an even load balance and low operational latency. The accuracy of event detection is comparable to established centralized algorithms for the identification of critical points of a surface network. Our algorithm is relevant to a broad range of environmental monitoring applications of sensor networks. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Jeong, M.-H.; Duckham, M. Efficient, Decentralized Detection of Qualitative Spatial Events in a Dynamic Scalar Field. Sensors 2015, 15, 21350-21376.
Jeong M-H, Duckham M. Efficient, Decentralized Detection of Qualitative Spatial Events in a Dynamic Scalar Field. Sensors. 2015; 15(9):21350-21376.Chicago/Turabian Style
Jeong, Myeong-Hun; Duckham, Matt. 2015. "Efficient, Decentralized Detection of Qualitative Spatial Events in a Dynamic Scalar Field." Sensors 15, no. 9: 21350-21376.