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

 3   4   5   6   7 
Implementasi Pencarian Jalur berdasarkan Bandwidth dengan menggunakan Algoritme Dijkstra pada Arsitektur Jaringan Software-Defined Networking (SDN) Raihan Radito; Primantara Hari Trisnawan; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 5 (2020): Mei 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Software-Defined Networking (SDN) is a new concept on network computers. By seperating the data plane and the control plane, logics and algorithms for managing networks are placed on a controller. Currently, an algorithm that is being used for finding a shortest path on SDN networks is Diijkstra's algorithm. However, Dijkstra's algorithm has its downside, that is doesn't count bandwidth overhead. As a result, network congestion will occur if the packet size that is being send, is bigger than the available bandwidth. Therefore, the modification of Dijkstra's algorithm is needed. Dijkstra's algorithm is modified with available bandwidth as its cost. When searching a path, the algorithm will find a path which has a bigger avalaible bandwidth. There are three tests on topology A and B, that is finding a path 1 test, finding a path 2 test, and time convergence test. Finding a path 1 test is conducted when there is no traffic and changes of bandwidth on networks. Finding a path 2 test is conducted when there is traffic and changes of bandwidth on networks. Time convergence test is conducted by counting how much time that the algorithm needs to find a path 1 and 2 on each topology. When finding a path 1 and 2 tests, Dijkstra's algorithm succeed for finding a path based on bandwidth. For time convergence test, the algorithm works better on topology A when finding a path 1 and 2. The average time is 8.2 seconds and 13.1 seconds. However on topology B, finding a path 1 and 2 takes an average time about 93 seconds and 114.8 seconds.
Pengaruh Nilai Radius terhadap Pemilihan Zona Optimal Protokol ZRP (Zone Routing Protocol) pada Lingkungan MANET (Mobile Adhoc Network) Daniel H. Simatupang; Primantara Hari Trisnawan; Rakhmadhany Primananda
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 6 (2020): Juni 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

A manet network is made up of moving nodes (mobile), each node that can establish communication with another without requiring a constant channel or template for that matter. The characteristic of manet is self-indulgence in which there is no need for a definition of infrastructure first. The kinds of protocols available in manet vary so much as proactive, reactive and hybrid protocols. The formation of zones depends on the manually designated radius values, the radius values has a significant share in the routing process. The observation of radius values affects the performance of ZRP's routing protocol using an NS-2 simulator. With a variation in number of nodes 20, 40, 60 and 80, variations in value radius 2, 3, 4 and 5 at area 1000m x 1000m using Random Way Point movements. Based on testing of ZRP's routing protocol with the packet delivery ratio (PDR), normalized routing load (NRL), end-to-end delay, throughput parameters with value radius 2 show better results in all test scenario for test parameters. For the parameters of the convergence time test, the value of radius 4 shows better on the entire test scenario.
Pengaruh Model Pergerakan Node terhadap Konsumsi Energi Protokol Routing Location Aided Routing (LAR) pada Mobile Ad Hoc Network (MANET) Tommy Bona Hamonangan Sitorus; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 7 (2020): Juli 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Nodes that have mobile properties form a network called MANET. This study uses protocol routing that is reactive, namely Location Aided Routing (LAR) where the protocol routing uses the position information of each node that comes from the Global Positioning System (GPS). From the use of these techniques and position information, the area to search for routes is reduced and restricted. Along with this, the energy consumed by each node needs to be reviewed. The performance of the Location Aided Routing (LAR) routing protocol can be affected by node movement. This movement node can pose a risk of disconnection between nodes and routing unsuccessful. The performance of the protocol is routing directly proportional to energy consumption. This study uses the number of different nodes and node movements to conduct test scenarios. In the 30 node scenario, the largest total energy consumption occurs in the movement model the Random Waypoint node and has a difference with the total energy consumption of the Random Direction node movement model of 351.491386 Joules. Conversely, in the scenario 45 and 60 nodes the largest total dominant energy consumption is when employing the Random Direction node movement model. In the Random Waypoint node movement model, the average energy consumption scenario decreases and increases regarding node addition. Whereas in Random Direction, the average energy consumption continues to increase. The amount of energy consumption is affected by the number of nodes and the different node movement models.
Implementasi Komunikasi Multi-Hop Menggunakan Metode Controlled Flooding Pada Wireless Sensor Network Berbasis LoRa Zeddin Arief; Primantara Hari Trisnawan; Achmad Basuki
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 7 (2020): Juli 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Wireless sensor network (WSN) is a wireless network that requires there are at least two interconnected nodes to communicate using wireless communication modules. One of the communication modules that has low power consumption and a considerable distance is the Long Range (LoRa). However, the limitations of LoRa that only uses single wireless hop communication creates problems when implementing LoRa networks to reach dark spots or areas that are difficult to reach by the network. Therefore, this research applies multi-hop communication using controlled flooding method. The application of controlled flooding method uses several mechanisms to resolve problems in the flooding method in general. There are mechanism of preventing infinite loop transmission, random delay mechanism, and packet retransmission mechanism. After testing, it was found that the infinite loop transmission prevention mechanism was successful in resolving the same packet forwarding over and over again. In addition, the packet retransmission mechanism for resolving if a packet lost is also successful. Then the performance test results show that the random delay mechanism is able to cut the percentage of packet loss. The test results show when using a random delay mechanism the packet loss results are 18%. Whereas when without using the random delay mechanism the packet loss results are 54%.
Implementasi Saving Energy Protokol Dynamic Source Routing (DSR) pada Mobile Ad Hoc Network (MANET) dengan Metode Sleep Mode Firza Nur Hibatullah; Primantara Hari Trisnawan; Rakhmadhany Primananda
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 8 (2020): Agustus 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Mobile ad hoc network (MANET) is a collection of wireless mobile nodes that are connected through radio waves without a central access point, free moving nodes, and dynamic. But this kind of network still has several problems, power consumption is one of the most important design problems in MANET as a node on MANET that has a limited battery. Based on the problems described earlier, we need a concept of implementing energy saving on MANET and analyzing the effect of energy on protocol performance when reducing energy consumption. This study compares the implementation of the concept of saving energy using the sleep mode method with protocol performance, namely Packet Delivery Ratio (PDR), packet loss, and average residual energy using Network Simulator 2 (NS2) in the Destination Source Routing (DSR) protocol. Testing is done by making sleep mode implemented and without the implemented sleep mode for the variation of the total node and data rate. This research successfully implemented the concept of energy saving in the DSR protocol in MANET with the sleep mode method. How to implement energy saving on the system is to configure the source code protocol by changing the MAC protocol using Sensor MAC (S-MAC) and writing the source code to enable the sleep mode feature. This study concluded that the performance of the DSR routing protocol without implementing a sleep mode was an average of 87.5% better than the implementation of sleep mode on the testing parameters of PDR values and packet loss. However, the DSR routing protocol with the implementation of sleep mode was better on average 91.67% than without the implementation of sleep mode on the testing parameters of average residual energy.
Pengaruh Energi Terhadap Pengiriman Data Pada Protokol Fisheye State Routing (FSR) Dalam Mobile Ad Hoc Network (Manet) Dahru Wildan Pradanaputra; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 8 (2020): Agustus 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The energy level owned by a node will affect the services performed by that node. When the node's energy is at a high level, the node will provide communication services for sending data and routing, but when the node's energy is at a low level the services performed by that node will be limited. The limit given to the node is when the remaining node energy is below 20% of the initial energy, the node will discard all packets that will be forwarded and when the node's energy sis has entered below 10%, the node will discard all packets that will be forwarded and do not do routing. The application of these energy restrictions results in changes in the Quality of Service. The testing of the application of energy restriction is carried out using a number of diverse nodes, namely 30, 40, and 50. The results are taken with two tests, the first test without applying energy restriction and the second test uses energy restriction. The results of the comparison of the average throughput test value for the number of nodes 30 and 50 have increased, but for testing with 40 nodes has decreased in value. The results of the comparison of packet delivery ratio testing values ​​on all tests the number of nodes has decreased. And the results of testing the remaining energy changes the value of the remaining energy owned by each node.
Implementasi Routing Static Pada Wireless Sensor Network Menggunakan Modul Komunikasi LoRA Nuril Huda; Primantara Hari Trisnawan; Rakhmadhany Primananda
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 8 (2020): Agustus 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

