Article Per Year (5 Year)
p-Index From 2021 - 2026
4.418
P-Index
This Author published in this journals
All Journal Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer
Primantara Hari Trisnawan
Universitas Brawijaya, Malang
Computer Science & IT Control & Systems Engineering Education Electrical & Electronics Engineering Engineering

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

Found 90 Documents
Search

 5   6   7   8   9 
Implementasi Algoritma Dijkstra dengan Pembobotan Link Dinamis berdasarkan Packet Loss untuk Pencarian Rute Terpendek pada Software Defined Networking Julio Firdaus Irawan; Primantara Hari Trisnawan; Aditya Bhawiyuga
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 12 (2021): Desember 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

SDN is a new paradigm in computer networks that separates the control plane and data plane. The concept offers better programmability of devices and more efficient network management. In the context of determining the route in the routing mechanism on the SDN network, topology discovery and routing calculations are carried out by the SDN controller only. The mechanism in determining the best route traversed by a packet from the sender to the receiver is determined by a routing algorithm. One of the existing routing algorithms is the link-state routing algorithm. One application of the existing link state routing algorithm is the Dijkstra algorithm. In Dijkstra's Algorithm the focus of this algorithm is only on the route search strategy without defining the weights used. In general, the static distance between two nodes will be weighted without considering the condition factor of the network being passed. Weights based on distance will result in the shortest route but may not be the most optimal. With the programmable SDN technology, weight optimization that considers network density can be implemented. Therefore, in this research, the implementation of Dijkstra's routing algorithm system for finding the shortest path has been carried out by paying attention to packet loss as a weight. From the test results, the results obtained that the system has been able to search for paths by considering the smallest packet loss value on the link. In throughput testing, the system has significantly superior throughput compared to static Dijkstra algorithm. Then based on packet loss testing, this system has packet loss ranging from 0 - 1% compared to Dijkstra's static algorithm which has a significant increase in packet loss when the number of clients is more than 30. In this system the convergence time value obtained is not much different from the static Dijkstra algorithm.
Implementasi Routing Statis menggunakan Media Komunikasi LoRa dan Websocket untuk Pengiriman Data dari Sensor ke Cloud pada IoT Mohamad Lutfi; Primantara Hari Trisnawan; Rakhmadhany Primananda
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 12 (2021): Desember 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

In general, the IoT environment consists of the internet and the Wireless Sensor Network (WSN). WSN is a collection of sensor nodes that can collect data and communicate with each other. To communicate with each other, WSN requires a protocol, for example is LoRa. LoRa has the advantages of wide coverage and low power consumption. However, LoRa has a weakness. The communication is still limited to one hop and LoRa cannot directly send data to the cloud. To solve the one-hop problem, static routing is used, so that it can send data in multi-hop. Static routing is used because it is suitable for small network implementations. For the problem of not being able to send data to the cloud, a gateway that can communicate with the cloud is added using the Websocket protocol. Websocket was chosen because it has a smaller round trip time than MQTT and lighter than HTTP. Performance testing is carried out with three parameters, successful rate, round trip time and delay. The results of the successful rate test, data from nodes 1 and 2 are sent and stored 100% to the cloud, node 3 is sent 94%,, while sensor node 4 is sent 92%. The results of the round trip time test are that nodes 1 and 2 require 0.2 seconds, node 3 takes 0.4 seconds and node 4 takes 0.7 seconds The more hops that are passed, the more risk of data loss and resulting the longer time The results of the delay test, in the first experiment the sensor node 2 got the longest results and in the second test it got the fastest results. This is influenced by internet network conditions which make different results.
Studi Kinerja Protokol Routing Ad-Hoc On Demand Multipath Distance Vector (AOMDV) dalam Lingkup Vehicular Ad-Hoc Network (VANET) pada Daerah Perkotaan Abraham Arya Satyana; Primantara Hari Trisnawan; Rakhmadhany Primananda
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 12 (2021): Desember 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Vehicular Ad-hoc Network (VANET) is a network formed from many nodes that communicate with each other without any main network. To be able to communicate with each other, a process is needed to determine the path for information exchange. The process of determining the path of information exchange is called by routing. The number of nodes incorporated in the VANET network may cause a high routing load on the network. But it can be minimized, one of which is the multipath method. The Ad-hoc On Demand Multipath Distance Vector (AOMDV) protocol is one of the routing protocols that has a multipath method. The multipath method in the AOMDV protocol works by providing an alternative routing path that will be used if the main routing line is cuts off on its multipath mechanism. The performance of the AOMDV protocol can be determined based on testing of Quality of Service (QoS) parameters; Packet Delivery Ratio, End-to-end Delay, Normalized Routing Load, Overhead Routing, and Convergence Time. And based on the test results of the QoS parameters that have been tested, the AOMDV protocol runs optimally at a speed of about 75 km/h.
Kinerja Protokol Destination Sequence Distance Vector (DSDV) terhadap Serangan Wormhole pada MANET Thelemanica Wicaksana; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 6 No 2 (2022): Februari 2022
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

