Advertisement

Wireless Networks

, Volume 13, Issue 6, pp 817–834 | Cite as

Barrier coverage with wireless sensors

  • Santosh Kumar
  • Ten H. Lai
  • Anish Arora
Article

Abstract

When a sensor network is deployed to detect objects penetrating a protected region, it is not necessary to have every point in the deployment region covered by a sensor. It is enough if the penetrating objects are detected at some point in their trajectory. If a sensor network guarantees that every penetrating object will be detected by at least k distinct sensors before it crosses the barrier of wireless sensors, we say the network provides k-barrier coverage. In this paper, we develop theoretical foundations for k-barrier coverage. We propose efficient algorithms using which one can quickly determine, after deploying the sensors, whether the deployment region is k-barrier covered. Next, we establish the optimal deployment pattern to achieve k-barrier coverage when deploying sensors deterministically. Finally, we consider barrier coverage with high probability when sensors are deployed randomly. The major challenge, when dealing with probabilistic barrier coverage, is to derive critical conditions using which one can compute the minimum number of sensors needed to ensure barrier coverage with high probability. Deriving critical conditions for k-barrier coverage is, however, still an open problem. We derive critical conditions for a weaker notion of barrier coverage, called weak k-barrier coverage.

Keywords

Wireless sensor networks Barrier coverage Network topology 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Arora, R. Ramnath, E. Ertin, P. Sinha, S. Bapat, V. Naik, V. Kulathumani, H. Zhang, H. Cao, M. Sridhara, S. Kumar, N. Seddon, C. Anderson, T. Herman, N. Trivedi, C. Zhang, M. Gouda, Y.-R. Choi, M. Nesterenko, R. Shah, S. Kulkarni, M. Aramugam, L. Wang, D. Culler, P. Dutta, C. Sharp, G. Tolle, M. Grimmer, B. Ferriera and K. Parker, ExScal: Elements of an extreme scale wireless sensor network, in: Proceedings of the Eleventh IEEE International Conference on Real-Time Computing Systems and Applications (IEEE RTCSA), Hong Kong 2005).Google Scholar
  2. 2.
    N. Alon and J.H. Spencer, The Probabilistic Method. (John Wiley & Sons, 2000).Google Scholar
  3. 3.
    Bid to Seal-off US-Mexico Border. B.B.C. News, Nov. 4, 2005. http://news.bbc.co.uk/go/pr/fr/-/1/hi/americas/4407558.stm
  4. 4.
    K. Boroczky, Finite Packing and Covering. (Cambridge University Press, 2004).Google Scholar
  5. 5.
    H.S.M. Coxeter, Introduction to Geometry. (New York, Wiley, 1969).zbMATHGoogle Scholar
  6. 6.
    D.W. Gage, Command control for many-robot systems, in: AUVS-92 1992.Google Scholar
  7. 7.
    C. Gui and P. Mohapatra, Power conservation and quality of surveillance in target tracking sensor networks, in: International Conference on Mobile Computing and Networking (ACM MobiCom), Philadelphia, PA (2004).Google Scholar
  8. 8.
    P. Hall, Introduction to the Theory of Coverage Processes. (John Wiley & Sons, 1988).Google Scholar
  9. 9.
    C. Huang and Y. Tseng, The coverage problem in a wireless sensor network, ACM International Workshop on Wireless Sensor Networks and Applications (WSNA), San Diego, CA (2003), pp. 115–121Google Scholar
  10. 10.
    S. Hynes, Multi-agent simulations (mas) for assessing massive sensor coverage and deployment, Technical report, Master’s Thesis, Naval Postgraduate School (2003).Google Scholar
  11. 11.
    S. Kumar and A. Arora, Echelon topology for node deployment, Technical report, ExScal Note Series: ExScal-OSU-EN00-2004-01-30, The Ohio State University (2004).Google Scholar
  12. 12.
    S. Kumar, T.H. Lai, and J. Balogh, On k-coverage in a mostly sleeping sensor network, International Conference on Mobile Computing and Networking (ACM MobiCom), Philadelphia, PA (2004), pp. 144–158.Google Scholar
  13. 13.
    R.P. Langlands, C. Pichet, P. Pouliot and Y. Saint-Aubin, On the universality of crossing probabilities in two-domensional percolation, Journal of Statistical Physics 67(3/4) (1992), pp. 553–574.zbMATHCrossRefGoogle Scholar
  14. 14.
    B. Liu and D. Towsley, On the coverage and detectability of large-scale wireless sensor networks, in: Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (2003).Google Scholar
  15. 15.
    S. Meguerdichian, F. Koushanfar, M. Potkonjak and M. B. Srivastava, Coverage Problems in wireless ad-hoc sensor networks, In IEEE INFOCOM (2001).Google Scholar
  16. 16.
    S. Meguerdichian, F. Koushanfar, G. Qu and M. Potkonjak, Exposure in wireless ad-hoc sensor networks, in: International Conference on Mobile Computing and Networking (ACM MobiCom), Rome, Italy (2001), pp. 139–150.Google Scholar
  17. 17.
    B. Mohar and N. Robertson, Disjoint Essential Cycles, Journal of Combinatorial Theory, 68(2):324–349, 1996.zbMATHCrossRefGoogle Scholar
  18. 18.
    B. Mohar and C. Thomassen, Graphs on Surfaces (Johns Hopkins University Press, 2001).Google Scholar
  19. 19.
    D. Peleg, Distributed Computing: A Loaclity-Sensitive Approach (Society for Industrial and Applied Mathematics (SIAM), 2000).Google Scholar
  20. 20.
    S.M. Ross, Introduction to Probability Models (Academic Press, 2000).Google Scholar
  21. 21.
    A. Schrijver, Combinatorial Optimization (Springer, 2003).Google Scholar
  22. 22.
    G. Veltri, Q. Huang, G. Qu and M. Potkonjak, “Minimum and maximal exposure path algorithms for wireless embedded sensor networks, in: ACM Conference on Ebmedded Networked Sensor Systems (SenSys) (2003).Google Scholar
  23. 23.
    X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless and C. Gill, Integrated coverage and connectivity configuration in wireless sensor networks, in: ACM Conference on Ebmedded Networked Sensor Systems (SenSys), Los Angeles, CA (2003), pp. 28–39.Google Scholar
  24. 24.
    D. B. West, Introduction to Graph Theory (Prentice Hall, 2001).Google Scholar
  25. 25.
    H. Zhang and J. Hou, On deriving the upper bound of α-lifetime for large sensor networks, in: International Symposium on Mobile Ad Hoc Networking and Computing (ACM MobiHoc), Tokyo, Japan (2004), pp. 121–132.Google Scholar

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringOhio State UniversityColumbusUSA

Personalised recommendations