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

 4   5   6   7   8 
Rancang Bangun Sistem Monitoring Kualitas Air dengan menggunakan Arsitektur Jaringan Internet of Things Ayub Firdhouzi; Primantara Hari Trisnawan; Dany Primanita Kartikasari
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

Water is the essential compound for all living things on this earth. Human needs fresh water for their daily activities. Because of the importance of water use, the quality of water must be maintained. Make a water monitoring system can be one of the ways to maintain water quality. The monitoring system can be done by using the Internet of Things (IoT) technology. In the application, it will be constructed by three main component systems such as Producer, Broker, and Consumer. In building the IoT network architecture communication protocols are needed between the nodes to exchange data. The protocol that is used in this research is the Advanced Message Queueing Protocol (AMQP) and WebSocket. The AMQP was chosen because the network used in this research was considered capable of suiting the needs of the AMQP protocol. WebSocket protocol used for means of data communication so the results of monitoring can be shown on a web page in real-time. According to the result of tests conducted indicate that the system is capable of real-time monitoring, it's based on delay value in data transfer obtained. By using this water quality monitoring system, it is hoped that later it will be able to monitor the quality of water in real-time via the web.
Kinerja Antar Protokol EIGRP, IS-IS, Dan OSPF Dengan Metode Route Redistribution Menggunakan GNS3 Bagus Prasetya; 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

There are many routing protocols used in the current network topology. EIGRP, IS-IS and OSPF are examples of routing protocols in a network topology. each of these routing protocols has different algorithm to communicate and also has different ways of working algorithms. Therefore, additional methods such as route redistribute are given so that different protocols can communicate in a topology. In this research, an analysis related to the route redistribute method to find which routing protocol has the best performance in the same network topology. This study uses the Graphical Network Simulator 3 or (GNS3) and uses a hierarchical topology. The scenario is to send an ICMP PING packet from source to destination to observe the round-trip time and convergence time. The results showed that each routing protocol can be run by the route redistribute method. The IS-IS protocol has a round-trip time of 531.4 milliseconds and a convergence time of 158.2 seconds that makes time is the lowest time compared to other protocols and proves that the ISIS protocol is able to work well on the route redistribute method.
Kinerja Protokol Greedy Perimeter Stateless Routing Protokol (GPSR) Menggunakan Roadside Unit (RSU) Pada Vehicle Ad-Hoc Network (VANET) di Area Kota Malang Ragil Setyo Utomo; 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

Vehicular ad-hoc network (VANET) is a wireless network technology that allow vehivle can communicate with ohter vehicle. VANET have 3 way to communicate, that is vehicle to vehicle communication (V2V), infrastructure to vehicle (I2V) or (V2I), and infrastructure to infrastructure (I2I). This study focused at the distance placement in each road side unit (RSU). This study focused at the distance placement in each road side unit (RSU). Communication in VANET, its need good performance in sending data from vechile to vehicle for communication between vehicle to vehicle as well as vehicle to RSU or the other round can be delivered faster and the percentage of success information arrived is increasing. In this study protocol greedy perimeter stateless routing (GPSR) will be implement with RSU to know which distant in each RSU is better to implement. Implementation will be worked with Network Simulator (NS-2) and SUMO. The result from this implementation will be analyzed with test parameters that is throughput, end-to-end delay, and packet delivery ratio. From the result based on vehicle density, RSU with distant 300 m have better value, that is 1570 bps and 85,7143% compared from RSU with distance 400 m, that is 1530 bps and 500m with value 1520 bps. And also the value of packet delivery ratio for RSU with 400 m is 77,7778% and 500 m with 75%. However on implemention result based on vehicle speed, RSU with 400 distance 400 m have same performance with RSU distance 300 m. In other word, RSU placement with distance is taking effect toward routing performance.
Optimasi Posisi Relay Node pada Wireless Sensor Network menggunakan Algoritma Genetika Eki Renaldi; 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

