Skip to Main content Skip to Navigation
Book sections

Scheduling Sensors Activity in Wireless Sensor Networks

Abstract : In this paper we consider Maximal Lifetime Coverage Prob- lem in Wireless Sensor Networks which is formulated as a scheduling problem related to activity of sensors equipped at battery units and monitoring a two-dimensional space in time. The problem is known as an NP-hard and to solve it we propose two heuristics which use specific knowledge about the problem. The first one is proposed by us stochastic greedy algorithm and the second one is metaheuristic known as Simu- lated Annealing. The performance of both algorithms is verified by a number of numerical experiments. Comparison of the results show that while both algorithms provide results of similar quality, but greedy algo- rithm is slightly better in the sense of computational time complexity.
Complete list of metadata
Contributor : Frédéric Guinand Connect in order to contact the contributor
Submitted on : Thursday, September 23, 2021 - 1:08:23 PM
Last modification on : Wednesday, November 3, 2021 - 4:17:04 AM
Long-term archiving on: : Friday, December 24, 2021 - 6:01:22 PM


Files produced by the author(s)



Antonina Tretyakova, Franciszek Seredynski, Frédéric Guinand. Scheduling Sensors Activity in Wireless Sensor Networks. Computational Collective Intelligence: 9th International Conference, ICCCI 2017, Nicosia, Cyprus, September 27-29, 2017, Proceedings, Part I, pp.442-451, 2017, ⟨10.1007/978-3-319-67074-4⟩. ⟨hal-02122776⟩



Les métriques sont temporairement indisponibles