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

 1   2   3   4   5 
Perbandingan Algoritme FIFO, PIE, dan RED terhadap Quality of Service pada Wireless Local Area Network Rayza Arfian; Primantara Hari Trisnawan; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 2 (2019): Februari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (640.772 KB)

Abstract

One product of technological advancements in wireless network is Wi-Fi with the IEEE 802.11 standard. Wi-Fi technology can be found in public facilities in the form of a Wireless Local Area Network (WLAN) and then turned into a public hotspot. A public hotspot surely has limitation either in accomodating a data packet or a number of clients connected. Data packets that are in the queue are generally processed according to the order in which the packets arrives. This can have an effect on Quality of Service. In this research, the implementation of the queue algorithm in the WLAN was carried out to determine its effect on Quality of Service. The queue algorithms are the First-In-First-Out (FIFO) algorithm, Enhanced Proportional Integral Control (PIE), Random Early Detection (RED). The Wi-Fi standard being used is IEEE 802.11b. In Packet Delivery Ratio, the FIFO algorithm provides better results than PIE and RED. FIFO experienced a 0,7% improvement when using 1000 packets as a queue capacity. Then in the End-to-End Delay test, PIE and RED provide an average delay of 0,9 seconds on each test, better than the FIFO algorithm which can reach 5 seconds. Finally, in throughput all the algorithms tested give results that are not far with only 1-2 bps differences.
Analisis Perbandingan Kinerja Routing Protokol IS-IS dengan Routing Protokol EIGRP dalam Dynamic Routing Egi Muliandri; Primantara Hari Trisnawan; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 2 (2019): Februari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (954.085 KB)

Abstract

In Dynamic Routing, EIGRP routing protocol and IS-IS routing protocol were the fastest routing protocol with convergence time compared to other routing protocols. With the difference algorithm used in EIGRP routing protocol and IS-IS routing protocol, it certainly makes a difference in characteristics and performance of both routing protocols. In this research Graphical Network Simulator 3 (GNS 3) is used to simulate EIGRP routing protocol and IS-IS routing protocol with Mesh topology. The test was performed using Mesh topology with 4 routers, 6 routers and 8 routers. Parameters used are Convergence time and Round Trip delay. The purpose of this research is to know which routing protocol is the most appropriate for use on Mesh topology and to know Convergence process when link was broken. In the results of this study can be shown that the EIGRP routing protocol has the fastest Convergence process because it uses the DUAL algorithm on the best path calculation. While the IS-IS routing protocol is a very easy routing protocol to be deployed on the network
Analisis Perbandingan Dampak Serangan Black Hole Pada Kinerja Routing Protocol LAR (Location-Aided Routing) dan DYMO (Dynamic Manet On-Demand) di Mobile Ad-Hoc Network (MANET) I Dewa Gede Ardana Pucanganom; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 3 (2019): Maret 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (460.06 KB)

Abstract

Mobile Ad-Hoc Network is a network consisting of nodes that can move in all directions (mobile). These nodes can communicate with temporary communication channels). On mobile ad-Hoc networks, routing protocol is useful in determining the best data packet delivery path. Issues that exist in the MANET network are limited bandwidth, energy, transmission range, and security. In the security aspect, data packet is still vulnerable to forms of attack, one of them is black hole that can dropping data packets. To knowing the routing protocol's performance against black hole attacks, then the performance analysis of reactive routing protocols (Dynamic MANET On-Demand and Location-Aided Routing) needed. When black hole run, the average value of packet delivery ratio routing protocol LAR and DYMO is 51.38% and 51.92%. The average end to end delay value of LAR and DYMO routing protocol is 70.58 ms and 24.01 ms. The average value of normalized routing load of routing protocol LAR and DYMO is 2.68 and 1.38. Based on the comparison of these average values, the DYMO routing protocol gets better performance than the LAR routing protocol in the normalized routing load, average end to end delay and packet delivery ratio parameters when black hole is run.
Analisis Pengaruh Blackhole Attack Terhadap Kinerja Protokol Routing BATMAN (Better Approach To Mobile Ad Hoc Network) Pada Mobile Ad Hoc Network Imam Nurhidayat; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 3 (2019): Maret 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (508.037 KB)

Abstract

