Article Per Year (5 Year)
p-Index From 2020 - 2025
3.57
P-Index
This Author published in this journals
All Journal Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Jurnal ULTIMA Computing
Fariz Andri Bakhtiar
Fakultas Ilmu Komputer, Universitas Brawijaya
Computer Science & IT Control & Systems Engineering Education Electrical & Electronics Engineering Engineering

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

Found 36 Documents
Search

 1   2   3   4 
Implementasi Load Balancing pada Broker MQTT dengan Algoritme Weighted Least Connection menggunakan Raspberry Pi Dedy Tinovrasibo Nababan; Rakhmadhany Primananda; Fariz Andri Bakhtiar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 3 (2021): Maret 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Message Queuing Telemetry Transport (MQTT) is a publish / subscribe client communication protocol with the message exchange process. MQTT depends on TCP / IP as its base layer (Dinesh Thangavel, 2014) so the MQTT protocol work in realtime. In real time condition the broker must ensure all connections at the same time. However, a large number of clients connected to the broker will result in increased load on the broker. An increase in load can affect existing resources such as network bandwidth, memory, CPU usage, and throughput to overcome this problem can use a load balancing mechanism. Round robin algorithms can be used for load balancing but would be less efficient when applied to systems that use a broker with a different devices specification. Therefore, it is necessary to implement other load balancing algorithms at the MQTT broker on devices that have different specifications. The weighted least connection algorithm can be used to solve these problems because it can work by determining the weight of each broker. The parameters taken from this test include the number of connections, response time, and CPU usage. Tests are carried out with several scenarios, namely scenarios during the publish process and during the publish-subscribe process, with a predetermined amount. The result of this research is that the application of load balancing can reduce CPU usage when handling the publish-subscribe process with 1000 clients.
Implementasi Enkripsi Vernam Cipher dan Distribusi Kunci Three-Pass Protocol untuk Mengamankan Data Chatting pada ATmega328 Budiyanto Budiyanto; Rakhmadhany Primananda; Fariz Andri Bakhtiar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 3 (2021): Maret 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Arduino devices with ATmega328 microprocessors and NRF24 radio modules can be used as a wireless chat communication devices. Data communication by NRF24 is generally unencrypted, so chat communication is not secure. There are various encryption algorithms that can be used, but not all encryption algorithms are suitable for ATmega328 because of limitations. ATmega328 microprocessor has very limited computational capability, making it less suitable if the encryption process is performed using an algorithm with a high level of computational complexity. Vernam Cipher is an algorithm that uses simple calculations with XOR. Three-Pass Protocol is a simple data transmission protocol that can be used to secure the distribution of encryption keys. In this study, the Vernam Cipher algorithm and Three-Pass Protocol are combined to secure chat data. Chat data that can be secured in this study are text, images, video and audio. From the test results of 10 times on sending chat data, obtained test results with 100% percentage that the system can secure chat data. From the test results, the average time for the encryption process 16 character strings with the Vernam Cipher algorithm on the ATmega328 is 1.9 millisecond.
Konsumsi Energi Menggunakan Protokol Routing Temporally Ordered Routing Algorithm (TORA) Pada Jaringan Mobile Ad-Hoc Network (MANET) Sandy Prasetyo; Primantara Hari Trisnawan; Fariz Andri Bakhtiar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 6 (2021): Juni 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Self-configure is unique to the MANET network, where the network is formed from independent nodes that communicate each other. In MANET, there is a standardized route determination mechanism in sending data packets called the routing protocol. Nodes in a MANET network require energy to communicate, while energy on nodes is limited. Therefore, when testing the network performance, energy consumption is a factor that needs to be taken into account. Temporally Ordered Routing Algorithm (TORA) is a routing protocol that can operate on MANET networks. This study aims to calculate the energy consumption of the MANET network by implementing the TORA protocol. The simulation is carried out with a scenario of increasing the number of nodes from 30, 50 to 70 in an area of ​​1000m x 1000m with an initial energy of 1000 Joules and a simulation time of 100 seconds. This scenario is performed on two different mobility models, namely the fixed grid model and the random waypoint model. From the simulation data, the average value of energy consumption in the fixed grid model for 30 nodes is 65.374 Joule, 50 nodes are 62.262 Joules and 70 nodes are 61.549 Joules. Whereas the random waypoint model for 30 nodes is 62.807 Joules, 50 nodes are 55.808 Joules and 70 nodes are 54.388 Joules. With the scenario of increasing the number of nodes there is a decrease in the average value of energy consumption in the two mobility models, this is due to the multi-route mechanism in the TORA.
Implementasi Algoritme Light Encryption Device (LED) pada Wireless Sensor Network dengan Media Pengiriman Data nRF24L01 Septian Visiano Handoko; Ari Kusyanti; Fariz Andri Bakhtiar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 6 (2021): Juni 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

