Minimizing the range for k-covered paths on sensor networks
Visualitza/Obre
Cita com:
hdl:2117/13767
Tipus de documentArticle
Data publicació2011-08-16
EditorWiley Heyden
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
Coverage problems are a flourishing topic in optimization, thanks to the recent advances in the field
of wireless sensor networks. The main coverage issue centres around critical conditions that require
reliable monitoring and prohibit failures. This issue can be addressed by maximal-exposure paths,
regarding which this article presents new results. Namely, it shows how to minimize the sensing range
of a set of sensors in order to ensure the existence of a k-covered path between two points on a given
region. Such a path’s coverage depends on k ≥ 2, which is fixed. The three types of regions studied
are: a planar graph, the whole plane and a polygonal region.
CitacióABELLANAS, M.; Bajuelos, A.; de Matos, I. Minimizing the range for k-covered paths on sensor networks. "The Computer journal (paper)", 16 Agost 2011, p. 1-13.
ISSN0010-4620
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
comjnl.bxr076.full.pdf | 613,3Kb | Visualitza/Obre |