Distance-Distributed Energy Efficient Clustering (D-DEEC) Routing Protocol for Wireless Sensor Network

Abstract

A wireless sensor network (WSN) composed of many tiny devices that rely on energy efficient routing protocols for extension of their lifetime. Many cluster-based routing protocols have been proposed based on heterogeneity in recent times. Indeed, these protocols are aiming at achieving energy efficiency, throughputs and better lifetime of the networks. However, two important factors that could have helped some of these protocols to achieve the above-mentioned aims are really missing. Factors such as the distance and average distance between nodes and the Base Station (BS) in selecting a cluster head needed to be considered. These were the major challenges that were identified in the Distributed Energy Efficient Clustering (DEEC) protocol after careful study. As a result, the throughputs and the lifetime of the scheme were affected. In this paper, a reviewed hierarchy-based heterogeneous routing protocol called Distance-DEEC (D-DEEC) is proposed to enhance the DEEC protocol. The new algorithm took into account the residual energy, distance of the individual nodes and average distance of all the nodes from the BS in selecting the Cluster Heads (CHs). This has allowed the protocol to select a cluster head that has high residual energy, is closer to the BS and at the same time not too far from its neighbours. The scheme also employed the sleep and awake approach to reduce energy dissipation. The technique allows the Base BS to calculate the maximum energy of distant nodes and determines when such nodes can transmit their report based on a given threshold energy, Eth . The performance of the proposed algorithm was evaluated using MatLab R2018a and the outcomes showed that, D-DEEC protocol outperformed TDEEC in terms of energy consumption, throughputs and the network lifetime.