Finding breach paths using the watershed segmentation algorithm in surveillance wireless sensor networks

Date

2004-01-01

Author

Onur, Ertan
Delic, H
Akarun, L

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

146
views

0
downloads

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, axe 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.

Subject Keywords

Computer Science, Artificial Intelligence, Computer Science, Information Systems, Computer Science, Software Engineering, Computer Science, Theory & Methods

URI

https://hdl.handle.net/11511/38758

Journal

COMPUTER AND INFORMATION SCIENCES - ISCIS 2004, PROCEEDINGS

DOI

https://doi.org/10.1007/978-3-540-30182-0_37

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

Providing Automated Actions in Wireless Multimedia Sensor Networks via Active Rules Oztarak, Hakan; Akkaya, Kemal; Yazıcı, Adnan (2011-09-28) Manual processing of multimedia data in Wireless Multimedia Sensor Networks (WMSNs) may not always be possible. This necessitates autonomous operation of data processing at the sink for taking actions as well as communicating with the appropriate personnel whenever needed. In this paper, we propose a framework for fusing and automated processing of incomplete/imprecise WMSN data using active rules. First, data fusion is performed via fuzzy logic to handle the uncertainty in the received data at the sink. We...
Analysis of target detection probability in randomly deployed sensor networks Onur, Ertan; Delic, Hakan (Institute of Electrical and Electronics Engineers (IEEE), 2007-10-01) The main functionality of a surveillance wireless sensor network is to detect unauthorized traversals in a field. In this paper, we develop a formulation to determine the probability of detecting a randomly positioned target by a set of binary sensors to serve as the deployment quality measure. This formulation leads to a recipe to determine the number of sensors required to deliver a certain deployment quality level. The sensing- and communication-neighbor degrees which can be used as design criteria in a ...
Surveillance with wireless sensor networks in obstruction: Breach paths as watershed contours Onur, Ertan; Delic, Hakan; Akarun, Lale (Elsevier BV, 2010-02-01) For surveillance applications of wireless sensor networks, analysis of sensing coverage and quality of sensing is crucial. For rough terrains where obstacles block the sensing capability, region-based approaches must be employed to determine the sensing quality. In this paper, we present a method to determine the breach paths and the deployment quality defined as the minimum of the maximum detection probabilities on the breach paths in the presence of obstacles. We propose the utilization of watershed segme...
How many sensors for an acceptable breach detection probability? Onur, Ertan; Delic, H (Elsevier BV, 2006-01-10) Determining the required number of sensors to be deployed is a critical decision for surveillance wireless sensor networks. In this paper, we discuss the trade-off between the number of sensors and the breach detection probability considering the effects of sensor parameters. We present the weakest breach path problem formulation and provide a solution by utilizing the Dijkstra's shortest path algorithm. We propose a method to determine the required number of sensors to be deployed and to gain insight about...
An Energy - efficient and reactive remote surveillance framework using wireless multimedia sensor networks Öztarak, Hakan; Yazıcı, Adnan; Department of Computer Engineering (2011) With the introduction of Wireless Multimedia Sensor Networks, large-scale remote outdoor surveillance applications where the majority of the cameras will be battery-operated are envisioned. These are the applications where the frequency of incidents is too low to employ permanent staffing such as monitoring of land and marine border, critical infrastructures, bridges, water supplies, etc. Given the inexpensive costs of wireless resource constrained camera sensors, the size of these networks will be signific...

Citation Formats

E. Onur, H. Delic, and L. Akarun, “Finding breach paths using the watershed segmentation algorithm in surveillance wireless sensor networks,” COMPUTER AND INFORMATION SCIENCES - ISCIS 2004, PROCEEDINGS, pp. 363–372, 2004, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/38758.