2005
DOI: 10.1007/s10776-005-5152-7
|View full text |Cite
|
Sign up to set email alerts
|

Quality of Deployment in Surveillance Wireless Sensor Networks

Abstract: 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 the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0
1

Year Published

2007
2007
2018
2018

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(3 citation statements)
references
References 8 publications
(12 reference statements)
0
2
0
1
Order By: Relevance
“…-highly correlated: due to the spatial-temporal dynamics of the network, the collected data may be redundant and highly correlated. An example may be the correlation of temperature measurements in a field by sensor networks or target presence decisions in surveillance applications [7].…”
mentioning
confidence: 99%
“…-highly correlated: due to the spatial-temporal dynamics of the network, the collected data may be redundant and highly correlated. An example may be the correlation of temperature measurements in a field by sensor networks or target presence decisions in surveillance applications [7].…”
mentioning
confidence: 99%
“…Onur vd. [12] algılayıcı dağıtım kalitesinden bahsederek dağıtımın yeterli kapsamayı sağlayıp sağlamadığını veya yeniden dağıtımın gerekli olup olmadığını gösteren kaliteli ölçümü önermişlerdir. Cheng vd.…”
Section: İlgi̇li̇ çAlişmalar (Related Work)unclassified
“…In [31], Zhang and Hou studied the system lifetime of a k-covered sensor network, and proved that it is upper bounded by k times node continuous working time. In [20] and [21], Onur et al investigated the effect of false alarm rate and path-loss exponent on the quality of deployment using a probabilistic approach, and proposed a method to determine the required number of sensors being deployed under the weakest breach path problem. In [18], Megerian et al proposed the optimal polynomial time worst and average case algorithm for the coverage calculation of homogeneous isotropic sensors, by combining computational geometry and graph theoretic techniques.…”
Section: Related Workmentioning
confidence: 99%