Premium
Node placement optimization using particle swarm optimization and iterated local search algorithm in wireless sensor networks
Author(s) -
Chelbi Slaheddine,
Dhahri Habib,
Bouaziz Rafik
Publication year - 2021
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.4813
Subject(s) - particle swarm optimization , computer science , wireless sensor network , node (physics) , relay , iterated local search , position (finance) , mathematical optimization , algorithm , genetic algorithm , swarm behaviour , local search (optimization) , mathematics , computer network , artificial intelligence , power (physics) , physics , structural engineering , finance , quantum mechanics , machine learning , engineering , economics
Summary Coverage and connectivity are the two most challenging issues in target‐based wireless sensor networks (WSNs). For that, node placement is one of the fundamental concerns that affect the performance of coverage and connectivity in WSN. This paper introduces a new approach by combining particle swarm optimization and iterated local search (PSO‐ILS) to have an optimum coverage and connectivity rate with the minimum number of nodes. In one side, to maintain the full coverage of targets, the PSO‐ILS is used to deploy the minimum number of sensor nodes. In other side, to achieve the full connectivity, the optimal position determination (OPD) algorithm was conceived to identify the optimal candidate positions which can be used by the PSO‐ILS to place the minimum number of relay nodes. The obtained results considered over a number of runs are compared with canonical PSO, differential evolution (DE), and genetic algorithms (GAs). The outcomes derived from this comprehensive analysis determine that PSO‐ILS provides an effectual improvement in contrary to the methods PSO, DE, and GA in terms of the selected potential positions to ensure full coverage of target points and the number of relay nodes required to achieve full connectivity.