Multiround Distributed Lifetime Coverage Optimization protocol in wireless sensor networks
Affiliation auteurs | !!!! Error affiliation !!!! |
Titre | Multiround Distributed Lifetime Coverage Optimization protocol in wireless sensor networks |
Type de publication | Journal Article |
Year of Publication | 2018 |
Auteurs | Idrees AKadhum, Deschinkel K, Salomon M, Couturier R |
Journal | JOURNAL OF SUPERCOMPUTING |
Volume | 74 |
Pagination | 1949-1972 |
Date Published | MAY |
Type of Article | Article |
ISSN | 0920-8542 |
Mots-clés | Area coverage, Distributed computation, network lifetime, Optimization, scheduling, Wireless Sensor Networks |
Résumé | Coverage and lifetime are two paramount problems in wireless sensor networks (WSNs). In this paper, a method called Multiround Distributed Lifetime Coverage Optimization protocol (MuDiLCO) is proposed to maintain the coverage and to improve the lifetime in wireless sensor networks. The area of interest is first divided into subregions, and then the MuDiLCO protocol is distributed to the sensor nodes in each subregion. The proposed MuDiLCO protocol works in periods during which sets of sensor nodes are scheduled, with one set for each round of a period, to remain active during the sensing phase and thus ensure coverage so as to maximize the WSN lifetime. The decision process is carried out by a leader node, which solves an optimization problem to produce the best representative sets to be used during the rounds of the sensing phase. The optimization problem formulated as an integer program is solved to optimality through a Branch-and-Bound method for small instances. For larger instances, the best feasible solution found by the solver after a given time limit threshold is considered. Compared with some existing protocols, simulation results based on multiple criteria (energy consumption, coverage ratio, and so on) show that the proposed protocol can prolong efficiently the network lifetime and improve the coverage performance. |
DOI | 10.1007/s11227-017-2203-7 |