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 
Implementasi Autentikasi Mode Multi-Auth Pada Jaringan Local Area Network Berbasis Kabel Menggunakan Protokol IEEE 802.1X Dan Radius Server Andre Rizal Sinaga; Rakhmadani Primananda; Primantara Hari Trisnawan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 10 (2018): Oktober 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

In computer network area, authentication, integrity, authentication time and scalability are the main problems to keep the network safe, faster and stable. The working administrator must have a complete network management, scalability and security account, so that organization or company data can be kept confidential and can maintain the integrity of the data. There are many implementations that have been done with different authentication methods used in the IEEE 802.1X standard one of which uses EAP-PEAP which is quite easy to implement and has a pretty good level of security. In addition to security, time in authentication to the network is important and in realizing a secure network environment still needs to measure in terms of network implementation costs. The multi-auth mode of implementing it costs cheaper because the physical port can be extended with a hub but functions the same as single-host mode where each MAC address must be authenticated based on the credentials sent by the user. The result of the research shows that the integrity of the delivery of data credentials sent can be maintained due to the successful implementation of the encryption RSA and hashing SHA1 algorithm in the system and the authentication time is measured from two parameters that are "waktu autentikasi berhasil” and "waktu autentikasi tidak berhasil" either “tunggal” or “ganda”. The first sequence of "waktu autentikasi berhasil" is "single-host tunggal berhasil" mode (0.52 seconds), second "multi-auth tunggal berhasil" mode (0.64 seconds), third "Single-host ganda berhasil" mode (1.08 seconds), fourth "multi-auth ganda berhasil" mode (1.15 seconds). As for the first sequence of "waktu autentikasi tidak berhasil" the least is in "single-host tunggal tidak berhasil" mode (0.006 seconds), second "multi-auth tunggal tidak berhasil" mode (0.007 seconds), third "Single-host ganda tidak berhasil" mode (0.072 sec), fourth "multi-auth ganda tidak berhasil" mode (0.073 seconds). From the time sequence of authentication, it can be seen that single-host mode from both “tunggal” and “ganda” provides a smaller authentication time than the multi-auth mode of comparison between the two host-mode.
Implementasi Sumber Daya Penyimpanan Dinamis Pada Cloud Lulus Bagos Hermawan; Sabriansyah Rizqika Akbar; Primantara Hari Trisnawan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 11 (2018): November 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Along with the development of the era of human needs and dependence on computers increasingly large pekembangan modern technology world. Use of your own computer from various fields to solve computing problems from small to large scale. Can not be denied by the development of applications in the computer world requires a larger resource, so less efficient if only done with a physical machine only. Various ways are done to overcome this problem one of them with virtualization. In this research, the implementation of dynamic storage resource management in the cloud. Virtulasisation used in this research by using virtual box. Dynamic storage used in this research by implementing Logical Volume Management feature. The results of this study obtained a system that can make the addition of storage capacity dynamically and automatically without any downtime and rebooting on the system
Pengembangan Sistem Pendeteksi Kehadiran Pegawai Berbasis Fingerprint Wifi Rizky Haryandi Rahman; Adhitya Bhawiyuga; Primantara Hari Trisnawan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 11 (2018): November 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Checking the employees attendance is an important matter for every institution or company to see their own employee performance. Each instituion or company must have their own way to check the employees attendance, such as using a paper, smartphone application, RFID (Radio Frequency Identification), and biomentric technique. Those kind of ways are really making the company easier to check the employees attendance, but there is a flaw, for example is on the fingerprinting system when using the fingerprint, sometimes the fingerprint can not be detected by the system, moreover an employee should reach a specific location to make a presence. This sometimes make the employees to procrastinate or late to make a presence. As a result, the employees often forget and do not make a presence. From the problem, this reasearch is made to make a presence system for employees using a wifi fingerprint, wifi fingerprint means a MAC address which is caught by microtic router when a smartphone is connected. System will read the MAC address and interface of the router mikrotik through the API for RouterOS, then save it into the database, and compare it with the MAC address already in the database, so when it happens, an employee will be considered as present and the location of an employee will be known based on a place where a smartphone is connected. The testing result of functionality and performance shows the all functions on system run well and the time that needed by a system to read from a router has an average below of one second and the time for system to detect the presence including the employees location is about five seconds.
Implementasi Hardware Redundancy Pada Sistem Akuisisi Data Sensor Dengan Menggunakan Metode Hot Standby Sparing Arie Prayogo Pangestu; Sabriansyah Rizqika Akbar; Primantara Hari Trisnawan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 11 (2018): November 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Currently there are many products to monitor an object from various vendor service system providers that are used. The intended product is a group of sensors with interconnected microcontrollers to provide information of what the sensors capture an object condition, one of which is used for monitoring water conditions. When the water in the ponds is turbid, dirty, the water temperature increased and the salt content is irregular it will affect the quality of the fishpond. Sometimes some sensors on the monitoring system can be damaged, due to factors from within and from outside. Therefore, a system that is able to redundancy the main system in case of error. In this study there are three sensors namely temperature sensor, turbidity and salinity sensors in each master module and slave and using Hot Standdby Sparing method. This method is a way of completion so that the module that will be used as slave module remain alive or in idle condition even though it goes into sleep condition and ready to replace master module when there is system error. From the test results, the master module and slave module can work properly. The slave module can redundate the master module when there is an error on the sensor as well as the power failure of the master module, and the system can avoid race conditions between master and slave modules when first turned on.
Pengembangan IDS Berbasis J48 Untuk Mendeteksi Serangan DoS Pada Perangkat Middleware IoT Hilman Nihri; Eko Sakti Pramukantoro; Primantara Hari Trisnawan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 12 (2018): Desember 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The development of IoT devices causes a change in many aspects of human life. Although this device has a limited resources, IoT devices can be used in every kind of environment. The use of IoT device in these environments make the security of IoT device important to study. One of biggest DoS attacks happen to IoT devices because there is no self-defense mechanism toward dangerous packets, so that IoT devices easily infected by Mirai botnet. A method choosen for this research to solve this problem is using Intrution Detection System(IDS). This IDS is expected to handle DoS attack in IoT devices with its limitation. Machine learning is chosen for detector in IDS because it's better for detecting anomalies, and also can run better in limited resources than other type of IDS. The Machine Learning algorithm is J48 because J48 has been prooven to detect anomaly better than other classification algorithms. There are few testing parameters used in this research; which are resource usage, detection engine accuracy, ability to give alert, logging ability, realibility in capturing packet in the network, and ability to handle the attack. Based on the evaluation results, this IDS can handle an attack, give alert, and do the logging process. This IDS is also able to classify the packet up to 100%, but this IDS has average 73.6% for capture packet from the network, so IDS can show alert in average of 17.42%. The resource usage in this IoT devices increases by average CPU usage 16% and memory usage 70MB. Based on these testing results, IDS can be used for solution to handle DOS attack in IoT devices.
Implementasi Protokol Geographic Source Routing(GSR) Pada Vehicular Ad-Hoc Network(VANET) untuk Komunikasi Kendaraan Dengan Road Side Unit(RSU) Rezky Hadiwiriyanto; Primantara Hari Trisnawan; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 12 (2018): Desember 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Vanet (Vehicular Ad Hoc Network)is a type of wireless network that provides communication vehicles that serve as its nodes. Vanet has three elements, namely among vehicle to vehicle communication (V2V), vehicle to infrastructure (V2I) and infrastructure to infrastructure (I2I). This study focuses on the communication vehicle to infrastructure such as Road Side Unit (RSU). Various problems arise in the design of Vanet, one of them is the use of a protocol that is not in accordance with the criteria and mechanism of action of the Vanet. In this study, the protocols in use are the GSR and AODV protocol which are implemented and compared based on the scenarios research which are the density of the vehicle, the vehicle speed and the number of RSU's variations specify the protocol works best on Vanet environment. Implementation is performed using (NS-2) and SUMO. The results of the GSR and AODV protocol implementation are analyzed based on the test parameters are throughput, end-to-end delay and packet delivery ratio. From the test results, protocols AODV has a better performance in scenarios density and speed of the vehicle with the parameters throughput and packet delivery ratio with a value of 1004 bps and 99.65%, while the GSR better its performance on parameters of end-to-end delay with a value of 2.35 ms. In scenario number variation RSU, GSR protocol has better performance parameters of throughput and end-to-end delay with a value of 4060 bps and 2,531 ms while AODV protocol, better on the parameters of packet delivery ratio with a value of 99.83%.
Perbandingan Kinerja Cassandra dan MongoDB Sebagai Backend IoT Data Storage Adam Kukuh Kurniawan; Eko Sakti Pramukantoro; Primantara Hari Trisnawan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 1 (2019): Januari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The storage solutions for keeping a variety of data is using NoSQL. In the previous research, IoT data storage framework has been developed to solve the problems of large and diverse IoT data by using NoSQL MongoDB and GridFS as the data storage media. But currently there are many NoSQL databases with different implementation mechanisms and storage characteristics. It brings challenges in the NoSQL databases selections that are used as IoT data storage media. In this research will be proposed IoT data storage media using NoSQL Cassandra. The researcher chose NoSQL Cassandra because the implementation mechanism and characteristics of the sessions differ from MongoDB NoSQL. The test is done in terms of functionality on Cassandra in storing data from sensor nodes, as well as in terms of performance of Cassandra and MongoDB in performing insert data text and file operations using Runtime, Throughput, CPU Usage, Memory Usage and DISK I/O parameters. From the results of functionality testing, Cassandra can store heterogeneous data from sensor nodes. For insert data text operations, MongoDB has Runtime, Throughput, and CPU Usage values ​​best compared to Cassandra (runtime 121.2 second, throughput at 1236.7 ops/s, and CPU usage from 4% to 5%). As for insert data file operations, Cassandra has better Runtime, Throughput, and Memory Usage values ​​compared to MongoDB (runtime 86.4 second, throughput at 115.8 ops/s, and disk I/O at 126953 KB)
Analisis Perbandingan Kinerja Protokol Routing Multi-Copy Dan Single-Copy Berdasarkan Mobilitas Node Pada Delay Tolerant Network Faris Naufal Al Farros; Rakhmadhany Primananda; Primantara Hari Trisnawan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 1 (2019): Januari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Delay Tolerant Network (DTN) is the solution of the stiffness of transferring information through the weak of internet network. The previous research of DTN mostly focuses on the way the protocol performance of Multi-copy and Single-copy utilizing one way and one mobility. So that's why the deepest research is needed to know the protocol performance of Multi-copy, Single-copy and 3 mobilities node. The test using 3 types of message size and 3 types of nodes with The One Simulator. The result of the research showing the highest value of Delivery probability with the message size is 10 MB with the percentage about 0,1842%, routing ProPHet mobility Shortes Path Map Based Movement with the number of node 50 with the percentage 0,0375%. The highest value of Average latency based on the message size and the number of node is routing epdemic (multicopy) with the node mobility Map Based Movement message size 45MB with the value 737,4527s. then the highest value of Overhead ratio based on the message size is routing First Contact mobility node Map Based Movement with the message size 45MB with the percentage 22,04%, routing ProPHet mobility node Map Based Movement the number of node is 10 with the value 25,0909%.
Implementasi Load Balancing menggunakan Algoritme Least Connection dengan Agen Psutils pada Web Server Muhammad Sholeh; Widhi Yahya; Primantara Hari Trisnawan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 1 (2019): Januari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Social media and news sites are services on the Internet that are most visited by Internet users. These services are required to be able to handle very high traffic.. If the service uses a single web server, it can cause a Single Point of Failure. The solution for that problem is to use a method of load balancing. Load balancing is a method that can distribute traffic to multiple servers based on the algorithm used. This research develop the Least Connection algorithm for load balancing in the Software Defined Network (SDN). Least Connection is a load balancing algorithm that will direct traffic to web servers that have the least connection. This research uses an agent called Agent Psutils. This agent send information to SDN Controller about the number of active connections of web servers. From this information, SDN Controller can direct traffic to web servers that have the least connection. The results of the study show that the Least Connection algorithm with Agent Psutils can distribute traffic based on the number of active connections on server. Then, when comparing the Least Connection algorithm based on Agent Psutils (LC Agent Psutils) with Least Connection based on Expired Flow (LC Flow). LC Agent Psutils can send data measuring 1.2 GigaBytes while LC Flow cannot complete the data transmission process. At 400 requests, LC Agent Psutils have a smaller response time than Round Robin and LC Flow. Where the response time of the LC Agent Psutils is 242.51 ms, while the Round Robin and LC Flow are 261.61 ms and 279.81 ms.
Studi Implementasi Manajemen Antrian WRED untuk Menghindari Congestion pada LR-WPAN Andi Mohammad Thareq Akbar; Primantara Hari Trisnawan; Reza Andria Siregar
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 (447.849 KB)