In Wireless sensor network (WSN) technology, devices or devices that can support wireless networks in WSN are needed, one of which is LoRa. The device is a wireless communication technology that can be used over long distances and has a low power consumption using the radio spectrum in its communication. By default, there is still a problem with these devices that is LoRa communicate with each other directly in just one hop. To overcome this problem routing protocols will be implemented in it to enable multi-hop application. The routing protocol used is static routing, because it is efficient when applied to small scale networks and the processing load on the routing is smaller. The results of performance testing are based on three predetermined test parameters namely Association Time, Packet Loss, and Packet Delivery Ratio (PDR). The value of the highest association time is when sending to sensor node 4 which is the furthest node with an association time value of 0.614 seconds, because to go to that node needs to go through 2 other nodes. Then in the Packet Loss test the highest percentage value is 8%. The last test Packet Delivery Ratio obtained the lowest value of 92%. From the above data it can be concluded, the large number of nodes that are traversed makes the performance of the system reduced.
Pengaruh Model Traffic pada Kinerja Protokol Routing DSDV dalam MANET Asika Ayu Wandira; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 10 (2020): Oktober 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

MANET (Mobile Ad-Hoc Network) is a network where each of its nodes can adapt to Mobile conditions. The protocols contained in MANET are divided into three types: proactive, reactive and hybrid. The Destination Sequence Distance Vector (DSDV) is one of the proactive protocol types. In MANET (Mobile Ad-Hoc Network) There are frequent routing problems such as looping. To handle this, use the DSDV protocol where this protocol uses a sequence number to avoid the occurrence of looping on the MANET network. Traffic models used are traffic CBR and Exponential. The simulation program is done using Network Simulator 3.21 (NS-3.21) in the Ad-Hoc Network (MANET) Mobile network. The test parameters are used in the form of Packet delivery ratio (PDR),throughput, and average end-to-end delay. Based on the simulation that has been done shows that the DSDV protocol has a good performance by using exponential traffic judging by the PDR test value and its end-to-end delay. Judging from the value of traffic throughput CBR has a higher value compared to Exponential traffic. Traffic CBR with an average value of PDR 55.31%,throughput 319.9 and an average end-to-end delay of 1.377 seconds. Compared to the results exponential traffic is with the average value PDR 63.74%, throughput 312.8 and average end-to-end delay 1.289 s.
Implementasi Opsi Jumbo Packet Header Ipv6 pada Ethernet Jumbo Frame Putu Ade Arta Kusuma Putra Suparta; Primantara Hari Trisnawan; Fariz Andri Bakhtiar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 10 (2020): Oktober 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The use of IPv4 in addressing causes problems with the growing number of internet users. IPv6 is designed to overcome the weaknesses of IPv4. This study uses the IPv6 Extension Header feature to accommodate larger packet shipments than ordinary IPv6 packets. UDP is a protocol used in streaming applications that allows efficient packet transfer of resources. Large UDP packet delivery requires a large throughput, because the size of the package sent is large. Throughput is the number of packets that can be sent and received within a certain period from source to destination. The solution to sending packets that have sizes over 1500 bytes is to increase throughput by creating a new header option on IPv6 that is able to accommodate payload sizes that exceed 1500 bytes to 9000 bytes. Also can utilize Ethernet jumbo frames (up to 9000 bytes) that currently using ethernet frames, to reduce network overhead. As a result, the new header implemented as the IPv6 jumbo packet header is successfully run on the NS-3 simulator and can send packets over 1500 bytes to less than 9000 bytes as many as 100 packets on a jumbo ethernet frame network. So it can reduce the overhead header.
Implementasi Load Balancing Web Server pada Software Defined Networking menggunakan Metode K-Nearest Neighbor (K-NN) Dimas Agung Rizky Ananta; Primantara Hari Trisnawan; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 10 (2020): Oktober 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Nowadays everyone uses internet that cause higher traffic on internet network. High traffic causes server overload and service not available. This problem can be solved by implementing multiple web servers with a load balancing mechanism. Load balancing is mechanism how traffic will distributed by using certain methods to optimize network. Load balancing in Software Defined Networking (SDN) handles big traffic load and complexity issues so it improves server performance. Performance of server is affected by resource usage from each server. Resource usage includes CPU, Disk and Memory usage. Information of resource usage is obtain from psutill agent. This research applies load balancing using K-Nearest Neighbor (K-NN) algorithm on POX controller to decide which server will handle incoming traffic. Traffic will distribute to server which has smallest value from CPU, Disk and Memory usage. Performance testing uses two scenarios, first is different rate number (req/s) and second is different load in server. Result from this research showed if K-NN algorithm can distribute traffic to server which has smallest status. In throughput test showed if increasing of rate (req/s) also make increasing of throughput. The highest value of throughput get in 500 req/s with value is 207.3 KB/s. Response time test showed if increasing of rate and load in web server also make increasing of response time. It happens because server receive and handle much request from client. Best response time get in this research is 3.9 ms.
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