A Clustering Routing based on Dijkstra Algorithm for WSNs

Abstract

Wireless Sensor Networks (WSNs) have witnessed a growing interest in the last two decades owing to its various advantages. Thus, in a big WSN, using one hop transmission, as in LEACH algorithm, causes loss of a lot of energy. To mitigate this loss, a new Clustering Routing based on Dijkstra Algorithm (C.R.D.A) is proposed in this paper. Our main objective in the proposed C.R.D.A is to define a new clustering routing algorithm allowing to reduce power consumption. Therefore, we used a game theory model to find the optimal placement of the sink node. This last searches the best number of clusters using ELBOW method and divides the network into k-{opt} clusters using K-means clustering algorithm. Then, it elects the cluster head of each cluster based on two criteria: the distance to the cluster centroid and the residual energy of nodes. Dijkstra algorithm is applied to select the set of reliable relays which offer the least transmit power to route data inter and intra clusters. The performance of our proposed algorithm is compared to LEACH algorithm. Simulations results demonstrate that the proposed C.R.D.A minimizes significantly the power consumption than LEACH algorithm and consequently prolong the lifetime of WSN.