A Hybrid Optimized Weighted Minimum Spanning Tree for the Shortest Intrapath Selection in Wireless Sensor Network

الملخص EN

Wireless sensor network (WSN) consists of sensor nodes that need energy efficient routing techniques as they have limited battery power, computing, and storage resources.

WSN routing protocols should enable reliable multihop communication with energy constraints.

Clustering is an effective way to reduce overheads and when this is aided by effective resource allocation, it results in reduced energy consumption.

In this work, a novel hybrid evolutionary algorithm called Bee Algorithm-Simulated Annealing Weighted Minimal Spanning Tree (BASA-WMST) routing is proposed in which randomly deployed sensor nodes are split into the best possible number of independent clusters with cluster head and optimal route.

The former gathers data from sensors belonging to the cluster, forwarding them to the sink.

The shortest intrapath selection for the cluster is selected using Weighted Minimum Spanning Tree (WMST).

The proposed algorithm computes the distance-based Minimum Spanning Tree (MST) of the weighted graph for the multihop network.

The weights are dynamically changed based on the energy level of each sensor during route selection and optimized using the proposed bee algorithm simulated annealing algorithm.