Minimizing the range for k-covered paths on sensor networks

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,...

ver descrição completa

Detalhes bibliográficos
Autores: Abellanas, Manuel, Bajuelos, Antonio L., Pereira de Matos, Inés
Formato: artículo
Fecha de publicación:2011
País:España
Recursos:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/13767
Acesso em linha:https://hdl.handle.net/2117/13767
https://dx.doi.org/10.1093/comjnl/bxr076
Access Level:acceso abierto
Palavra-chave:Geometry
Geometria algebraica
51 GEOMETRY
Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria
id ES_1ac136217dfd5ceb2f02c5e59c49213c
oai_identifier_str oai:upcommons.upc.edu:2117/13767
network_acronym_str ES
network_name_str España
repository_id_str
spelling Minimizing the range for k-covered paths on sensor networksAbellanas, ManuelBajuelos, Antonio L.Pereira de Matos, InésGeometryGeometria algebraica51 GEOMETRYÀrees temàtiques de la UPC::Matemàtiques i estadística::GeometriaCoverage 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 ReviewedWiley Heyden20112011-08-1620112011-11-08journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/2117/13767https://dx.doi.org/10.1093/comjnl/bxr076reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Attribution-NonCommercial-NoDerivs 3.0 Spainhttp://creativecommons.org/licenses/by-nc-nd/3.0/es/info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/137672026-05-27T15:37:01Z
dc.title.none.fl_str_mv Minimizing the range for k-covered paths on sensor networks
title Minimizing the range for k-covered paths on sensor networks
spellingShingle Minimizing the range for k-covered paths on sensor networks
Abellanas, Manuel
Geometry
Geometria algebraica
51 GEOMETRY
Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria
title_short Minimizing the range for k-covered paths on sensor networks
title_full Minimizing the range for k-covered paths on sensor networks
title_fullStr Minimizing the range for k-covered paths on sensor networks
title_full_unstemmed Minimizing the range for k-covered paths on sensor networks
title_sort Minimizing the range for k-covered paths on sensor networks
dc.creator.none.fl_str_mv Abellanas, Manuel
Bajuelos, Antonio L.
Pereira de Matos, Inés
author Abellanas, Manuel
author_facet Abellanas, Manuel
Bajuelos, Antonio L.
Pereira de Matos, Inés
author_role author
author2 Bajuelos, Antonio L.
Pereira de Matos, Inés
author2_role author
author
dc.subject.none.fl_str_mv Geometry
Geometria algebraica
51 GEOMETRY
Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria
topic Geometry
Geometria algebraica
51 GEOMETRY
Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria
description 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.
publishDate 2011
dc.date.none.fl_str_mv 2011
2011-08-16
2011
2011-11-08
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/13767
https://dx.doi.org/10.1093/comjnl/bxr076
url https://hdl.handle.net/2117/13767
https://dx.doi.org/10.1093/comjnl/bxr076
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Wiley Heyden
publisher.none.fl_str_mv Wiley Heyden
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869404124811886592
score 15,301603

Registos relacionados