How many sensors for an acceptable breach detection probability?

Onur E., Ersoy C., Delic H.

COMPUTER COMMUNICATIONS, vol.29, pp.173-182, 2006 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 29
  • Publication Date: 2006
  • Doi Number: 10.1016/j.comcom.2005.05.021
  • Journal Name: COMPUTER COMMUNICATIONS
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.173-182
  • Keywords: surveillance wireless sensor networks, Neyman-Pearson detection, breach detection probability, false alarm
  • Middle East Technical University Affiliated: No

Abstract

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 the surveillance performance of the network, the maximum detection probability on the weakest breach path is considered as the performance measure. (C) 2005 Elsevier B.V. All rights reserved.