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


Onur E. , Ersoy C., Delic H., Akarun L.

COMPUTER AND INFORMATION SCIENCES - ISCIS 2004, PROCEEDINGS, cilt.3280, ss.363-372, 2004 (SCI İndekslerine Giren Dergi) identifier identifier

  • Cilt numarası: 3280
  • Basım Tarihi: 2004
  • Doi Numarası: 10.1007/978-3-540-30182-0_37
  • Dergi Adı: COMPUTER AND INFORMATION SCIENCES - ISCIS 2004, PROCEEDINGS
  • Sayfa Sayıları: ss.363-372

Özet

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.