Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Finding the Quality of Line Coverage of a Sensor Network
(Poster Paper)
verfasst von : Dinesh Dash, Arijit Bishnu, Arobinda Gupta, Subhas C. Nandy
Erschienen in: Distributed Computing and Networking
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The coverage problem in wireless sensor networks addresses the problem of covering a region with sensors. Many different definitions of coverage exist depending on the goal of the coverage. In this paper, we address the problem of covering lines in a bounded rectangular region
R
by a set of sensors. We first introduce two new metrics,
smallest k-covered line segment
and
longest k-uncovered line segment
, for measuring the quality of line coverage achieved by a sensor deployment. Polynomial time algorithms are then proposed for finding the
smallest k-covered axis-parallel line segment
and the
longest k-uncovered axis-parallel line segment
in a bounded rectangular region
R
.