Skip to main content

Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors

  • Conference paper
Fun with Algorithms (FUN 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7288))

Included in the following conference series:

  • 1401 Accesses

Abstract

We consider the problem of monitoring the Euclidean plane using rotating sensors with detection sectors and beam sensors. We assume that intruders can appear anywhere at any time and move arbitrarily fast, and may have full knowledge of the sensor network. We require that such intruders be detected within a finite amount of time. We give an optimal network for this problem consisting of a combination of rotating sensors and beam sensors that uses the minimum number of both types of sensors. We show a trade-off between the density of beam sensors needed and the angle of the detection sector of the rotating sensors. Secondly, we give a family of sensor networks using only rotating sensors for the same problem, that demonstrate a trade-off between the detection time and the density of rotating sensors used. We show that the density of rotating sensors required in this case can be significantly reduced by increasing the width of detection sectors. Finally, we show that our results on the infinite plane can be used to derive sensor networks that monitor some finite regions using the same asymptotic density of sensors as in the infinite plane case.

This work was supported by VEGA 2/0136/12 (S. Dobrev) and NSERC Discovery Grants(L. Narayanan, J, Opatrny).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Balister, P., Bollobas, B., Sarkar, A., Kumar, S.: Reliable density estimates for coverage and connectivity in thin strips of finite length. In: Proc. of the 13th Annual ACM Int. Conference on Mobile Computing and Networking, pp. 75–86 (2007)

    Google Scholar 

  2. Bhattacharya, B., Burmester, M., Hu, Y., Kranakis, E., Shi, Q., Wiese, A.: Optimal movement of mobile sensors for barrier coverage of a planar region. Theoretical Computer Science 410, 5515–5528 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chen, A., Kumar, S., Lai, T.H.: Designing localized algorithms for barrier coverage. In: Proc. of the 13th Annual ACM International Conference on Mobile Computing and Networking, pp. 63–74. ACM Press, New York (2007)

    Chapter  Google Scholar 

  4. Czyzowicz, J., Kranakis, E., Krizanc, D., Lambadaris, I., Narayanan, L., Opatrny, J., Stacho, L., Urrutia, J., Yazdani, M.: On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment. In: Ruiz, P.M., Garcia-Luna-Aceves, J.J. (eds.) ADHOC-NOW 2009. LNCS, vol. 5793, pp. 194–212. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  5. Czyzowicz, J., Kranakis, E., Krizanc, D., Lambadaris, I., Narayanan, L., Opatrny, J., Stacho, L., Urrutia, J., Yazdani, M.: On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment. In: Nikolaidis, I., Wu, K. (eds.) ADHOC-NOW 2010. LNCS, vol. 6288, pp. 29–42. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  6. Huang, C.F., Tseng, Y.C.: The coverage problem in a wireless sensor network. In: Proc. of the 2nd ACM International Conference on Wireless Sensor Networks and Applications, WSNA 2003, pp. 115–121. ACM (2003)

    Google Scholar 

  7. Kershner, R.: The Number of Circles Covering a Set. Amer. J. of Mathematics 61, 665–671 (1939)

    Article  MathSciNet  Google Scholar 

  8. Kumar, S., Lai, T.H., Arora, A.: Barrier coverage with wireless sensors. Wireless Networks 13(6), 817–834 (2007)

    Article  Google Scholar 

  9. Lee, S., Chung, W.-K.: Rotating IR sensor system for 2.5d sensing. In: Proceedings of the 2006 IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, pp. 814–819 (2006)

    Google Scholar 

  10. Li, X., Frey, H., Santoro, N., Stojmenovic, I.: Localized sensor self-deployment with coverage guarantee. ACM SIGMOBILE Mobile Computing and Communications Review 12(2), 50–52 (2008)

    Article  Google Scholar 

  11. Scheibe, K., Huang, F., Klette, R.: Pose estimation of rotating sensors in the context of accurate 3d scene modeling. Journal of Universal Computer Science 16(10), 1269–1290 (2010)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dobrev, S., Narayanan, L., Opatrny, J. (2012). Optimal Sensor Networks for Area Monitoring Using Rotating and Beam Sensors. In: Kranakis, E., Krizanc, D., Luccio, F. (eds) Fun with Algorithms. FUN 2012. Lecture Notes in Computer Science, vol 7288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30347-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30347-0_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30346-3

  • Online ISBN: 978-3-642-30347-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics