Optimal Shortest Path Routing over Wireless Sensor Networks Using Constrained Genetic Firefly Optimization Algorithm

Abstract

In Wireless Sensor Networks (WSNs), a large number of sensor nodes are placed over a specific area in any real-life application. The sensor node is small, with limited battery life, memory, and computing capacity. Due to the limited power of the battery, WSNs must expand the system life by minimizing the energy usage. In the existing system, the methods have limitations related to optimal shortest routing path, node energy consumption, network reconfiguration, and so on. In order to overcome these issues, a Constrained Genetic FireFly Optimization Algorithm (CGFFOA) is proposed. The CGFFOA algorithm is designed to select the best shortest path routing through the selection of Cluster Head (CH) nodes based on the better energy utilization, delay, and high throughput sensor nodes. It is used to optimize the routing path based on the energy, hop count, inter and intra cluster delay, and lifetime. The simulation findings therefore conclude that, with regard to reduced energy consumption, higher throughput, and lower end-to-end delay, the proposed CGFFOA algorithm is preferable to existing methods such as Particle Swarm Optimization (PSO) and Dynamic Source Routing (DSR).