Energy efficient Dijkstra-based weighted sum minimization routing protocol for WSN
Madiha Razzaq, Goo‐Rak Kwon, Seokjoo Shin · 2018
Wireless sensor networks (WSNs) consist of several wireless sensor nodes which have limited transmission power and processing capabilities. Hierarchical cluster-based routing protocols are considered an efficient technique to route data from sensor nodes to base station. This paper proposes a scheme which considers K-means clustering in cluster formation phase and calculates a weight function for the cluster head selection process. Moreover, it considers an optimal fixed packet size with respect to radio parameters and channel conditions of the transceiver. In data transmission phase, it implements a multiobjective weight function as a link cost using traditional Dijkstra algorithm. This technique results in balanced and efficient energy consumption of nodes within the network. Simulation results show that proposed scheme is better than the CERP and TEEN routing protocol in terms of energy conservation of nodes in the network and increases the throughput of the overall system. It also indicates high scalability and packet delivery rate due to the efficient use of energy in the system.