Search citation statements
Paper Sections
Citation Types
Year Published
Publication Types
Relationship
Authors
Journals
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.
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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.