Surveillance with wireless sensor networks in obstruction: Breach paths as watershed contours

Date

2010-02-01

Author

Onur, Ertan
Delic, Hakan
Akarun, Lale

Metadata

Show full item record

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

Item Usage Stats

205
views

0
downloads

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 segmentation on the iso-sensing map that reveals the equally-sensed regions of the field-of-interest in a surveillance application. Probabilistic sensor models are utilized to produce the iso-sensing map considering the sensing coverage degree and reliability level as the design criteria. The watershed segmentation algorithm is applied on the iso-sensing map to identify the possible breach paths. An algorithm is proposed to convert the watershed segmentation to an auxiliary graph which is then employed to determine the deployment quality measure (DQM). The effects of the sensor count and coverage degree on the DQM are analyzed.

Subject Keywords

Computer Networks and Communications

URI

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

Journal

COMPUTER NETWORKS

DOI

https://doi.org/10.1016/j.comnet.2009.09.006

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

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...
Delay aware reliable transport in wireless sensor networks Gungor, Vehbi C.; Akan, Oezguer B. (Wiley, 2007-10-01) Wireless sensor networks (WSN) are event-based systems that rely on the collective effort of several sensor nodes. Reliable event detection at the sink is based on collective information provided by the sensor nodes and not on any individual sensor data. Hence, conventional end-to-end reliability definitions and solutions are inapplicable in the WSN regime and would only lead to a waste of scarce sensor resources. Moreover, the reliability objective of WSN must be achieved within a certain real-time delay b...
Mobile multi-access IP: a proposal for mobile multi-access management in future wireless IP networks Altuntas, S; Baykal, Buyurman (Elsevier BV, 2005-03-15) As the wireless networking technologies advance rapidly, providing mobile users with roaming freely in heterogeneous wireless access domains, the need for multi-access arises. This paper introduces the Mobile Multi-Access Management Architecture (MMA-IP) for IP-based future wireless networks. MMA-IP enables mobile users to utilize multiple access domains synchronously and to switch between different access domains. In order to handle multi-access operations, MMA-IP defines a new special mobility agent, call...
Energy-aware routing algorithms for wireless ad hoc networks with heterogeneous power supplies Vazifehdan, Javad; Prasad, R. Venkatesha; Onur, Ertan; Niemegeers, Ignas (Elsevier BV, 2011-10-27) Although many energy-aware routing schemes have been proposed for wireless ad hoc networks, they are not optimized for networks with heterogeneous power supplies, where nodes may run on battery or be connected to the mains (grid network). In this paper, we propose several energy-aware routing algorithms for such ad hoc networks. The proposed algorithms feature directing the traffic load dynamically towards mains-powered devices keeping the hop count of selected routes minimal. We unify these algorithms into...
Quality of deployment in surveillance wireless sensor networks Onur, Ertan; Deliç, Hakan (Springer Science and Business Media LLC, 2005-01-01) When wireless sensors are used to keep an area under surveillance, a critical issue is the quality of the deployment from the sensing coverage viewpoint. In this paper, we propose several quality measures, which indicate if the deployment provides sufficient coverage, or whether redeployment is required or not. The terrain is modeled as a grid and the placement of the sensors is uniformly distributed. Neyman–Pearson detection is utilized to determine the effects of false-alarm and signal characteristics on ...

Citation Formats

E. Onur, H. Delic, and L. Akarun, “Surveillance with wireless sensor networks in obstruction: Breach paths as watershed contours,” COMPUTER NETWORKS, pp. 428–441, 2010, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/37959.