To access the full text documents, please follow this link:

Minimizing the range for k-covered paths on sensor networks
Abellanas, Manuel; Bajuelos, Antonio L.; Pereira de Matos, Inés
Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II; Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
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.
Peer Reviewed
Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria
Geometria algebraica
Attribution-NonCommercial-NoDerivs 3.0 Spain
Wiley Heyden

Show full item record

Related documents

Other documents of the same author

Abellanas, Manuel; Bajuelos, Antonio L.; Canales, Santiago; Claverol Aguas, Mercè; Hernández, Gregorio; Pereira de Matos, Inés
Abellanas, Manuel; Hernández, Gregorio; Moreno, José Luis; Ordóñez, Sergio; Sacristán Adinolfi, Vera
Abellanas, Manuel; Hernández, Gregorio; Sacristán Adinolfi, Vera
Abellanas, Manuel; Bose, Prosenjit; García López de Lacalle, Jesús; Hurtado Díaz, Fernando Alfredo; Nicolás, Carlos M.; Ramos, Pedro A.
Abellanas, Manuel; Claverol Aguas, Mercè; Hernández-Peñalver, Gregorio; Hurtado Díaz, Fernando Alfredo; Sacristán Adinolfi, Vera; Saumell Mendiola, Maria; Silveira, Rodrigo Ignacio