Abstract

Low Rate Wireless Personal Area Network (LR-WPAN) is a communication protocol standardized by the group of IEEE 802.15.4, the focus of its development is to create an architecture that uses low power, has wide range and reliable data transmission. One of its product is Zigbee. Zigbee focus on reliable data transmission could be disrupted if congestion happen due to the density of increased traffic data in its network. Congestion can be prevented by applying the right queue management in its buffer. One of the queue management is weighed random early detection (WRED), the advantage of using WRED is that the mechanism of the queue management not only focus on preventing the congestion but also able to accommodate the type of package that needs to be prioritized in its services. Implementation of WRED in Zigbee was carried out to measure architectural performance for avoiding congestion, which in this study implementation is simulated using Riverbed Modeler simulator. Architecture performance in terms of avoiding congestion was analyzed using parameters of throughput, queue delay, global delay and packet drop. The testing scenario was carried out by comparing WRED to the random early detection (RED) queue management, whereas both queues uses the min thresh and max thresh mechanism to handle congestion. Results of the test concluded that with smaller package size and smaller threshold the use of WRED will be more optimal shown by throughput parameter which is 1.5% better than RED, whereas with larger packet sizes and larger max thresholds the use of RED will be more optimal shown by the throughput parameter values 0.6% better than WRED.
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