Mobile Ad-hoc Network (MANET) is a network architecture consisting of several nodes that move freely and communicate with each other. Each node can function as a router or client for other nodes. MANET has 3 types of routing protocols, namely proactive, reactive and hybrid routing protocols. BATMAN (Better Approach to Mobile Adhoc Network) is one of the routing protocols on MANET. In terms of security, MANET is still vulnerable to various forms of attacks, especially against active attacks that can destroy, modify, and delete data and information. One type of active attack that can occurs in MANET is blackhole attack. Blackhole Attack is an attack that can cause loss of data packets. Based on the above problems, the authors made a study entitled Analysis the Effect of Blackhole Attack on the Performance of the BATMAN (Better Approach To Mobile Adhoc Network) Routing Protocol on Mobile Adhoc Network. The results obtained in this study are blackhole attacks affect the performance of the BATMAN routing protocol. Testing is done using OMNET ++ with a test scenario in the form of variations in number of nodes, number of attacking nodes, and area of ​​the simulation. Test parameters used are packet delivery ratio (PDR) and packet loss. The packet loss calculation is only done on packets dropped by the attacker node. The test results show that the lowest packet delivery ratio is 14,24% in the 30 node scenario with an area of ​​1200x1200 m2. While the highest average packet loss is 56.62% in the 30 node scenario with an area of ​​1000x1000 m2.
Perbandingan dan Pengaruh Handover Terhadap Kinerja Penjadwalan Paket Round Robin dan Proportional Fair Pada Jaringan LTE Chandra Yogi Adhitama; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 3 (2019): Maret 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (612.359 KB)

Abstract

Long Term Evolution (LTE) is a network that has many users using it to get information. Because mobile users are currently on this network, a packet scheduling algorithm is needed to schedule packages for ubiquitous communication. This research will discuss the performance of the packet scheduler Round Robin and the Proportional Fair and the effect of the handover on that packet schedulers. This research was conducted by simulating an LTE network in the NS-3 simulator and produce data that is reprocessed so that a value is formed to measure the performance of the packet scheduling algorithm such as throughput, packet loss ratio, delay, and jitter. These data will be analyze by comparing them from the results of the Round Robin scheduling algorithm and the Proportional Fair scheduling algorithm.
Analisis Kinerja Protokol AODV (Ad Hoc On-Demand Distance Vector) dan AOMDV (Ad Hoc On-Demand Multipath Distance Vector) Terhadap Serangan Aktif Pada Jaringan Manet (Mobile Ad Hoc Network) Muhammad Alif Bahari; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 4 (2019): April 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1203.254 KB)

Abstract

MANET (Mobile Ad hoc Network) is a network that does not have a fixed infrastructure and the nodes in it function as routers to forward the information that is sent. MANET has 3 types of routing protocols, namely proactive, reactive and hybrid routing protocols. AODV (Ad Hoc On Demand Distance Vector) and AOMDV (Ad Hoc On Demand Multipath Distance Vector) are reactive type protocols found on MANET. Security on MANET is a big challenge, because nodes will be connected to one unprotected wireless network. Based on the above problems, the authors made a study entitled Performance Analysis of AODV Protocol and AOMDV Against Active Attacks on MANET (Mobile Ad hoc Network) networks. The results obtained from this study are proven that active attacks in the form of Blackhole and DDoS attacks of type Flooding RREQ Attack affect the performance of the two protocols. Tests in this study were conducted on Network Simulator 2 and measured based on 3 parameters, namely Packet Delivery Ratio, End-To-End Delay, and Normalized Routing Load. The test results show that the lowest value of Packet Delivery Ratio is found in the 100 node scenario using the AOMDV protocol with the type of DDoS attack that is worth 52.00%. While the highest end-to-end delay value is found in the 100 node scenario using the AODV protocol with DDoS attack types that are worth 134.25 ms. The highest average value of Normalized Routing Load is found in the 100 node scenario using the AOMDV protocol with DDoS attack types valued at 158.8.
Analisis Pengaruh Kepadatan Node terhadap Kinerja Protokol Routing DYMO dan DSR Pada Mobile Ad-Hoc Network (MANET) Muhammad Syaifuddin FP; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 4 (2019): April 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1451.903 KB)

Abstract

Mobile ad-Hoc Nertwork (MANET) is a technology that has the ability to adapt to the condition of mobile nodes. Each node has the same position that is doing a routing function that can determine and forward communication lines between nodes, so that a routing protocol is needed that can handle the exchange of data in providing an optimal routing path. The routing protocol used in this study is reactive routing, namely DYMO and DSR. The DYMO and DSR routing protocols route formation from the source node to the destination node based on the request of the source node. This study using Network Simulator 2.35 with a node density scenario using variations in the number of nodes totaling 50 nodes to 200 nodes with multiples of 10 nodes, and variations in data packet size using packet sizes of 512 bytes and 1024 bytes. Performance is measured based on average throughput, end to end parameters delay, packet loss, and average jitter with the best values in a row are 101.45 KBps in the data packet size of 512 bytes, 44.26 ms in the data packet size of 512 bytes, 2.36% in the size of a 512 bytes data packet, 1.72 ms in the data packet size of 512 bytes. These results were obtained on the DYMO routing protocol, so it can be concluded that the DYMO routing protocol has better performance than DSR in the aspect of node density with different packet size variations.
Analisis Kinerja Protokol 6LoWPAN pada Jaringan Sensor Nirkabel dengan Topologi Jaringan Grid dan Topologi Jaringan Random Menggunakan Cooja Simulator Andre Hadi Saputra; Primantara Hari Trisnawan; Fariz Andri Bakhtiar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 4 (2019): April 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (813.536 KB)

