SEARCH FOR A DATA TRANSMISSION ROUTE IN A WIRELESS SENSOR NETWORK USING A GENETIC ALGORITHM-Reference-Cited by-同舟云学术

SEARCH FOR A DATA TRANSMISSION ROUTE IN A WIRELESS SENSOR NETWORK USING A GENETIC ALGORITHM

Published:2024-09 Issue:2 Volume:4 Page:72-81
ISSN:2786-4553
Container-title:Information and communication technologies, electronic engineering
language:
Short-container-title:ICTEE

Author:

,Pyrih Ya.^ORCID

Abstract

The article is devoted to the application of a genetic algorithm for determining the optimal route in a wireless sensor network. The paper presents a classification of data routing strategies based on: the method of determining routes, network structure, network operations, and communication organiser. The genetic algorithm is classified as a multi-path routing strategy, since its use allows obtaining a set of routes. Accordingly, when data transmission via the best route is not possible, information from a set of routes is available, which allows obtaining alternative solutions in case of failure of the main route. The main stages of the genetic algorithm are presented: selection, crossing and mutation, with considerable attention paid to setting its parameters, in particular, population size, number of generations, crossover probability and mutation probability. To determine the route in a wireless sensor network, the following set of genetic operators is used: a tournament selection operator, an ordered crossover operator, and a mixing mutation operator, and a function is formed to assess the fitness of each individual (route). To test the performance of the presented genetic algorithm, a software product in the Python programming language was developed using the DEAP library. A network of 25 nodes was modelled, randomly placed on a 100 by 100 area, with each node having a range of 30 metres. To take into account the impossibility of data transmission between nodes with a greater range than the specified one, a distance penalty of 1000 metres is used, which encourages the genetic algorithm to search for shorter routes. The matrix of nodes of the considered network is presented, which contains information about the topology and relationships between nodes. Based on the results of simulation modelling, it is shown that the shortest route between the two considered nodes is established at a number of generations of 150 and a population size of 300. The results also demonstrate a linear increase in the route search time with an increase in the number of generations and population size.

Publisher

Lviv Polytechnic National University

Reference19 articles.

1. [1] Chen, G., & Hu, H.-X. (2022). Finding the Optimal Network Topology for the Distributed Multi-Short-Paths Routing Algorithm - A Genetic Algorithm-Based Approach. 2022 Int. Conference on Intelligent Systems and Computational Intelligence, China, pp, 35-38. doi: 10.1109/ICISCI53188.2022.9941373.

2. [2] Chai, Y. & Zeng, X.J. (2019). An effective routing with delay minimization for multi-hop wireless mesh network, IEEE Global Communications Conference. pp. 1-6, doi: 10.1109/GLOBECOM38437.2019.9013776.

3. [3] Praveen, J. S., & Kumanan. T. (2024). Link Loss Identification and Congestion-Aware Routing in Mobile Wireless Sensor Network, 2024 2nd International Conference on Device Intelligence, Computing and Communication Technologies, India, pp. 585-589, doi: 10.1109/DICCT61038.2024.10532948.

4. [4] Gripsy, J.V., & Jayanthiladevi, A. (2023). Energy Optimization and Dynamic Adaptive Secure Routing for MANET and Sensor Network in IoT, 2023 7th International Conference on Computing Methodologies and Communication (ICCMC), Erode, India, pp. 1283-1290, doi: 10.1109/ICCMC56507.2023.10083519.

5. [5] Aluvala, S., Reddy, G., Al-Jawahry, H.M., Ramadan, G.M., & Pareek, P.K. (2023). Improved Sail Fish Optimizer for Energy Efficient Routing in Wireless Sensor Network, 2023 Int. Conference on Integrated Intelligence and Communication Systems, India, pp. 1-4, doi: 10.1109/ICIICS59993.2023.10421391.