• français
    • English
  • français 
    • français
    • English
  • Connexion
JavaScript is disabled for your browser. Some features of this site may not work without it.
Accueil

Afficher

Cette collectionPar Date de CréationAuteursTitresSujetsNoms de revueToute la baseCentres de recherche & CollectionsPar Date de CréationAuteursTitresSujetsNoms de revue

Mon compte

Connexion

Statistiques

Afficher les statistiques d'usage

Robust scheduling for target tracking using wireless sensor networks

Thumbnail
Date
2020
Indexation documentaire
Programmation, logiciels, organisation des données
Subject
Linear programming; Sensor network; Robust optimization; Target tracking
Nom de la revue
Computers and Operations Research
Volume
116
Date de publication
04-2020
Nom de l'éditeur
Elsevier
DOI
http://dx.doi.org/10.1016/j.cor.2019.104873
URI
https://basepub.dauphine.fr/handle/123456789/20486
Collections
  • LAMSADE : Publications
Métadonnées
Afficher la notice complète
Auteur
Delavernhe, Florian
6258 Laboratoire d'Etudes et de Recherche en Informatique d'Angers [LERIA]
Lersteau, Charly
115536 autre
Rossi, André
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Sevaux, Marc
199324 Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance [Lab-STICC]
Type
Article accepté pour publication ou publié
Résumé en anglais
A wireless sensor network (WSN) is a group of sensors deployed in an area, with all of them working on a battery and with direct communications inside the network. A fairly common situation, addressed in this work, is to monitor and record data with a WSN about vehicles (planes, terrestrial vehicles, boats, etc) passing by an area with damaged infrastructures. In such a context, an activation schedule for the sensors ensuring a continuous coverage of all the targets is required. Furthermore, the collected data, in order to be treated, have to be transmitted to a base station in the area, near the sensors. In this work, the future monitoring missions of the network are also taken into account, as well as the energy consumption of the current mission. We also consider that the spatial trajectories of the targets are known, whereas the speed of the targets along their trajectories are estimated, and subject to uncertainty. Hence, the main objective is to seek solutions that can withstand earliness and tardiness from the previsions. We propose a formulation of the problem with three different objectives and a solution method with experiments and results. The objectives are treated in a lexicographic order as follows (i) maximize the robustness schedule to cope with the advances and delaqui leys of the targets, (ii) maximize the minimum of monitoring time we can guarantee in priority areas, (iii) maximize the amount of energy left in the sensor batteries. We propose new upper bounds on the robustness measure, that are exploited by the solution approach whose complexity is shown to be pseudo-polynomial. The solution approach is based on a preprocessing step called discretisation, and the resolution of a series of linear programs.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Cette création est mise à disposition sous un contrat Creative Commons.