Sciweavers

Share
ISCIS
2004
Springer

Finding Breach Paths Using the Watershed Segmentation Algorithm in Surveillance Wireless Sensor Networks

9 years 22 days ago
Finding Breach Paths Using the Watershed Segmentation Algorithm in Surveillance Wireless Sensor Networks
Considering wireless sensor networks for border surveillance, one of the major concerns is sensing coverage. Breach probability can be used as a measure to analyze the tradeoffs and to determine the required number of sensors to be deployed to obtain a certain security level. In this paper, the sensing coverage of surveillance wireless sensor networks is studied by utilizing a well-known image processing technique. By applying the watershed segmentation algorithm to the sensing coverage graph, the contour points, which are followed by the breach paths, are found. To determine the weakest breach path by utilizing the contour points, Dijkstra’s shortest path algorithm is used. Under uniformly distributed random deployment, the breach probability is evaluated against the sensor model parameters, field width and the number of sensors deployed.
Ertan Onur, Cem Ersoy, Hakan Deliç, Lale Ak
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Where ISCIS
Authors Ertan Onur, Cem Ersoy, Hakan Deliç, Lale Akarun
Comments (0)
books