The nRF24L01 module is more frequently used to send data on Wireless Sensor Network (WSN) compared to the ESP8266 module. This is because of the nRF24L01 module tend to be an Ultra Low Power (ULP) module which requires less power and can transmit data at speeds of 2Mbps. The nRF24L01 module can use 125 different channels and able to create 125 networks in one area and on each channel that has up to 6 addresses. The number of channels and adressess which can be made by the nRF24L01 will make the data traffic will be slightly harder to control and will having a chance to cause a security problem, such as it becomes more vulnerable to hack. Because there is an opportunity for the problem to occur, cryptographic method is needed to encrypt communications on the nRF24L01 module. The Light Encryption Device (LED) algorithm is a development of the Advanced Encryption Standard (AES) algorithm and it is compatible with hardware because this algorithm is a fairly light algorithm if compared to other symmetric block ciphers in its class such as the AES algorithm itself, so that this LED algorithm can implemented in WSN with nRF24L01 module which tend to be Ultra Low Power to fulfill the basic principle of confidentiality security. The implementation of the LED algorithm on the system makes this system resistant to even passive and active attacks. Keywords: Wireless Sensor Network (WSN), nRF24L01, Light Encryption Device (LED)
Implementasi Load Balancing pada Cloud Computing dengan Algoritme Improved Weighted Least Connection Muhammad Denny Chrisna Pujangga; Nurul Hidayat; Fariz Andri Bakhtiar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 10 (2021): Oktober 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Load balancing is a workload distribution mechanism that is widely used in distributed systems. One of the most widely used load balancing algorithms is the Weighted Least Connection Algorithm. The Weighted Least Connection algorithm has a problem that when a new server is added to the server cluster system when there are many user requests, the Weighted Least Connection algorithm will distribute the workload intensively to the new server, causing an uneven distribution of server workloads. To overcome this problem, the Weighted Least Connection algorithm was developed by combining two algorithms, the Server Selection algorithm and the Overload Reduce algorithm into one algorithm, namely the Improved Weighted Least Connection algorithm. This study applies the Improved Weighted Least Connection algorithm on the cloud architecture using the CloudSim Plus simulator. The results of this study indicate that the distribution of the Weighted Least Connection algorithm task is more even than the Improved Weighted Least Connection algorithm on heavier workloads. Meanwhile, for the difference in the distribution of tasks to VM 3, there is not much difference between the Weighted Least Connection algorithm and the Improved Weighted Least Connection algorithm, with an average of 4.81 tasks per 10 seconds and an average of 28.3% cpu usage for the algorithm. Weighted Least Connection, and an average of 4.75 tasks per 10 seconds and an average of 28.02% cpu usage for the Improved Weighted Least Connection algorithm.
Deteksi Serangan Black Hole terhadap Protokol Routing Ad Hoc On-Demand Distance Vector menggunakan Support Vector Machine Awit Priharsiwi; Dany Primanita Kartikasari; Fariz Andri Bakhtiar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 10 (2021): Oktober 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Wireless Sensor Networks used to collect all of data and information in complex environments. WSN uses wireless communication channel technology to transmit data, without security protection, data is very vulnerable to internal and external attacks. Black hole is one of the attacks that occur on WSN. A black hole attack works by declaring itself to have the shortest route to the destination node. This is very dangerous if the package contains important information. From these problems, black hole attacks can be detected using the Support Vector Machine method on the Ad Hoc On-Demand Distance Vector reactive protocol. SVM is a powerful method for classification and regression. The purpose of this study is to determine the accuracy of SVM in detecting black hole attacks and how much data is discarded by these malicious nodes. In the test results, it can be seen when the simulation is under normal conditions, the packet loss is small (1), while in the simulation there are black holes (239) 100%. Simulation with normal conditions on the packet delivery ratio as much as 99,5816%, while the simulation has a black hole with a value of 0%. Simulations with normal conditions have an average end-to-end delay of 202,429 ms, while in the simulation there are black holes of about 172,524 ms to 214,979 ms. The results showed that the SVM algorithm in classifying black hole attacks with calculations produced accurate results.
Implementasi Algoritme Dijkstra dan Logika Fuzzy untuk Pencarian Jalur pada Arsitektur Jaringan Software Defined Network (SDN) Anisa Permatasari; Primantara Hari Trisnawan; Fariz Andri Bakhtiar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 6 No 4 (2022): April 2022
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Software Defined Network (SDN) is a concept that separates all control logic from network devices to a logically centralized control system named controller. One of the network applications that can be applied to the controller is routing. Routing algorithms are used to generate paths, for example Dijkstra's algorithm which computes the least cost from one node to another on the network. The cost is an important factor in determining which path to choose. When the cost is a fixed value, for example distance, it may result in the shortest path but not the optimal path, because link conditions are not considered. With a programmable SDN, the cost of Dijkstra's algorithm can be developed by considering the link conditions and artificial intelligence can be applied to cost calculations. In this research, the cost are based on available bandwidth and packet loss by using fuzzy logic. The results of the test, the system can determine the cost of the link from fuzzy logic calculations based on the available bandwidth and packet loss and find the path for the packet. Based on the results of the delay test, the system outperforms Dijkstra's static algorithm. Then based on packet loss testing, the system has packet loss ranging from 0-1%, while Dijkstra's static algorithm has a significant increase in the number of clients 25 and above. However, on the results of the convergence time, the system has a longer time than Dijkstra's static algorithm.
Implementasi Algoritme Bellman-Ford dengan Logika Fuzzy untuk Pencarian Jalur pada Software Defined Network (SDN) Swasti Paramita; Primantara Hari Trisnawan; Fariz Andri Bakhtiar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 6 No 4 (2022): April 2022
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Software Defined Network (SDN) is an architecture that is designed to make networking more flexible and manageable. In SDN, a program can be implemented, named routing. The process to determine lines of communication between sender to receiver to forward packets are called routing. The shortest path are determined using an algorithm called routing algorithm. Routing algorithm used in this paper is Bellman-Ford algorithm. Routing algorithm chooses a path based on the weight of the connected links. The weight on each links can be configured by the administrator to set all cost into “1” (Bellman-Ford with static cost). The link with lowest number of hops or highest bandwidth will selected, regardless of the traffic density from the link. In this study, the author made a system of implementation of Bellman-Ford algorithm with fuzzy logic. The weight of the link is obtained by calculations using fuzzy logic with traffic and delay as the parameters. Based on the result of routing test, the system has been able to determine a path search based on the weight of link with traffic and delay as the parameters. Based on result of throughput test, the Bellman-Ford algorithm with fuzzy logic has greater results compared to the Bellman-Ford algorithm with static cost. Based on result of the convergence time test, Bellman-Ford algorithm with static cost has best convergence time compared to the Bellman-Ford algorithm with fuzzy logic. Meanwhile based on packet loss test's result, the Bellman-Ford algorithm with static cost has the worst packet loss compared to the Bellman-Ford algorithm with fuzzy logic.
Implementasi Algoritma Trilateration pada Penentuan Posisi Obyek Dhiyaan Khansa Afifah; Dany Primanita Kartikasari; Fariz Andri Bakhtiar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 6 No 4 (2022): April 2022
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