Relay is one of the most important devices to forward sensory data to sink. Therefore, relay's connectivity must be kept well so Wireless Sensor Network works optimally. Common problem in Wireless Sensor Network is relay node placement in a deterministic way is not getting optimal results. Heuristic way is done with hope that optimal position of relay can be achieved. In this research 3 scenarios with static relay and internet gateway locations are carried out. Scenario 1's area is 90x77 and has 45 relays. Scenario 2's area is 60x77 and has 31 relays. Scenario 3's area is 120x77 and has 59 relays. In this research genetic algorithm is carried out to solve relay's position optimization. Genetic algorithm is an algorithm that can be used to find the nearly optimum solution from wide possibility solution area. In this research, researcher used extended intermediate crossover, random mutation, and elitism selection. The results from this research are early convergence happened at 752nd generation for scenario 1, 846th generation for scenario 2, and 424th generation for scenario 3. Population size for scenario 1 is 150 scenario 2's is 100 and scenario 3's is . Ratio for scenario 1 is 0,6 and for scenario 2 and scenario 3 are 0,7. The result from this research is that relays position optimization using genetic algorithm is not as good as using deterministic because fitness from genetic algorithm is not greater as fitness from deterministic and genetic algorithm needs longer time.
Perbandingan Kinerja Protokol Routing HSR dan DSDV Pada Mobile Ad-Hoc Network (MANET) Khalid Hamzah Haza Al Hamami; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 11 (2020): November 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 portable autonomous node network equipped with a wireless interface, which communicates via a wireless connection without centralized administration. This network can self-configure and maintain network topology dynamically without infrastructure support. Because the mobile node's transmission range is limited, each node has a dependency on neighboring nodes to forward packets. Qualitative data analysis is performed on the performance of Hierarchical State Routing (HSR) and Destination-Sequenced Distance-Vector (DSDV) protocols by interpreting data from test results in the form of throughput, average jitter, average end to end delay, packet data delivery ratio, route overhead and route convergence time. This study uses Network Simulator 2.35 with node density scenarios using variations in the number of nodes totaling 50 nodes to 120 nodes with multiples of 10 nodes. The best value of parameters throughput, average jitter, average end to end delay, packet data delivery ratio and route overhead are 189.312 Kbps, 27.18 ms, 2798.04 ms, 18.93% and 230.25. These results were obtained in the DSDV routing protocol, so it can be concluded that the DSDV routing protocol has better performance than HSR on the node density aspect. A better convergence value is obtained by the DSDV protocol with an average convergence time of 0.028617977 seconds.
Rekayasa Traffic Jaringan pada Protokol Destination Sequenced Distance Vector (DSDV) berdasarkan Penggunaan Energi dalam MANET Muhammad Ryan Firmansyah; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 11 (2020): November 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

MANET is a wireless network architecture where nodes can move freely and do not need to be connected to infrastructure. In MANET, all nodes act as a host and router that can receive and send data packets to other nodes. In addition, MANET also has limitation in energy usage. Nodes require sufficient energy resources when transmitting data packets. However, when the energy in the battery has been or will be depleted, that will cause process of data packet transmission to be disrupted. Therefore, limiting on energy usage are needed so data packets can be transmitted. The example protocol in MANET is Destination Sequenced Distance Vector (DSDV). By using the energy model contained in NS-3.30.1, DSDV protocol is integrated with the energy model in order to read the remaining energy during the data packet transmission process. There are two schemes; (1) Scheme without Traffic Engineering and (2) Scheme with Traffic Engineering tested. Traffic Engineering that is built is limiting the data packets that can be forwarded based on an energy level of 500 Joules. The results show that the scheme with Traffic Engineering saving energy usage in each number of nodes with a percentage are 0,112%, 0,03% and 0,033% whereas the highest Packet Delivery Ratio (PDR) value is all schemes without Traffic Engineering.
Simulasi Perancangan VANET Pada Jak Lingko Koridor 6 Transjakarta Muhammad Ramiz Kamal; Primantara Hari Trisnawan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 1 (2021): Januari 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

