Multi-robot Patrolling in Wireless Sensor Networks using Bounded Cycle Coverage

Abstract : Patrolling is mainly used in situations where the need of repeatedly visiting certain places is critical. In this paper, we consider a deployment of a wireless sensor network (WSN) that cannot be fully meshed because of the distance or obstacles. Several robots are then in charge of getting close enough to the nodes in order to connect to them, and perform a patrol to collect all the data in time. We discuss the problem of multi-robot patrolling within the constrained wireless networking settings. We show that this is fundamentally a problem of vertex coverage with bounded simple cycles (CBSC). We offer a formalization of the CBSC problem and prove it is NP-hard and at least as hard as the Traveling Salesman Problem (TSP). Then, we provide and analyze heuristics relying on clusterings and geometric techniques. The performances of our solutions are assessed in regards to robot limitations (storage and energy), networking parameters, but also to random and particular graph models.
Type de document :
Communication dans un congrès
ICTAI 2016 28th International Conference on Tools with Artificial Intelligence, Nov 2016, San Jose, United States
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01357866
Contributeur : Olivier Simonin <>
Soumis le : mardi 30 août 2016 - 15:25:22
Dernière modification le : mercredi 31 août 2016 - 01:04:35

Identifiants

  • HAL Id : hal-01357866, version 1

Collections

Citation

Mihai-Ioan Popescu, Hervé Rivano, Olivier Simonin. Multi-robot Patrolling in Wireless Sensor Networks using Bounded Cycle Coverage. ICTAI 2016 28th International Conference on Tools with Artificial Intelligence, Nov 2016, San Jose, United States. <hal-01357866>

Partager

Métriques

Consultations de la notice

241