Skip to main content
SpringerLink
Log in

Find Penetration Paths

  • Chapter
  • First Online:
Coverage Control in Sensor Networks

Part of the book series: Computer Communications and Networks ((CCN))

  • 806 Accesses

Abstract

The coverage problem of finding penetration paths is rooted in the intrusion detection and tracking applications. A penetration path is a crossing path (a continuous curve with arbitrary shape), which enters the sensor field from one side and leaves the sensor field from the other side. For example, given the knowledge of the network deployment, an intruder would like to find a safest penetration path such that when it moves along the path, it is most unlikely to be detected and tracked. From the viewpoint of a defender, a safest penetration path to the intruder is its weakest path. A defender needs to identify such worst penetration paths and takes some measure to improve the network monitoring performance. The objective of finding penetration paths is to identify one crossing path with every point on it whose coverage measure satisfies a predefined coverage requirement. This is different from the problem of building intrusion barriers, which is mainly to guarantee that some points of every crossing path should meet certain coverage requirements. This chapter discusses the coverage problem of finding penetration paths, and the following questions are addressed in this chapter.

What are penetration paths and how to find a penetration path?

The definition and the property of a penetration path are dependent on the coverage model and coverage requirements. This chapter introduces some typical types of penetration path and presents the algorithms for finding penetration paths.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adriaens, J., Megerian, S., Potkonjak, M.: Optimal worst-case coverage of directional field-of-view sensor networks. In: IEEE 3rd Annual Communications Society on Sensor and Ad Hoc Communications and Networks (SECON), pp. 336–345 (2006)

    Google Scholar 

  2. Chin, T.L., Ramanathan, P., Saluja, K.K., Wang, K.C.: Exposure for collaborative detection using mobile sensor networks. In: IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS), pp. 1–8 (2005)

    Google Scholar 

  3. Clouqueur, T., Ramanathan, P., Saluja, K.K.: Exposure of variable speed targets through a sensor field. In: IEEE International Conference on Information Fusion (IF), pp. 599–605 (2003)

    Google Scholar 

  4. Clouqueur, T., Phipatanasuphorn, V., Ramanathan, P., Saluja, K.K.: Sensor deployment strategy for detection of targets traversing a region. Mobile Networks and Applications 8(4), 453–461 (2003)

    Article  Google Scholar 

  5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd Edition. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  6. Deng, K., Liu, Z.: Minimum path exposure and detection interval setting for target detection using wireless sensor network. International Journal of Wireless Information Networks (Springer) 14(4), 289–294 (2007)

    Article  MathSciNet  Google Scholar 

  7. Duttagupta, A., Bishnu, A., Sengupta, I.: Optimization problems based on the maximal breach path measure for wireless sensor network coverage. In: The 3rd International Conference on Distributed Computing and Internet Technology (ICDCIT), also in LNCS, vol. 4317, pp. 27–40 (2006)

    Google Scholar 

  8. Duttagupta, A., Bishnu, A., Sengupta, I.: Maximal breach in wireless sensor networks: Geometric characterization and algorithms. In: The 3rd International Workshop on Algorithmic Aspects of Wireless Sensor Networks (Algosensors), also in LNCS, vol. 4837, pp. 126–137 (2008)

    Google Scholar 

  9. Fang, C., Low, C.P.: Redundant coverage in wireless sensor networks. In: IEEE International Conference on Communications, pp. 3535–3540 (2007)

    Google Scholar 

  10. Hall, P.: Introduction to the Theory of Coverage Processes. Wiley, New York (1988)

    MATH  Google Scholar 

  11. Harada, J., Shioda, S., Saito, H.: Path coverage properties of randomly deployed sensors with finite data-transmission ranges. Computer Networks (Elsevier) 53(7), 1014–1026 (2009)

    Article  MATH  Google Scholar 

  12. Hou, Y.T., Chen, C.M., Jeng, B.: An optimal new-node placement to enhance the coverage of wireless sensor networks. Wireless Networks (Springer) (2009). doi:10.1007/s11276-009-0186-x

    Google Scholar 

  13. Huang, H., Richa, A.W., Segal, M.: Dynamic coverage in ad-hoc sensor networks. Mobile Networks and Applications 10, 9–18 (2005)

    Article  Google Scholar 

  14. Huang, L.S., Xu, H.L., Wang, Y., Wu, J.M., Li, H.: Coverage and exposure paths in wireless sensor networks. Journal of Computer Science and Technology 21(4), 490–495 (2006)

    Article  MathSciNet  Google Scholar 

  15. Li, X.Y., Wan, P.J., Frieder, O.: Coverage in wireless ad hoc sensor networks. IEEE Transactions on Computers 52(6), 753–763 (2003)

    Article  Google Scholar 

  16. Manohar, P., Ram, S.S., Manjunath, D.: Path coverage by a sensor field: The nonhomogeneous case. ACM Transactions on Sensor Network (ToSN) 5(2), 1–26 (2009)

    Article  Google Scholar 

  17. Megerian, S., Koushanfar, F.: Exposure in wireless sensor networks: Theory and practical solutions. Wireless Networks 8, 443–454 (2002)

    Article  MATH  Google Scholar 

  18. Megerian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Worst and best-case coverage in sensor networks. IEEE Transactions on Mobile Computing 4(1), 84–92 (2005)

    Article  Google Scholar 

  19. Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage problems in wireless ad-hoc sensor networks. In: IEEE Infocom, vol. 3, pp. 1380–1387 (2001)

    Google Scholar 

  20. Meguerdichian, S., Koushanfar, F., Qu, G., Potkonjak, M.: Exposure in wireless ad hoc sensor networks. In: ACM International Conference on Mobile Computing and Networking (MobiCom), pp. 139–150 (2001)

    Google Scholar 

  21. Mehta, D.P., Lopez, M.A., Lin, L.: Optimal coverage paths in ad-hoc sensor networks. In: IEEE International Conference on Communications (ICC), pp. 507–511 (2003)

    Google Scholar 

  22. Onur, E., Ersoy, C., Delic, H.: Finding sensing coverage and breach paths in surveillance wireless sensor networks. In: IEEE Internal Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), pp. 984–988 (2004)

    Google Scholar 

  23. Onur, E., Ersoy, C., Delic, H.: How many sensors for an acceptable breach detection probability? Computer Communications (Elsevier) 29(2), 173–182 (2006)

    Article  Google Scholar 

  24. Ram, S.S., Manjunath, D., Iyer, S.K., Yogeshwaran, D.: On the path coverage properties of random sensor networks. IEEE Transactions on Mobile Computing 6(5), 446–458 (2007)

    Article  Google Scholar 

  25. Veltri, G., Huang, Q., Qu, G., Potkonjak, M.: Minimal and maximal exposure path algorithms for wireless embedded sensor networks. In: ACM International Conference on Embedded Networked Sensor Systems (SenSys), pp. 40–50 (2003)

    Google Scholar 

  26. Wang, B., Chua, K.C., Wang, W., Srinivasan, V.: Worst and best information exposure paths in wireless sensor networks. In: International Conference on Mobile Ad-hoc and Sensor Networks (MSN05), also in LNCS, vol. 3794, pp. 52–62 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Intelligent Systems Centre, Nanyang Technological University, 50 Nanyang Drive Research Techno Plaza, Level 7, Singapore, 637553, Singapore

    Dr. Bang Wang

Authors
  1. Dr. Bang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bang Wang .

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag London

About this chapter

Cite this chapter

Wang, B. (2010). Find Penetration Paths. In: Coverage Control in Sensor Networks. Computer Communications and Networks. Springer, London. https://doi.org/10.1007/978-1-84996-059-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-84996-059-5_10

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84996-058-8

  • Online ISBN: 978-1-84996-059-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation