Skip to main content
Conference Proceedings

Min-density stripe covering and applications in sensor networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6784 LNCS(PART 3) 152-162
DOI: 10.1007/978-3-642-21931-3_13
14Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A problem of min-density covering of a stripe by the disks of one, two and three radii is considered. New regular covers are proposed and studied. The developed methods and the obtained results are important theoretically and may be used as a tool for power-efficient monitoring of lengthy objects by sensor networks. © 2011 Springer-Verlag.

Author supplied keywords

Cite

CITATION STYLE

APA

Erzin, A. I., & Astrakov, S. N. (2011). Min-density stripe covering and applications in sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6784 LNCS, pp. 152–162). https://doi.org/10.1007/978-3-642-21931-3_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free