Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Açık Bilim Politikası
Açık Bilim Politikası
Frequently Asked Questions
Frequently Asked Questions
Browse
Browse
By Issue Date
By Issue Date
Authors
Authors
Titles
Titles
Subjects
Subjects
Communities & Collections
Communities & Collections
Finding sensing coverage and breach paths in wireless sensor networks
Date
2004-01-01
Author
Onur, Ertan
Ersoy, C
Delic, H
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
14
views
0
downloads
Most of the recent studies on wireless sensor networks deal with the communication coverage. However, for the surveillance wireless sensor networks, sensing coverage is an open research area. In this paper, the sensing coverage area of surveillance wireless sensor networks is studied. The sensing coverage is determined by applying Neyman-Pearson Detection Model and Dijkstra's shortest path algorithm is applied to find the weakest breach path. Although individually not enough, breach probability is an appropriate parameter to justify the required number of sensor nodes and reliability of the network. Analyzing the parameters of the Neyman-Pearson, the most significant parameter is determined to be the false alarm rate. Increasing the false alarm rate, decreases the breach probability because Neyman-Pearson Detection Model tolerates that amount of alarms to be false.
Subject Keywords
Intelligent networks
,
Wireless sensor networks
,
Surveillance
,
Gaussian processes
URI
https://hdl.handle.net/11511/48955
DOI
https://doi.org/10.1109/siu.2004.1338625
Collections
Department of Computer Engineering, Conference / Seminar