An Energy-efficient Routing Protocol Based on DPC-MND Clustering in WSNs

Abstract

AbstractEnergy Efficiency has become a primary issue in wireless sensor networks (WSNs). Due to the non-uniform distribution and difficulty in supplementing energy of nodes in large-scale WSNs, the design of energy-efficient routing protocols for wireless sensor networks has become a challenge nowadays. It has been already proved that one of the essential approaches to improve WSNs performance is clustering, routing, and data aggregation. However, the main problem dealt with the selection of optimal CH that reduces energy consumption. Till now, more research works have been processing on solving this issue by considering different constraints. Under this scenario, this paper proposes An Energy-efficient Routing Protocol DMBERP(DPC-MND based energy-efficient routing protocol)Based on DPC-MND(Density Peaks Clustering based on Mutual Neighborhood Degrees). This protocol uses an improved DPC-MND clustering algorithm to cluster the nodes in WSNs. Then, in each cluster, two cluster heads are elected according to the residual energy of the node and the distance to the base station. The primary cluster head is responsible for routing and forwarding, and the secondary cluster head is responsible for data collection in the cluster. Finally, a dynamic multi-hop routing between clusters is designed according to the energy, distance and other factors. The experimental results show that the routing protocol proposed in this paper achieves better performance in balancing node energy consumption and prolonging network lifetime.KeywordsWireless sensor networkRouting algorithmmulti-hopClusteringDensity Peaks Clustering based on Mutual Neighborhood Degrees(DPC-MND)