Show simple item record

Spatial and temporal robustness for scheduling a target tracking mission using wireless sensor networks

dc.contributor.authorDelavernhe, Florian
hal.structure.identifierLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
dc.contributor.authorRossi, André
dc.contributor.authorSevaux, Marc
dc.date.accessioned2021-11-09T11:42:48Z
dc.date.available2021-11-09T11:42:48Z
dc.date.issued2021
dc.identifier.issn0305-0548
dc.identifier.urihttps://basepub.dauphine.psl.eu/handle/123456789/22177
dc.language.isoenen
dc.subjectLinear programmingen
dc.subjectSensor networken
dc.subjectRobust optimizationen
dc.subjectTarget trackingen
dc.subjectSpatio-temporal uncertaintiesen
dc.subject.ddc005en
dc.titleSpatial and temporal robustness for scheduling a target tracking mission using wireless sensor networksen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenRobust scheduling for target tracking with a wireless sensor network (WSN), focuses on the deployment of a WSN in a remote area to monitor a set of moving targets. Each sensor operates on a battery and is able to communicate with reachable sensors in the network. The targets are typically moving vehicles (planes, trains, cars,…) passing through the area. In order to monitor the targets, an activation schedule is sought such that the sensor network is continuously collecting data about the targets. Additionally, the transfer of the data collected to a base station deployed near the network also has to be planned. In this work, we consider that the trajectories of the targets are estimated. i.e., during the mission, at each time instant t, there is a given position where the target is expected. However, such estimations are inaccurate and deviations can occur. In this work, we formulate the problem of spatial robust scheduling. The aim is to produce an activation schedule for the sensors such that the targets are covered as long as they remain no farther from their estimated positions than a maximized value, called the spatial stability radius of the schedule. Afterwards, we formulate the spatio-temporal robustness problem. It is a bi-objective problem, with a spatial stability radius and a temporal stability radius for covering delays and advances. Two algorithms are proposed to solve these problems, and we show their efficiency through several numerical experiments.en
dc.relation.isversionofjnlnameComputers and Operations Research
dc.relation.isversionofjnlvol132en
dc.relation.isversionofjnldate2021-08
dc.relation.isversionofjnlpages105321en
dc.relation.isversionofdoi10.1016/j.cor.2021.105321en
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelProgrammation, logiciels, organisation des donnéesen
dc.relation.forthcomingnonen
dc.description.ssrncandidatenon
dc.description.halcandidatenonen
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewedouien
dc.date.updated2021-11-09T11:41:11Z
hal.author.functionaut
hal.author.functionaut
hal.author.functionaut


Files in this item

Thumbnail
Name:
Spatial_temporal_robustness.pdf
Size:
1007.Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record