TU Darmstadt / ULB / TUprints

Coverage and Lifetime Optimization by Self-Optimizing Sensor Networks †

Seredyński, Franciszek ; Kulpa, Tomasz ; Hoffmann, Rolf ; Désérable, Dominique (2023)
Coverage and Lifetime Optimization by Self-Optimizing Sensor Networks †.
In: Sensors, 2023, 23 (8)
doi: 10.26083/tuprints-00023802
Article, Secondary publication, Publisher's Version

[img] Text
sensors-23-03930.pdf
Copyright Information: CC BY 4.0 International - Creative Commons, Attribution.

Download (2MB)
Item Type: Article
Type of entry: Secondary publication
Title: Coverage and Lifetime Optimization by Self-Optimizing Sensor Networks †
Language: English
Date: 12 May 2023
Place of Publication: Darmstadt
Year of primary publication: 2023
Publisher: MDPI
Journal or Publication Title: Sensors
Volume of the journal: 23
Issue Number: 8
Collation: 24 Seiten
DOI: 10.26083/tuprints-00023802
Corresponding Links:
Origin: Secondary publication DeepGreen
Abstract:

We propose an approach to self-optimizing wireless sensor networks (WSNs) which are able to find, in a fully distributed way, a solution to a coverage and lifetime optimization problem. The proposed approach is based on three components: (a) a multi-agent, social-like interpreted system, where the modeling of agents, discrete space, and time is provided by a 2-dimensional second-order cellular automata, (b) the interaction between agents is described in terms of the spatial prisoner’s dilemma game, and (c) a local evolutionary mechanism of competition between agents exists. Nodes of a WSN graph created for a given deployment of WSN in the monitored area are considered agents of a multi-agent system that collectively make decisions to turn on or turn off their batteries. Agents are controlled by cellular automata (CA)-based players participating in a variant of the spatial prisoner’s dilemma iterated game. We propose for players participating in this game a local payoff function that incorporates issues of area coverage and sensors energy spending. Rewards obtained by agent players depend not only on their personal decisions but also on their neighbor’s decisions. Agents act in such a way to maximize their own rewards, which results in achieving by them a solution corresponding to the Nash equilibrium point. We show that the system is self-optimizing, i.e., can optimize in a distributed way global criteria related to WSN and not known for agents, provide a balance between requested coverage and spending energy, and result in expanding the WSN lifetime. The solutions proposed by the multi-agent system fulfill the Pareto optimality principles, and the desired quality of solutions can be controlled by user-defined parameters. The proposed approach is validated by a number of experimental results.

Uncontrolled Keywords: collective behavior, network coverage and lifetime, second-order CA, self-optimizing networks, spatial prisoner’s dilemma, wireless sensor networks
Status: Publisher's Version
URN: urn:nbn:de:tuda-tuprints-238025
Additional Information:

†“Towards Self–optimizing Sensor Networks: Game–Theoretic Second–Order CA–Based Approach” presented at 15th International Conference on Cellular Automata for Research and Industry, ACRI 2022, Geneva, Switzerland, 12–15 September 2022, Proceedings.

This article belongs to the Special Issue Data, Signal and Image Processing and Applications in Sensors III

Classification DDC: 000 Generalities, computers, information > 004 Computer science
Divisions: 20 Department of Computer Science > Computer Architecture
Date Deposited: 12 May 2023 08:04
Last Modified: 14 Nov 2023 19:05
SWORD Depositor: Deep Green
URI: https://tuprints.ulb.tu-darmstadt.de/id/eprint/23802
PPN: 50991473X
Export:
Actions (login required)
View Item View Item