Perbandingan Metode Floyd-Warshall dan Dijkstra pada Pencarian Rute Terpendek Wireless Sensor Network Menggunakan Matlab

Abstract

In the field of computer network science, network mapping has been systematically organized using various applications. However, regardless of these applications, mapping to determine the shortest route in a network is still minimally performed. The shortest route in a network can be determined using various algorithms such as Floyd-Warshall, Dijkstra, Greedy, and others. This research aims to fill the research gap in comparing the Floyd-Warshall and Dijkstra methods to find the shortest path in the context of wireless sensor networks using Matlab. The main focus of this study is the efficiency of both methods. The results obtained show that the Floyd-Warshall method has a faster execution time compared to the Dijkstra method. For example, in a WSN with 50 nodes, Floyd-Warshall has an execution time of 0.000079 s, while Dijkstra has an execution time of 0.013991 s. The energy consumption and Quality of Service (QoS) results obtained through the shortest path network nodes are all good. For 50 nodes, the energy consumption is 0.0319712 J/bit, throughput is 3.990740 Mbps, packet loss is 13.5679%, and delay is 174.682 ms.