Minimizing the range for k-covered paths on sensor networks

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/13767

dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II
dc.contributor	Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
dc.contributor.author	Abellanas, Manuel
dc.contributor.author	Bajuelos, Antonio L.
dc.contributor.author	Pereira de Matos, Inés
dc.date	2011-08-16
dc.identifier.citation	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.
dc.identifier.citation	0010-4620
dc.identifier.citation	10.1093/comjnl/bxr076
dc.identifier.uri	http://hdl.handle.net/2117/13767
dc.language.iso	eng
dc.publisher	Wiley Heyden
dc.relation	http://comjnl.oxfordjournals.org/content/early/2011/08/16/comjnl.bxr076.abstract
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	http://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subject	Àrees temàtiques de la UPC::Matemàtiques i estadística::Geometria
dc.subject	Geometry
dc.subject	Geometria algebraica
dc.subject	51 GEOMETRY
dc.title	Minimizing the range for k-covered paths on sensor networks
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/article
dc.description.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.
dc.description.abstract	Peer Reviewed

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author