People who prefer to use private transportation are due to the lack of facilities provided to users of public transportation. In addition to the lack of facilities provided, many cases of public transportation have problems with delays in sending and receiving bus location data, for example TransJakarta. Delayed data is information that does not arrive according to the predetermined time, from the case of this data delay, the bus that arrives does not match the time displayed to the user. To fix delayed data, the Vehicular Ad-hoc Network (VANET) can be applied to public transportation. The application of VANET can assist in measuring delay and throughput from the Road Side Unit to the bus or vice versa. From the measurement results, information about the current location of the bus will be obtained, which will be sent to the user information page (Network Simulator). The implementation of VANET in this system uses a Network Simulator with the Ad Hoc on Demand Distance Vector (AODV) reactive routing protocol that forms a route from the source node to the destination node based on the source node request and communication using an antenna. From the test results, the average delay value obtained is 79.86 milliseconds (ms) with a minimum value of 0.009 seconds, and an average throughput value of 275.29 KB / s with a minimum value of 0 B / s. From the results obtained, the Vehicular Ad-Hoc Network (VANET) itself can guarantee the throughput and delay of a data transmission flow.
Pengaruh Model Mobilitas Terhadap Konsumsi Energi Protokol Routing Optimized Link State Routing (OLSR) Pada Mobile Ad Hoc Network (MANET) Hans Romario Sitorus; Primantara Hari Trisnawan; Achmad Basuki
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 1 (2021): Januari 2021
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 dynamic communication network that can exchange information wirelessly by mobile nodes. This study is using Optimized Link State Routing (OLSR) as a protocol routing which is a proactive routing protocol. The main characteristic of a proactive routing protocol is a protocol that continually updates toward network topology changes by exchanging topology information at each node continuosly. This causes the proactive protocol requires high power. The mobility of mobile node on MANET also has several models including Random Waypoint, Random Walk, and Random Direction. With the nature of OLSR routing protocol that requires high power and the characteristic of mobile nodes on MANET networks that have limited power, it is necessary to know the influence of mobility models on energy consumption to build a MANET network with OLSR routing protocol efficiently. The testing scenarios in this study use two scenarios, which are based on the mobility models and based on the number of nodes. In the total energy consumption scenario with 20, 40, 60, 80, and 100 number of nodes and with Random Waypoint, Random Walk and Random Direction mobility models shows that the total energy consumption on Random Waypoint mobility has a significant difference compared to other mobility models. This is indicated by the percentage of total residual energy on Random Waypoint is 17.48% while Random Direction is 21.36% and Random Walk is 21.05%. In the average energy consumption scenario, each mobility model has increased the average value of energy consumption as the number of nodes increases with the number of nodes scenario of 20, 40, 60, 80, and 100 nodes. But in the Random Waypoint model, there is a decrease in average value of energy consumption from 791.941523 Joule at 40 number of nodes to 766.603226 Joule at 60 number of nodes. Whereas for the Random Walk and Random Direction mobility models, there was no decrease in the average value in any number of nodes scenario.
Implementasi Algoritme Enkripsi Salsa20 untuk Pengamanan Data Video Surveilans secara Real-Time Angger Ramadhan; Ari Kusyanti; Primantara Hari Trisnawan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 2 (2021): Februari 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Video Video surveillance is a form of surveillance for actions that may violate the law in the form of a collection of frames sent in real-time from a device that has a camera to another device that is tasked with conducting surveillance. However, problems can occur when the frame sent is taken by an unauthorized party, so that it can interfere with the confidentiality of the frame data. In previous research, there is a method for securing these frames, namely in the form of encryption using a block cipher algorithm and not using a stream cipher algorithm. Therefore, in this study, the implementation of the stream cipher algorithm, namely Salsa20, was implemented. Implementation of Salsa20 is applied to systems with client-server network architecture, namely encryption on the server and decryption on the client. After that, tests are carried out related to test vectors, performance, and attacks. The results of the test vector test have been successful because the output from the system is the same as the output on the paper. Furthermore, for the results of the attack test, the sniffing test succeeded in getting the frame on the network but could not get the information because the frame was encrypted and the ciphertext-only attack test failed because it had not succeeded in getting the key or plaintext.
Implementasi Multipath Routing menggunakan Algoritme Iterative Deepening Depth First Search pada OpenFlow Software-Defined Networking Ignatius Suryo Wicaksono; Primantara Hari Trisnawan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 2 (2021): Februari 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

One of the main problems of the implementation of multipath routing is how to find the paths. In this research, Iterative Deepening Depth First Search (IDDFS) algorithm was used. The performance of IDDFS algorithm was measured by comparing IDDFS with other algorithms: Breadth First-Search (BFS) and Depth First-Search (DFS). Some parameters used to measure the performance of algorithms were path search, multipath, path execution time, response time, and throughput. The measurement was done by using simple topology and complex topology (fat tree). The measurement results showed that IDDFS, DFS, and BFS had ability to find paths and to implement multipath routing scheme. The IDDFS performance on simple topology was under the performance of other two algorithms. The measurement results of path execution time: 0.0011355 ms (DFS), 0.001461 ms (BFS), 0.0018207 ms (IDDFS); response time: 147.8 ms (DFS), 145.9 ms (BFS), 146.9 ms (IDDFS); and throughput: 16.63 Gbps (DFS), 16.79 Gbps (BFS), 16.71 Gbps (IDDFS). The IDDFS performance on complex topology was better. The measurement results of path execution time: 0.1277544 ms (DFS), 0.1760637 ms (BFS), 0.0006142 ms (IDDFS); response time: 2043.7 ms (DFS), 2396.1 ms (BFS), 298.3 ms (IDDFS); and throughput: 12.964 Gbps (DFS), 12.533 Gbps (BFS), 14.78 Gbps (IDDFS).
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