Advertisement

Uninterrupted Coverage of a Planar Region with Rotating Directional Antennae

  • Evangelos Kranakis
  • Fraser MacQuarie
  • Oscar Morales-Ponce
  • Jorge Urrutia
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7363)

Abstract

Assume that n directional antennae located at distinct points in the plane are rotating at constant identical speeds. They all have identical range and sensor angle (or field of view). We propose and study the Rotating Antennae Coverage Problem, a new problem concerning rotating sensors for the uninterrupted coverage of a region in the plane. More specifically, what is the initial orientation of the sensors, minimum angle, and range required so that a given (infinite or finite) line or planar domain is covered by the rotating sensors at all times? We give algorithms for determining the initial orientation of the sensors and analyze the resulting angle/range tradeoffs for ensuring continuous coverage of a given region or line in the plane with identical rotating sensors of given transmission angle and range. We also investigate other variants of the problem whereby for a given parameter T (representing time) there is no point in the domain that is left unattended by some sensor for a period of time longer than T. Despite the apparent simplicity of the problem several of the algorithms proposed are intricate and elegant. We have also implemented our algorithms in C++ and the code can be downloaded on the web.

keywords and Phrases

Angle Antenna Constant Speed Coverage Floodlights Rotating Sensors 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cardei, M., Wu, J.: Energy-efficient coverage problems in wireless ad-hoc sensor networks. Computer Communications 29(4), 413–420 (2006)CrossRefGoogle Scholar
  2. 2.
    Chvatal, V.: A combinatorial theorem in plane geometry. Journal of Combinatorial Theory, Series B 18(1), 39–41 (1975)MathSciNetzbMATHCrossRefGoogle Scholar
  3. 3.
    Fisk, S.: A short proof of chvátal’s watchman theorem. Journal of Combinatorial Theory, Series B 24(3), 374 (1978)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    González-Baños, H.: A randomized art-gallery algorithm for sensor placement. In: Proceedings of the Seventeenth Annual Symposium on Computational Geometry, pp. 232–240. ACM (2001)Google Scholar
  5. 5.
    Gupta, H., Das, S.R., Gu, Q.: Connected sensor cover: self-organization of sensor networks for efficient query execution. In: Proceedings of the 4th ACM International Symposium on Mobile Ad hoc Networking & Computing, pp. 189–200. ACM (2003)Google Scholar
  6. 6.
    Huang, C.F., Tseng, Y.C.: The coverage problem in a wireless sensor network. Mobile Networks and Applications 10(4), 519–528 (2005)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Lee, D., Lin, A.: Computational complexity of art gallery problems. IEEE Transactions on Information Theory 32(2), 276–282 (1986)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage problems in wireless ad-hoc sensor networks. In: INFOCOM 2001: Proceedings of Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3, pp. 1380–1387. IEEE (2001)Google Scholar
  9. 9.
    O’Rourke, J.: Art gallery theorems and algorithms, vol. 57. Oxford University Press, Oxford (1987)zbMATHGoogle Scholar
  10. 10.
    Poduri, S., Sukhatme, G.S.: Constrained coverage for mobile sensor networks. In: 2004 Proceedings of IEEE International Conference on Robotics and Automation, ICRA 2004, vol. 1, pp. 165–171. IEEE (2004)Google Scholar
  11. 11.
    Urrutia, J.: Art gallery and illumination problems. In: Handbook of Computational Geometry, pp. 973–1027 (2000)Google Scholar
  12. 12.
    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 1st International Conference on Embedded Networked Sensor Systems, pp. 28–39. ACM (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Evangelos Kranakis
    • 1
  • Fraser MacQuarie
    • 1
  • Oscar Morales-Ponce
    • 1
  • Jorge Urrutia
    • 2
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada
  2. 2.Instituto de MatemáticasUniversidad Nacional Autónoma de MéxicoMéxico

Personalised recommendations