Perancangan Sistem Routing Pada Jaringan Sensor Nirkabel Menggunakan Algoritma SAW-DIJKSTRA
DOI:
https://doi.org/10.22441/jte.2024.v15i3.007Keywords:
SAW, Dijkstra, routing, Shortestpath, WSN, MCDMAbstract
Penentuan jalur adalah hal yang penting dalam proses transportasi dan pertukaran informasi pada sebuah jaringan WSN (Wireless Sensor Network). Perpindahan data dari node asal menuju node tujuan harus dilakukan dengan mempertimbangkan nilai dari kriteria-kriteria yang ada pada setiap node selama perjalanan, agar data dapat dikirim dengan optimal dan efisien. Tujuan utama dari penelitian ini adalah mengidentifikasi jalur terbaik berdasarkan beberapa kriteria. Metode SAW (Simple Additive Weighting) merupakan algoritma MCDM (Multi Criteria Decision Making) sedangkan Dijkstra merupakan algoritma shortestpath yang hanya dapat mempertimbangkan satu kriteria saja. Untuk mencapai tujuan utama, yaitu, menentukan jalur terbaik, diterapkan algoritma SAW-Dijkstra. Pada penelitian ini, algoritma gabungan SAW-Dijkstra ditinjau dan diperbandingkan dengan algoritma SAW tanpa Dijkstra dalam sebuah skema jaringan dengan nilai kriteria yang sama menggunakan simulasi pada sebuah aplikasi web yang telah dirancang sedemikian rupa. Hasil dari penelitian ini menunjukkan bahwa algoritma SAW-Dijkstra mendapatkan kinerja yang lebih baik, dimana pada jaringan 4x3, SAW memperoleh nilai rata-rata delay dan loss sebesar 51.8 dan 20.5, sedangkan SAW-Dijkstra memperoleh nilai rata-rata sebesar 33.5 dan 13.4, sehingga SAW-Dijkstra lebih optimal 35.33% (delay) dan 34.63% (loss) dibandingkan dengan SAW, begitu pula pada jaringan 5x5, SAW memperoleh nilai rata-rata delay, loss, throughput dan jitter sebesar 76.2, 41.1, 4930.6, dan 104.1 sedangkan SAW-Dijkstra memperoleh nilai rata-rata sebesar 47.8, 22.2, 2836.3 dan 67, sehingga SAW-Dijkstra lebih optimal 37.27% (delay), 45.99% (loss), 42.48% (throughput), dan 35.64% (jitter) dibandingkan dengan SAW. Algoritma SAW-Dijkstra dapat diterapkan pada berbagai macam topologi jaringan dengan berbagai macam skala dan juga dapat diterapkan tidak hanya khusus pada jaringan WSN, melainkan pada jaringan-jaringan yang lainnya.
Downloads
References
S. Broumi, A. Bakal, M. Talea, F. Smarandache, and L. Vladareanu, “Applying Dijkstra algorithm for solving neutrosophic shortest path problem,” in International Conference on Advanced Mechatronic Systems, ICAMechS, 2016.
E. Roghanian and Z. S. Kebria, “The combination of TOPSIS method and Dijkstra’s algorithm in multi-attribute routing,” Sci. Iran., vol. 24, no. 5, pp. 2540–2549, 2017.
T. Kien Hua and N. Abdullah, “Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria,” J. Comput. Sci. Comput. Math., vol. 8, no. 3, 2018.
G. P. N. Hakim, A. Firdausi, and M. Hafidz, “Wireless Sensor Network Routing Using Fuzzy Topsis Algorithm to Provide Best Path Quality of Service,” Technol. Reports Kansai Univ., vol. 62, no. 5, 2020.
Y. D. Rosita, E. E. Rosyida, and M. A. Rudiyanto, “Implementation of dijkstra algorithm and multi-criteria decision-making for optimal route distribution,” in Procedia Computer Science, 2019.
B. Şahin, “Route Prioritization by Using Fuzzy Analytic Hierarchy Process Extended Dijkstra Algorithm,” J. Eta Marit. Sci., vol. 7, no. 1, pp. 3–15, 2019.
Downloads
Published
How to Cite
Issue
Section
License
The copyright to this article is transferred to Universitas Mercu Buana (UMB) if and when the article is accepted for publication. The undersigned hereby transfers any and all rights in and to the paper including without limitation all copyrights to UMB. The undersigned hereby represents and warrants that the paper is original and that he/she is the author of the paper, except for material that is clearly identified as to its original source, with permission notices from the copyright owners where required. The undersigned represents that he/she has the power and authority to make and execute this assignment.
We declare that:
1. This paper has not been published in the same form elsewhere.
2. It will not be submitted anywhere else for publication prior to acceptance/rejection by this Journal.
3. A copyright permission is obtained for materials published elsewhere and which require this permission for reproduction.
Furthermore, I/We hereby transfer the unlimited rights of publication of the above mentioned paper in whole to UMB. The copyright transfer covers the exclusive right to reproduce and distribute the article, including reprints, translations, photographic reproductions, microform, electronic form (offline, online) or any other reproductions of similar nature.
The corresponding author signs for and accepts responsibility for releasing this material on behalf of any and all co-authors. This agreement is to be signed by at least one of the authors who have obtained the assent of the co-author(s) where applicable. After submission of this agreement signed by the corresponding author, changes of authorship or in the order of the authors listed will not be accepted.
Retained Rights/Terms and Conditions
1. Authors retain all proprietary rights in any process, procedure, or article of manufacture described in the Work.
2. Authors may reproduce or authorize others to reproduce the Work or derivative works for the authors personal use or for company use, provided that the source and the UMB copyright notice are indicated, the copies are not used in any way that implies UMB endorsement of a product or service of any employer, and the copies themselves are not offered for sale.
3. Although authors are permitted to re-use all or portions of the Work in other works, this does not include granting third-party requests for reprinting, republishing, or other types of re-use.
