Multi-Objective Spider Monkey Optimization for Energy Efficient clustering and Routing in wireless sensor networks

Abstract

In wireless sensor network (WSN), the gateways far away from the base station (BS) uses the gateways nearer to the BS to forward the data. It causes heavy traffic to the gateways in proximity with the BS. They need to manage this heavy traffic load but it leads to additional energy consumption and reduction in network lifetime. In order to overcome these issues, loads around the gateways need to be balanced. In this paper, multi objective based spider monkey optimization (MOSMO) has been presented to balance the load and to improve the network lifetime through energy efficient routing and clustering. The objective functions such as routing fitness and clustering fitness have been considered for optimal routing and clustering. The routing fitness function is found by incorporating both the minimum distance traversed by the gateways and minimum number of the gateway hops. The clustering fitness function is the minimum fitness function of gateways. The fitness function of each gateway is computed based on both the mean load of gateways as well as the distance between gateways and BS. The performance of the proposed MOSMO based routing and clustering scheme is compared with the existing Particle Swarm Optimization (PSO) and Grey Wolf Optimization (GWO) based routing and clustering scheme. The QoS features such as delay, energy consumption, delivery ratio, throughput and network lifetime with various node density are analyzed. The proposed work is simulated using MATLAB. The results show that, the reduction in delay and energy consumption is about 18% and 17% respectively whereas improvement in delivery ratio, throughput and network life time is about 15%, 24% and 19% respectively when compared to the existing PSO and GWO methods.

An Optimized Reinforcement Learning-Based Routing Protocol Using Spider Monkey Optimization Algorithm

“…Similarly, authors in [16] have compared the work with several Routing algorithms, and the comparison between these protocols for Routing is elaborated. However, the proposed routing protocol depends upon the network organization (flat architecture, hierarchical architecture, and location architecture), Routing discovery (reactive, proactive, and hybrid), and protocol operation (negotiation-based, multipath-based, query-based, QoS based, and coherent-based).…”