Efficient Hierarchical Clustering Routing in Wireless Sensor Networks

The routing protocol allows routing data from source to destination through intermediate nodes up to the sink. In the hierarchical routing based on the clustering, every cluster head node forms its cluster with their neighbor nodes. The cluster heads are responsible of their clusters. In fact they coordinate between nodes in the cluster for intra-cluster communication and route data to the other clusters for inter-cluster communication. In this article we propose a centralized and periodic protocol named Efficient Clustering Routing Protocol (ECRP). Our protocol is based on a modified version of CLARANS algorithm; it takes into account the location and the remaining energy of the sensor nodes to divide the sensed area to disjoint and balanced clusters. The simulation results show that the proposed protocol is more efficient than the existing hierarchical protocols in terms of packet delivery ratio, and energy consumption.