INVESTIGATION OF SENSOR NODE PLACEMENT ON A PLANE USING A GENETIC ALGORITHM

The study focuses on investigating the efficiency of a genetic algorithm-based sensor node placement method for a random topology. The primary objective is to identify a node configuration that minimizes the number of "blind spots" and ensures the most efficient coverage of a given area. Random node placement is characterized by the potential for each node to establish connections with other nodes, resulting in a complex search space. For this study, 25 nodes with identical sensing radii were analyzed. Based on the authors' research and the use of custom-developed software, optimal parameter values for the genetic algorithm were determined, and simulation results were presented. The effectiveness of the sensor placement method was evaluated with an increasing number of generations, reflecting the algorithm's ability to identify optimal solutions. In scenarios with 25 generations, there were numerous overlapping zones between nodes. However, as the number of generations increased, a more optimal node placement was observed. To analyze the algorithm's performance, the relationship between the fitness function value and the number of generations was used. The results demonstrated that the maximum fitness function value increased most significantly during the initial phase of the evolutionary process. Subsequently, the quality of the solutions (maximum and average fitness values) improved substantially with an increasing number of generations. The most optimal placement of 25 nodes with a sensing radius of 30 meters on a 100 × 100 m plane was achieved with 152 generations. A chromosome representing the optimal placement of the 25 nodes on the studied area was provided. To achieve synergy between topology and the routing algorithm, a route was constructed between two sensor nodes. The distance matrix for the nodes, a graph model of the network, and the generated route were presented. The research findings hold practical significance for the design and operation of sensor networks with arbitrary topology, enhancing their reliability and performance under uncertain node placement conditions.

Authors

Publication Details

Journal
Information and communication technologies electronic engineering
Published
2025-05-01
DOI
https://doi.org/10.23939/ictee2025.01.082
Primary Topic
Energy Efficient Wireless Sensor Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

INVESTIGATION OF SENSOR NODE PLACEMENT ON A PLANE USING A GENETIC ALGORITHM

Yuliia Pyrih, Yaroslav Pyrih
Information and communication technologies electronic engineering
Energy Efficient Wireless Sensor Networks
article

INVESTIGATION OF SENSOR NODE PLACEMENT ON A PLANE USING A GENETIC ALGORITHM

Yuliia Pyrih, Yaroslav Pyrih
article en

Abstract

The study focuses on investigating the efficiency of a genetic algorithm-based sensor node placement method for a random topology. The primary objective is to identify a node configuration that minimizes the number of "blind spots" and ensures the most efficient coverage of a given area. Random node placement is characterized by the potential for each node to establish connections with other nodes, resulting in a complex search space. For this study, 25 nodes with identical sensing radii were analyzed. Based on the authors' research and the use of custom-developed software, optimal parameter values for the genetic algorithm were determined, and simulation results were presented. The effectiveness of the sensor placement method was evaluated with an increasing number of generations, reflecting the algorithm's ability to identify optimal solutions. In scenarios with 25 generations, there were numerous overlapping zones between nodes. However, as the number of generations increased, a more optimal node placement was observed. To analyze the algorithm's performance, the relationship between the fitness function value and the number of generations was used. The results demonstrated that the maximum fitness function value increased most significantly during the initial phase of the evolutionary process. Subsequently, the quality of the solutions (maximum and average fitness values) improved substantially with an increasing number of generations. The most optimal placement of 25 nodes with a sensing radius of 30 meters on a 100 × 100 m plane was achieved with 152 generations. A chromosome representing the optimal placement of the 25 nodes on the studied area was provided. To achieve synergy between topology and the routing algorithm, a route was constructed between two sensor nodes. The distance matrix for the nodes, a graph model of the network, and the generated route were presented. The research findings hold practical significance for the design and operation of sensor networks with arbitrary topology, enhancing their reliability and performance under uncertain node placement conditions.

Information and communication technologies electronic engineeringVol. 5(1)
Openalex Percentile: Top 91%
Energy Efficient Wireless Sensor Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.