MANET is a wireless network that consists of many mobile devices that serve as nodes. Dedicated infrastructure or centralized access points are not owned by this free tool. MANET has several types of routing protocols, namely reactive, proactive, and hybrid protocols. DSDV is an example of a proactive routing protocol. However, MANET networks can also be attacked. One example of his attack is Wormhole. A wormhole is an attack that consists of 2 or more nodes in pairs and forms a tunnel to transmit data between wormhole nodes. This study tested two scenarios, namely using attacks and without wormhole attacks. The test was carried out using NS-2.35 with each scenario using random waypoint movements and varying the number of nodes and the number of pairs of wormhole nodes. The test is based on the test parameters using QoS. The QoS parameters used are throughput, end-to-end delay, and packet delivery ratio. The best throughput results are in the scenario of 60 nodes without wormhole attacks of 0.78 kbps. The best delay is in the 60 node scenario using one pair of wormhole attacks of 3.57926 seconds in the end-to-end results. At the same time, the best packet delivery ratio results are in the 80 node scenario without a wormhole attack of 35.8974%.
Implementasi Modifikasi Penggunaan Energi Protokol Routing SPIN pada Wireless Sensor Network Antarif Ekadhia Cahyadi; Primantara Hari Trisnawan; Kasyful Amron
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

Wireless Sensor Network (WSN) is a collection of sensor nodes with limited energy resources that are distributed in a certain area so as to create a network architecture that is connected to each other. With the limited energy resources available at each node, it becomes a challenge for the implementation of the architecture. In an effort to save energy, one of the ongoing studies is to make WSN devices last a long time. One of the efforts to save energy is to choose a routing protocol that can save energy. One of the protocols developed by experts based on meta-data for ideal lossless networks is the Sensor Protocol for Information via Negotiation (SPIN) protocol. However, the SPIN protocol itself still has problems that the protocol has not been able to solve. One way to solve this problem is to modify the SPIN protocol itself. Modifying the protocol is expected to extend the lifetime of a node, by applying randomized packet dropping modifications to the SPIN routing algorithm and using energy detection in the OMNET++ simulation program so that it can save energy consumption and extend the active life of nodes. In this study, the results achieved to extend the lifetime of a small number of nodes, while the larger the number of nodes the energy difference becomes less different.
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.
Sistem Pendeteksi DDoS menggunakan Algoritma CUSUM pada OpenFlow SDN Mahadika Putra Pratama; Primantara Hari Trisnawan
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

With the development of technology in today's era, Software Defined Network (SDN) has been used everywhere. SDN separates network control and data fields. SDN has several protocols that are used everywhere, such as OpenFlow SDN. OpenFlow is standardized by the Open Networking Foundation (ONF) to overcome the dynamic nature and high bandwidth of applications and reduce the complexity of system management (Alsaeedi et al., 2019). The separation of the controller from the data plane causes security holes in the data flow such as communication between lines that can be targeted by attackers such as DDoS (Ahmad et al., 2015)⁠. The algorithm used is the CUSUM algorithm where the CUSUM algorithm has a fairly reliable accuracy point in detecting DDoS attacks. The CUSUM algorithm uses a method called Entropy. Entropy is a random data that occurs because of the abnormality of an event (Ramadhani et al., 2008)⁠. The implementation of the CUSUM Algorithm on OpenFlow SDN is able to detect attacks with close to high accuracy as much as 80% and a detection time of 1 second.
Implementasi Congestion Avoidance pada HWMP dengan menggunakan CCNF dan Queue Threshold pada Jaringan VANET Audi Azzura Falaq; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 6 No 7 (2022): Juli 2022
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Vehicular Ad hoc Network (VANET) is prone to experience congestion problems. The congestion may cause the packet to be stuck, and fails to arrive at its destination. In this study, modifications to the HWMP protocol will be carried out to overcome the congestion problem. The modification made is to apply a threshold to monitor the queue at the node. If a node is starting to get congested, the node will send a Congestion Control Notification Frame (CCNF) to other nodes. The CCNF function is to notify other nodes that the node cannot receive packets for a while. So that an alternative route that excludes the congested node will be formed. Tests will be carried out on 3 different mobility models, namely, the Manhattan model, the Freeway model, and the real map. From those test, 4 parameters such as average end-to-end delay, packet delivery ratio (PDR), throughput, and normalized routing load will be measured. Based on the results of the tests, it is known that the modified protocol is superior in PDR and throughput, but there is a decrease in performance in average end-to-end delay and normalized routing load.
Implementasi Load Balancing menggunakan Metode Regresi Linier pada Software Defined Network Ahmad Ali Hamdan; Primantara Hari Trisnawan; Fariz Andri Bakhtiar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 6 No 7 (2022): Juli 2022
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

