Design of improved deer hunting optimization enabled multihop routing protocol for wireless sensor networks
D. Lubin Balasubramanian, V. Govindasamy
Abstract
A wireless sensor network (WSN) encompasses a huge set of sensor nodes employed to collect data and transmit it to a base station (BS). Due to its compact, inexpensive, and scalable nature of sensors, WSN finds its applicability in diverse real-time applications. The battery-operated sensor nodes necessitate the design of a multi-hop routing protocol for the effective utilization of available energy in the network. Routing can be considered an optimization problem and can be solved by the design of bioinspired algorithms. This study introduces an improved deer hunting optimization-enabled multihop routing (IDHO-MHR) protocol for WSN. The major intention of the IDHO-MHR approach is to optimally find the routes to the destination in WSN. The IDHO algorithm is initially derived by the incorporation of the Nelder Mead (NM) concept into the traditional DHO algorithm. In addition, the IDHO-MHR technique primarily derives a fitness function with the inclusion of two major variables, namely residual energy (RE) and distance. The nodes with higher RE and minimum distance have the probability of becoming optimal routes from the networks. The performance validation of the IDHO-MHR approach is performed, and the outcomes are inspected in various aspects. The experimental outcomes reported the supremacy of the IDHO-MHR protocol over the other recent approaches.