accuracy
Implementasi Algoritme Stream Cipher Grain-128A dan Shamir's Secret Sharing pada Sistem Arsip Data Kependudukan Dita Nurina Malinda; Ari Kusyanti; Fariz Andri Bakhtiar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 6 No 5 (2022): Mei 2022
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Personal data of resident is a data that must be stored and protected by the state. Due to the increasing number of data theft, we need to know that there are many things that can be done if an individual controls other people's ID card data, it can be used to deceive or even rob money from other people's bank accounts (Witjaksono, 2018). The way to overcome this problems is to use a cryptographic algorithm as a security for the population data archive system to ensure security in terms of integrity and authentication. This study describes the design, implementation and performance of a web-based population data archive system that utilizes the Grain-128a algorithm to ensure confidentiality and integrity with additional authentication. In addition, Shamir's Secret Sharing is also added as additional security. The tests carried out in this study included testing the performance of the Grain-128a algorithm in terms of keystream generation time, encryption and decryption as well as the performance of the Shamir's Secret Sharing algorithm in splitting and reconstructing data. As for security testing, using sniffing, brute force, birthday attacks and black box checking. The results showed that the keystream and authentication tags generated by the system were in accordance with the test vector. The result of the test is that the average time to generate a keystream is 7.8 microseconds. Meanwhile, the time to perform encryption and decryption using the Grain-128a algorithm is 10.1 microseconds and 8.3 microseconds. The test results with brute force experiments showed good results because from the attack the keystream of the Grain-128a algorithm could not be known. Tests with a birthday attack show that the authentication tag used in the population data archive system is safe because the attacker failed to find 2 tags with the same value. The test results using black box indicate that the population data archive system has been running well and in accordance with system requirements both functionally and non-functionally.
Co-Authors Abdul Aziz Hadyansyah Widada Adhitya Bhawiyuga Adytya Tri Syahrul Alim Agus Adyandana Ahmad Ali Hamdan Andre Hadi Saputra Anisa Permatasari ari kusyanti Awit Priharsiwi Budiyanto Budiyanto Dany Primanita Kartikasari Darma Wahyu R Prameswara Dedy Tinovrasibo Nababan Dhimas Satriawan Utama Dhiyaan Khansa Afifah Dita Nurina Malinda Eric Ferdy Kurniawan Fani Madina Farouq Alamsyah Fathi Nur Azzam Fikry Juan Aulia Hanaria Rotua Tampubolon Heru Dias Pambudhi I Putu Agrahita Wiguna Iwi Suharti Kalbuadi Joyoputro Kasyful Amron Made Rezananda Putra Muhammad Abdul Aziz Muhammad Denny Chrisna Pujangga Muhammad Thareq Parsaulian Beyri Nadya Puspitasari Nurul Hidayat Pramukantoro, Eko Sakti Primantara Hari Trisnawan Putu Ade Arta Kusuma Putra Suparta Rachmat Indra Permadi Rakhmadhany Primananda Rexy Marten Reza Azzubair Wijonarko Sandy Prasetyo Septian Visiano Handoko Swasti Paramita Widhi Yahya Zavero Brillianata Abilovani