Optimal shortest path selection using an evolutionary algorithm in wireless sensor networks

Abstract

A wireless sensor network comprises of distributed independent devices, called sensors that monitor the physical conditions of the environment for various applications, such as tracking and observing environmental changes. Sensors have the ability to detect information, process it, and forward it to neighboring sensor nodes. Wireless sensor networks are facing many issues in terms of scalability, which necessitates numerous nodes and network range. The route chosen between the source node and the destination node with the shortest distance determines how well the network performs. In this paper, evolutionary algorithm based shortest path selection provides high end accessibility of path nodes for data transmission among source and destination. It employs the best fitness function methodology, which involves the replication of input, mutation, crossover, and mutation methods, to produce efficient outcomes that align with the best fitness function, thereby determining the shortest path. This is a probabilistic technique that receives input from learning models and provides the best results. The execution results are presented well compared with earlier methodologies in terms of path cost, function values, throughput, packet delivery ratio, and computation time.