Article Per Year (5 Year)
p-Index From 2021 - 2026
2.989
P-Index
This Author published in this journals
All Journal Techno.Com: Jurnal Teknologi Informasi MATICS : Jurnal Ilmu Komputer dan Teknologi Informasi (Journal of Computer Science and Information Technology) Jurnal EECCIS POSITIF ELKOMIKA: Jurnal Teknik Energi Elektrik, Teknik Telekomunikasi, & Teknik Elektronika JURNAL NASIONAL TEKNIK ELEKTRO Jurnal Teknologi dan Sistem Komputer Jurnal Pilar Nusa Mandiri Network Engineering Research Operation [NERO] JURNAL TEKNIK INFORMATIKA DAN SISTEM INFORMASI Jurnal RESISTOR (Rekayasa Sistem Komputer) Jurnal Intake : Jurnal Penelitian Ilmu Teknik dan Terapan G-Tech : Jurnal Teknologi Terapan Jurasik (Jurnal Riset Sistem Informasi dan Teknik Informatika) Jurnal Pengabdian Masyarakat Asia Jurnal Teknik Informatika (JUTIF) Proceeding of The International Conference on Economics and Business Jurnal Seni dan Reka Rancang: Jurnal Ilmiah Magister Desain Jurnal INFOTEL NERO (Networking Engineering Research Operation) Teknomatika: Jurnal Informatika dan Komputer Jurnal ilmiah teknologi informasi Asia
Fransiska Sisilia Mukti
Program Studi Teknik Informatika, Fakultas Teknologi Dan Desain, Institut Teknologi Dan Bisnis Asia Malang
Arts Humanities Civil Engineering, Building, Construction & Architecture Computer Science & IT Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Electrical & Electronics Engineering Energy Engineering Mechanical Engineering Other

Published : 27 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : Jurnal Teknik Informatika (JUTIF)

 1 
A CLUSTERING OPTIMIZATION FOR ENERGY EFFICIENCY IN WIRELESS SENSOR NETWORK USING K-MEANS ALGORITHM Roid Zuhdianto; Fransiska Sisilia Mukti
Jurnal Teknik Informatika (Jutif) Vol. 4 No. 1 (2023): JUTIF Volume 4, Number 1, February 2023
Publisher : Informatika, Universitas Jenderal Soedirman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52436/1.jutif.2023.4.1.523

Abstract

The limitation of sensors energy make energy efficiency still a priority issue in Wireless Sensor Network (WSN) technology. One effort that can be done to overcome this problem is to design the right data transmission path (or better known as routing). Low Energy Adaptive Clustering Hierarchy (LEACH) is one of the most widely used cluster-based routing protocols because it is considered capable of minimizing the amount of energy consumption through the formation of clusters or groups of nodes. Unfortunately, this protocol will experience a significant decrease in energy as the amount of data transmission increases. This is partly due to the clustering process which is carried out randomly and causes an imbalance in the distribution of the number of nodes between clusters. This study proposed a method to optimize the clustering process in the LEACH protocol by integrating the K-Means algorithm, which is called LEACH-KMe. A simulation was conducted to determine the effectiveness of the proposed method by considering 4 main parameters, namely total energy consumption, number of alive nodes, number of dead nodes, and residual energy. The test results proved that the LEACH-KMe protocol provides better performance than the conventional LEACH protocol (more even distribution of nodes, less total energy consumption and number of dead nodes, as well as a larger number of alive nodes and residual energy).
ROUTING OPTIMIZATION ON SOFTWARE DEFINED NETWORK ARCHITECTURE USING BREADTH FIRST SEARCH ALGORITHM Armanda, David; Mukti, Fransiska Sisilia; Sulistyo, Danang Arbian
Jurnal Teknik Informatika (Jutif) Vol. 5 No. 4 (2024): JUTIF Volume 5, Number 4, August 2024 - SENIKO
Publisher : Informatika, Universitas Jenderal Soedirman

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52436/1.jutif.2024.5.4.2000

Abstract

Software Defined Network (SDN) is a network modelling that separates the control plane and data plane. SDN is a new form of paradigm used for large-scale networks, one of which is for routing. Most types of routing used today use single-path routing. Single-path only uses one path as data transmission. This will result in reduced performance on the network which is often referred to as network congestion. In this test, the routing algorithm used is Breadth First Search (BFS) by modifying the path so that congestion on the network can be minimised. The BFS algorithm is implemented using Mininet emulator, Ryu Controller, and fat-tree topology. In the test, 20 scenarios were used with a bandwidth of 50 - 1000 Mbps within 15 seconds. Tests were conducted to measure the performance of the BFS algorithm, namely the path and QOS (Quality Of Service) parameters which include testing delay, packet loss, jitter, and throughput. The data obtained in testing using the conventional BFS algorithm is compared with the modified BFS algorithm data in the same test method. In path testing, the modified BFS algorithm is superior and in parameter testing, it is produced with a degraded percentage value in delay (65%), packet loss (99%), jitter (84%), and throughput has increased by (41%). So the modified BFS algorithm is superior due to the utilisation of path modification for routing optimisation which is more effective in handling network congestion.
Co-Authors Achmad Basuki Achmad Noercholis Agus Purnomo Sidi Al Zahwa, Naviza Yulia Allin Junikhah Angga Eko Bayu Arieska Anjaningrum, Widiya Dewi Armanda, David Aziz, Aynan Salsabilah Daniel Desma Mahendra Fadhli Almu’iini Ahda Faisal Edo Nugroho Farokhah, Lia Junikhah, Allin Kabelen, Nicholaus Wayong Latul Roza, Syahfadi Lorenzo, Juan Enrico Maria Theresia Indriastuti Nugraha, Alfian Wahyu Nur Lailatul Aqromi Nur Lailatul Aqromi Onny Setyawati Pratama, Ficho Pranandasya Andrian Renny Wahyu Dewi Anjasari Roid Zuhdianto Samsul Arifin Setyorini Setyorini Setyorini Setyorini Siti Nurul Afiyah Siti Nurul Afiyah Sulistyo, Danang Arbian Sunu Jatmika Sunu Jatmika, Sunu Titania Dwi Andini Tria Aprilianto Tria Aprilianto, Tria Yogie Susdyastama Putra