A routing method with the approach of reducing energy consumption in WSNs with the Jellyfish Search (JS) optimizer algorithm and unequal clustering

Wireless sensor networks are among the most common communication tools used in military and civilian fields. These networks consist of many tiny devices called sensor nodes. Each node has processing capability and different types of memory, transmitter, radio frequency receiver, and power supply. In addition, nodes house sensors and actuators. Batteries usually power sensor nodes and need to operate longer without their presence. In most cases, changing or recharging the battery for sensor nodes is very difficult or even impossible. Designing routing protocols in wireless sensor networks is challenging due to network limitations, with an emphasis on energy efficiency. The proposed method uses a hierarchical routing mechanism to optimize routing using asymmetric clustering. The sensor nodes are asymmetrically clustered in the proposed method, and the cluster heads are selected using the Jellyfish Search (JS) optimizer algorithm. The problem of optimal clustering is an optimization problem, so in this research, the Jellyfish Search algorithm is used to provide the most optimal clusters in routing. Due to the utilization of a search mechanism based on chaos theory in the Jellyfish Search optimization, the proposed method exhibits high accuracy in clustering and optimal routing within wireless sensor networks. Evaluations indicate that the proposed method achieves lower energy consumption and longer network lifetime compared to GWO, MO-PSO, WGWO, and HMBCR algorithms.