Parallel Genetic Algorithm for Sink Nodes Placement to Maximize Network Reliability

A parallel genetic algorithm for optimizing the location of sink nodes of a wireless sensor network is proposed. As an optimization criterion we consider a reliability of a wireless sensor network under the assumption that nodes of a wireless sensor network are subject of random independent failures...

Full description

Saved in:
Bibliographic Details
Published in2021 17th International Asian School-Seminar "Optimization Problems of Complex Systems (OPCS) pp. 126 - 129
Main Authors Tarasov, Aleksandr, Migov, Denis
Format Conference Proceeding
LanguageEnglish
Published IEEE 13.09.2021
Subjects
Complex systems
factorization method
genetic algorithm
Mathematical models
Network optimization
network reliability
Optimization
parallel algorithm
Parallel algorithms
random graph
Reliability
Sensors
wireless sensor network
Wireless sensor networks
Online AccessGet full text

Cover

More Information
Summary:A parallel genetic algorithm for optimizing the location of sink nodes of a wireless sensor network is proposed. As an optimization criterion we consider a reliability of a wireless sensor network under the assumption that nodes of a wireless sensor network are subject of random independent failures due to scuffing, intrusions, or other reasons. As a result, some sensors can become disconnected from sink nodes that collect data from all the sensors. A random graph with unreliable nodes and absolutely reliable edges is used as a model of such wireless sensor networks. By wireless sensor network reliability we mean the mathematical expectation of the number of sensors connected to any sink node (MENC). For reliability calculation a well-known factoring method is used. Various optimization algorithms are considered: a canonical genetic algorithm, a module genetic algorithm, an island genetic algorithm, and an island genetic algorithm with migration. The results of the numerical experiments are given.
DOI:10.1109/OPCS53376.2021.9588716