Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Minimizing the range for k-covered paths on sensor networks

Autor
Bajuelos, A.; Pereira de, I.; Abellanas, M.
Tipus d'activitat
Article en revista
Revista
Computer journal
Data de publicació
2011-08-16
Volum
55
Número
11
Pàgina inicial
69
Pàgina final
81
DOI
https://doi.org/10.1093/comjnl/bxr076 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/13767 Obrir en finestra nova
URL
http://comjnl.oxfordjournals.org/content/early/2011/08/16/comjnl.bxr076.abstract Obrir en finestra nova
Resum
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 ...
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.
Grup de recerca
DCG - Discrete and Combinatorial Geometry

Participants

  • Bajuelos, Antonio L.  (autor)
  • Pereira de Matos, Ines  (autor)
  • Abellanas, Manuel  (autor)

Arxius