Abstract
Autonomous mobile sensors are employed with ever-increasing frequency, in applications ranging from search and rescue, detection of forest fires, and battlefield surveillance. in this paper, we consider a representative surveillance problem wherein a sparse number of mobile sensors are expected to cover events of interest in a deployment field. Each event appears for a certain time and then disappears. Furthermore, the location of each event and its duration is unknown. in this paper, we design a sensor movement strategy based on efficient traversal in the network to fulfill two objectives: maximizing event detection and minimizing detection delay. Analysis and simulations demonstrate the performance of our algorithm from the perspective of event detection and delay with respect to the number of sensors, movement velocity, and the number and duration of events. © 2009 IEEE.
Recommended Citation
M. Snyder and S. Chellappan, "Event Coverage in Sparse Mobile Sensor Networks," NBiS 2009 - 12th International Conference on Network-Based Information Systems, pp. 163 - 170, article no. 5349890, Institute of Electrical and Electronics Engineers, Dec 2009.
The definitive version is available at https://doi.org/10.1109/NBiS.2009.71
Department(s)
Computer Science
Keywords and Phrases
Algorithms; Coverage; Deployment; Mobile sensors; Sensor networks
International Standard Book Number (ISBN)
978-076953767-2
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2024 Institute of Electrical and Electronics Engineers, All rights reserved.
Publication Date
01 Dec 2009
