Fuzzy-Logic Dijkstra-Based Energy-Efficient Algorithm for Data Transmission in WSNs

Citations Over TimeTop 10% of 2019 papers

Abstract

In wireless sensor networks, clustering routing algorithms have been widely used owing to their high energy-efficiency and scalability. In clustering schemes, the nodes are organized in the form of clusters, and each cluster is governed by a cluster head. Once the cluster heads are selected, they form a backbone network to periodically collect, aggregate, and forward data to the base station using minimum energy (cost) routing. This approach significantly improves the network lifetime. Therefore, a new cluster head selection method that uses a weighted sum method to calculate the weight of each node in the cluster and compare it with the standard weight of that particular cluster is proposed in this paper. The node with a weight closest to the standard cluster weight becomes the cluster head. This technique balances the load distribution and selects the nodes with highest residual energy in the network. Additionally, a data routing scheme is proposed to determine an energy-efficient path from the source to the destination node. This algorithm assigns a weight function to each link on the basis of a fuzzy membership function and intra-cluster communication cost within a cluster. As a result, a minimum weight path is selected using Dijkstra's algorithm that improves the energy efficiency of the overall system. The experimental results show that the proposed algorithm shows better performance than some existing representative methods in the aspects of energy consumption, network lifetime, and system throughput.

Related Papers

• → An improved weighted sum-fuzzy Dijkstra’s algorithm for shortest path problem (iWSFDA)(2022)24 cited
• → Shortest Path Search Futsal Field Location With Dijkstra Algorithm(2018)23 cited
• → Pencarian Rute Terpendek Menggunakan Algoritma Dijkstra dan Astar (A*) pada SIG Berbasis Web untuk Pemetaan Pariwisata Kota Sawahlunto(2011)16 cited
• → Determination of the shortest path in the university campus of Serres: Using the Dijkstra and Bellman‐Ford algorithms(2022)2 cited
• Research on application of network-delaminating in shortest path problem(2009)