Abstract

IPv6 over Low Power Wireless Personal Area Network (6LoWPAN), is an IPv6-based protocol that allows devices with small power consumption such as sensors to remain connected and participate in Internet of Things (IoT) with greater scalability. The presence of 6LoWPAN as an Internet protocol for wireless sensor networks that offers extensive scalability and interoperability. In this study a simulation of the use of the 6LoWPAN protocol on the Wireless Sensor Network (WSN) using Cooja simulator. After that, the analysis was carried out using the Wireshark application and the results of the Mote Output were calculated manually by reviewing the Quality of Service (QoS) parameters, such as throughput, delay and jitter to determine the performance of 6LoWPAN. Cooja Simulator is used because building a genuine propagation network is time consuming and costly. From the simulation results using grid topology and random toology that have different number of nodes and Routing Protocol for Low Power and Lossy Network (RPL). The acquisition of delay and jitter is calculated manually except throughput using the Wireshark application. The highest throughput, as well as the lowest delay and jitter, are obtained by grid network topology with the number of nodes 10 in a row which are 435 bps, 174 ms and 1,795 ms. It can be concluded that the performance of the 6LoWPAN protocol on wireless sensor networks with grid topology is better than random topologies.
Analisis Kinerja Protokol Routing Dynamic MANET On-Demand (DYMO) dan Cluster Based Routing Protocol (CBRP) pada Mobile Ad-Hoc Network (MANET) Muhammad Nurusshobah; Primantara Hari Trisnawan; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 4 (2019): April 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (651.255 KB)

Abstract

Mobile Ad-Hoc Network (MANET) is a network technology that is composed of a collection of similar or different ad-hoc nodes that are connected using a wireless connection. MANET development is very likely to be applied to areas or conditions with minimal network infrastructure, such as disaster areas. Qualitative data analysis was performed on Dynamic MANET On-Demand (DYMO) and Cluster Based Routing Protocol (CBRP) performance by saving data from test results consisting of convergence, average throughput, average delay, average jitter, and package loss. From the results of the test analysis, the DYMO protocol has better results than the CBRP protocol based on the scheme of variations in the number of nodes. The average value of parameter throughput, average end to end delay, average jitter, and packet loss are 102.09 Kbps, 73.54 ms, 11.81 ms, and 1.79% respectively. In the wide variation scenario, DYMO is better seen from the average end to end delay, average jitter, and packet loss parameters with a value of 18.98 ms, 3.07 ms, and 0.35%. While the CBRP protocol is better of the average throughput with a value of 105.74 Kbps. In the data packet size variation scheme, the DYMO protocol is also known to be better seen from the average end to end delay, average jitter, and packet loss parameters with values of 32.86 ms, 8.44 ms, and 0.53%. While the CBRP protocol is better of the average throughput with a value of 104.86 Kbps. A better convergence value is obtained from the CBRP protocol with an average convergence time of 0.755375 seconds, but from the routing routing protocol level, the DYMO protocol is better than CBRP.
Analisis Konsumsi Energi Protokol Routing Fisheye State Routing (FSR) Pada Mobile Ad Hoc Network (MANET) Wildan Aulia Rachman; Primantara Hari Trisnawan; Mochammad Ali Fauzi
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 5 (2019): Mei 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1036.721 KB)

Abstract

Mobile Ad Hoc Network (MANET) is a type of ad hoc network that has a dynamic and fast-changing topology in which nodes on MANET are dynamically connected in an orderly manner. In this study Fisheye State Routing (FSR), a routing protocol uses a link state algorithm optimization using the fisheye approach. From the use of these techniques, each node will be grouped according to the distance or hop. In this case the use of energy becomes a matter that needs to be considered in the consumption of energy used in the simulation using NS-2.35. By using energy models, the simulations can produce presentations of energy consumption at nodes with different mobility. the total consumption scenario with the number of nodes 20,30 and 50 in each mobility shows that static mobility has the largest total energy consumption in 2 node scenarios namely 20 and 30 nodes namely 19997,969 and 29995,565 joules but static mobility has less in total energy consumption compared to the other 2 mobility with the use of 50 nodes, which is 499973,065 Joules. In the scenario the average energy consumption has the same results as the total energy consumption scenario. Increasing and decreasing energy consumption in mobility used by different nodes can be influenced by changes in the number of nodes and changes in mobility of each node.
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