Energy and Distance Aware Hybrid Optimization Algorithm Formulti _Hop Routing in Wireless Sensor Networks

Abstract

Energy-based efficient routing is a main constraint in wireless sensor network (WSN) newlineenvironment. However, increasing the energy utilization of the sensor nodes can maximize the newlinelifetime of the network that further helps to enhance the network performance. To minimize newlinedelay and distance and also to increase the energy poses complexity issues in the networking newlinedomain. This research developed three contributions to determine the finest path with respect to newlinethe various routing mechanisms. In first contribution, Salp Swarm algorithm (SSA) is introduced newlinefor computation of route with respect to the factors, such as distance and energy. The initial newlineprocess of the developed method is to select the cluster head (CH) and the process of selecting newlinethe CH can make the routing process more accurate, robust and efficient. Here, the nodes with newlineless distance and highest energy is chosen as the CH and the performance evaluated is done by newlineconsidering the metrics, namely delay, energy, throughput and alive nodes. In second newlinecontribution, a Cat-Salp Swarm Algorithm (C-SSA) is developed for finding the secure routes in newlinesensor network. Here, CH is selected by employing Low Energy Adaptive Clustering Hierarchy newline(LEACH) protocol. The LEACH minimizes the traffic in the network. Besides, the member of newlinethe cluster can communicate with CH and thereafter the routing process can be carried out. By newlineseeing the fitness elements, for example energy, distance, delay, lifetime, inter-cluster and intracluster newlinedistance, the selection of optimal routing path can be carried out using the developed newlinemethod called C-SSA, which is devised by the hybridization of Cat Swarm Optimization (CSO) newlinewith the Salp Swarm Algorithm (SSA), respectively. In third contribution, the Taylor C-SSA is newlineintroduced for choosing the optimal paths for the routing process with less delay and distance. newlineThis method undergoes two different phases, namely CH selection phase and data newlinecommunication phase.