Scheduling Sensors Activity in Wireless Sensor Networks

Antonina Tretyakova (1) , Franciszek Seredynski (1) , Frédéric Guinand (2, 1)

1 UKSW - Dep. of Mathematics and Natural Sciences. Cardinal Stefan Wyszynski University in Warsaw (Poland)
2 RI2C - LITIS - Equipe Réseaux d'interactions et Intelligence Collective

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.

Mots clés: maximum lifetime coverage problem; metaheuristics; energy-efficient coverage preserving protocol

Domaines: Informatique [cs]; Réseaux et télécommunications [cs.NI]; Recherche opérationnelle [math.OC]

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⟩