.png){kind=icon}
Return
Efficient Coverage Maintenance Based on Probabilistic Distributed Detection
.png){kind=icon}
OA
AI
DOI：10.1109/TMC.2010.84.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Many wireless sensor networks require sufficient sensing coverage over long periods of time. To conserve energy, a coverage maintenance protocol achieves desired coverage by activating only a subset of nodes, while allowing the others to sleep. Existing coverage maintenance protocols are often designed based on simplistic sensing models that do not capture the stochastic nature of distributed sensing. We propose a new sensing coverage model based on the distributed detection theory, which captures two important characteristics of sensor networks, i.e., probabilistic detection by individual sensors and data fusion among sensors. We then present three coverage maintenance protocols that can meet the specified event detection probability and false alarm rate. The centralized protocol only activates a small number of sensors, but introduces extremely long coverage configuration delay. The SeGrid protocol reduces the configuration time by dividing the network into separate fusion groups, but increases the number of active sensors due to the lack of collaboration among sensors in different groups. In contrast, by coordinating overlapping fusion groups, the Co-Grid protocol can effectively reduce the number of active sensors and the coverage configuration time. The advantages of Co-Grid have been validated through simulations and benchmark results on Mica2 motes.
Keywords:
Wireless sensor networks
coverage maintenance
data fusion
distributed detection
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.2
Papers:
5.6K
Citations:
1.8W
View more organizations