Show simple item record

dc.contributor.authorDelavernhe, Florian
dc.contributor.authorLersteau, Charly
dc.contributor.authorRossi, André
dc.contributor.authorSevaux, Marc
dc.date.accessioned2020-01-28T14:44:16Z
dc.date.available2020-01-28T14:44:16Z
dc.date.issued2020
dc.identifier.issn0305-0548
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/20486
dc.language.isoenen
dc.subjectLinear programmingen
dc.subjectSensor networken
dc.subjectRobust optimizationen
dc.subjectTarget trackingen
dc.subject.ddc005en
dc.titleRobust scheduling for target tracking using wireless sensor networksen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenA 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.en
dc.relation.isversionofjnlnameComputers and Operations Research
dc.relation.isversionofjnlvol116en
dc.relation.isversionofjnldate2020-04
dc.relation.isversionofdoi10.1016/j.cor.2019.104873en
dc.contributor.countryeditoruniversityotherFRANCE
dc.contributor.countryeditoruniversityotherCHINA
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelProgrammation, logiciels, organisation des donnéesen
dc.relation.forthcomingnonen
dc.relation.forthcomingprintnonen
dc.description.ssrncandidatenonen
dc.description.halcandidateouien
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewedouien
dc.relation.Isversionofjnlpeerreviewedouien
dc.date.updated2020-01-28T11:26:26Z
hal.person.labIds6258
hal.person.labIds115536
hal.person.labIds989
hal.person.labIds199324
hal.faultCode{"duplicate-entry":{"hal-02428547":{"doi":"1.0"}}}


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record