Skip to main content

Finding Breach Paths Using the Watershed Segmentation Algorithm in Surveillance Wireless Sensor Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3280))

Abstract

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, are 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.

This work was supported by the State Planning Organization of Turkey underthe grant number 03K120250, and by the Boğaziçi University Research Projects under the grant number 04A105.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Carle, J., Simplot-Ryl, D.: Energy-Efficient Area Monitoring for Sensor Networks. IEEE Computer 37, 40–46 (2004)

    Google Scholar 

  2. Clouqueur, T., Phipatanasuphorn, V., Ramanathan, P., Saluja, K.K.: Sensor Deployment Strategy for Target Detection. In: Proceedings of the First ACM International Workshop on Wireless Sensor Networks and Applications, Atlanta, USA, pp. 42–48 (2002)

    Google Scholar 

  3. Elfes, A.: Occupancy Grids: A Stochastic Spatial Representation for Active Robot Perception. In: Proceedings of the Sixth Conference on Uncertainty in AI, pp. 60–70 (1990)

    Google Scholar 

  4. He, T., Krishnamurthy, S., Stankovic, J.A., Abdelzaher, T., Luo, L., Stoleru, R., Yan, T., Gu, L.: Energy-Efficient Surveillance System Using Wireless Sensor Networks. In: The Second International Conference on Mobile Systems, Applications, and Services, Boston, USA (2004)

    Google Scholar 

  5. Onur, E., Ersoy, C., Deliç, H.: Finding Sensing Coverage and Breach Paths in Surveillance Wireless Sensor Networks. In: Proceedings of the 15th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, Barcelona, Spain (2004)

    Google Scholar 

  6. Veltri, G., Qu, G., Huang, Q., Potkonjak, M.: Minimal and Maximal Exposure Path Algorithms for Wireless Embedded Sensor Networks. In: Proceedings of the First International ACM Conference on Embedded Networked Sensor Systems, Los Angeles, USA, pp. 40–50 (2003)

    Google Scholar 

  7. Vincent, L., Soile, P.: Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations. IEEE Transactions on Pattern Analysis and Machine Intelligence 13, 583–598 (1991)

    Article  Google Scholar 

  8. Wang, X., Xing, G., Zhang, Y., Lu, C., Pless, R., Gill, C.: Integrated Coverage and Connectivity Configuration in Wireless Sensor Networks. In: Proceedings of the First International ACM Conference on Embedded Networked Sensor Systems, Los Angeles, USA, pp. 28–39 (2003)

    Google Scholar 

  9. Weiss, M.A.: Data Structures and Algorithm Analysis in C++, 2nd edn. Addison-Wesley, Reading (1999)

    Google Scholar 

  10. Zhang, H., Hou, C.J.: Maintaining Sensing Coverage and Connectivity in Large Sensor Networks. In: Proceedings of the NSF International Workshop on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks, Fort Lauderdale, USA (2004)

    Google Scholar 

  11. Zou, Y., Chakrabarty, K.: Energy-Aware Target Localization in Wireless Sensor Networks. In: Proceedings of the First IEEE International Conference on Pervasive Computing and Communications, Fort Worth, USA, pp. 60–67 (2003)

    Google Scholar 

  12. Zou, Y., Chakrabarty, K.: Sensor Deployment and Target Localization Based on Virtual Forces. In: Proceedings of the IEEE INFOCOM, San Francisco, USA, pp. 1293–1303 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Onur, E., Ersoy, C., Deliç, H., Akarun, L. (2004). Finding Breach Paths Using the Watershed Segmentation Algorithm in Surveillance Wireless Sensor Networks. In: Aykanat, C., Dayar, T., Körpeoğlu, İ. (eds) Computer and Information Sciences - ISCIS 2004. ISCIS 2004. Lecture Notes in Computer Science, vol 3280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30182-0_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30182-0_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23526-2

  • Online ISBN: 978-3-540-30182-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics