Multi-factor-Based Energy-Efficient Clustering and Routing Algorithm for WSN

Abstract

Wireless sensor network (WSN) is an emerging and fast-growing area for research and development. WSN has a vast application in various fields. Wireless sensor network is currently implemented in fields like battlefield surveillance, environmental monitoring, border security surveillance motion tracking. In a large-scale WSNs, the challenging research issue is to design an energy-efficient data gathering protocol. So, the main concern of research in WSN is to arrange the sensors with different capabilities like sensing range, power, communication range in wireless network and provide a route to the sensed data from the sensor in a dynamic manner. The main method used to increase the network lifetime is clustering that increases the energy utilization using topology control. Routing the sensory data to the sink without any hindrance is impossible in clustered wireless sensor network. But it is necessary to eliminate the hindrance in the routing area. Clustering process divides the whole network into clusters and a cluster head (CH) is chosen in each cluster that works as a head during communication process. But, due to higher responsibility CH loses its energy very fast, so there should be an efficient way to select these CHs. In this paper, grouping the sensors into clusters by energy-efficient heterogeneous clustering is performed. CH is selected by using three parameters—(a) delay as a function of nodes residual energy, transmission power, etc.; (b) distance between nodes and respective CH; and (c) distance between CHs and BS. Re-cluster phase is added in the clustering process to restructure the WSN to reduce the energy consumption. The simulation results show that the proposed algorithm is outperformed to the base algorithm and LEACH algorithm.