A Cluster-Based Routing Protocol for WSN Based on Mahalanobis Distance and AODV Protocol

Wireless sensor networks (WSN) have a huge amount of sensor nodes that are randomly deployed in the interested region to monitor the environment. In WSNs, the energy efficiency is considered a challenging task during data transmission. The Mahalanobis distance-based cluster head selection is proposed to solve the issues related to the energy constraint. Next, ad hoc on-demand distance vector routing protocol is used to find the optimal path between the source to base station via cluster heads. The performance of this Mahalanobis method is analyzed in terms of energy consumption, throughput, packet loss ratio, end-to-end delay (EED), and average delay ratio. The Mahalanobis method is compared with weighted energy-efficient clustering with robust routing (WECRR), improved artificial bee colony (iABC), adaptive energy-aware cluster-based routing (AECR), evolutionary multipath energy-efficient routing (EMEER), k-means algorithm, and energy-aware cluster-based routing protocol (ECRP). The energy consumption of the Mahalanobis method is 0.641 J for 75 nodes; it is less than the existing methods.