A growing number of internet users leads to a high amount of network traffic. Servers need to be added to avoid overload. Load balancing is also needed to distribute the load equally. Load balancing is widely implemented in SDN because it's programmable and flexible in a complex network. Therefore, this research proposes the implementation of load balancing in SDN using linear regression. The dataset for modeling linear regression function contains thirty samples. It contains the information of central processing unit (CPU), random access memory (RAM) and number of requests. The linear regression calculation is according to the server's CPU and RAM. The result is a prediction of the number of requests from each server. A server with the lowest request is chosen by the controller to handle the request. This research compares between linear regression and round-robin. In traffic distribution testing using linear regression, server with higher specifications gets more distribution than a server with lower specifications. In the testing of 300 requests per second, linear regression's response time is between 169.3 to 353.4 milliseconds, and round-robin is between 339.2 to 1232.6 milliseconds. Linear regression's throughput is between 241.5 to 310.7 KB/s, and round-robin is between 129.4 to 179.8 KB/s. In CPU utilization testing, the highest CPU usage in linear regression is 75 percent, and round-robin is 98 percent.
Co-Authors Abraham Arya Satyana Achmad Basuki Adam Kukuh Kurniawan Adhitya Bhawiyuga Aditya Bhawiyuga Ahmad Ali Hamdan Ahmad Hanif AR Al Aziiz Burhanudin Faidzin Labay Andi Mohammad Thareq Akbar Andre Hadi Saputra Andre Rizal Sinaga Angger Ramadhan Anisa Permatasari Anita Sumiati Antarif Ekadhia Cahyadi Anugerah Wijaya ari kusyanti Arie Prayogo Pangestu Aris Adi Utomo Arya Seta Bagaswara Asika Ayu Wandira Audi Azzura Falaq Ayub Firdhouzi Bagus Prasetya Chandra Yogi Adhitama Dahru Wildan Pradanaputra Damianus Dewa Pratama Daniel H. Simatupang Danny Candra Rumantyo Dany Primanita Kartikasari Dicky Satriawan Dimas Agung Rizky Ananta Egi Muliandri Eki Renaldi Faiz Amzadkhan Fajar Faris Naufal Al Farros Fariz Andri Bachtiar Fariz Andri Bakhtiar Fathan Abdurrahman Shani Amarta Putra Firza Nur Hibatullah Halimah Septya Mikayla Hans Romario Sitorus Hasan Sabiq Hilman Nihri Hilmy Riadika I Dewa Gede Ardana Pucanganom I Made Oka Semara Putra Ignatius Suryo Wicaksono Imam Nurhidayat Imam Utomo Julio Firdaus Irawan Kasyful Amron Kesit Budi Kusumo Khalid Hamzah Haza Al Hamami Lulus Bagos Hermawan M. Ali Fauzi Mahadika Putra Pratama Mahardika Yuristyawan Putra Miftaqul Novandi Moh Irfan Haris Mohamad Deltaviyahya Mohamad Lutfi Mohammad Rizky Dwisaputra Muhammad Affan Alvyan Muhammad Afian Musthofa Muhammad Alif Bahari Muhammad Farradhika Muntaha Muhammad Fattah Na'im Pang Ripto Muhammad Ichwan Pradana Muhammad Nurusshobah Muhammad Ramiz Kamal Muhammad Ryan Firmansyah Muhammad Sholeh Muhammad Syaifuddin FP Muhammad Taufiq Aryadi Nuril Huda Pahlevi Muhammad Pramukantoro, Eko Sakti Prasetyo Eko Yulianto Putu Ade Arta Kusuma Putra Suparta Ragil Setyo Utomo Rahmat Yani Raihan Radito Rakhmadani Primananda Rakhmadhani Primananda Rakhmadhany Primananda Ravy Agistya Alkamaly Rayza Arfian Reza Andri Siregar Reza Andria Siregar Rezky Hadiwiriyanto Rino Erik Sanrio Risqi Nuril Aimah Rizky Haryandi Rahman Roy Marten Sirait Ryan Eko Listyanto Sabriansyah Rizqika Akbar Sandy Prasetyo Shindy Maria Ulfa Swasti Paramita Terbit Reformator Thelemanica Wicaksana Tommy Bona Hamonangan Sitorus Widhi Yahya Wildan Aulia Rachman Yohanes Heryka Febriarso Zeddin Arief