Article Per Year (5 Year)
p-Index From 2020 - 2025
4.033
P-Index
This Author published in this journals
All Journal Jurnal Inspiration Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Jurnal ULTIMA Computing KOPEMAS
Dany Primanita Kartikasari
Fakultas Ilmu Komputer, Universitas Brawijaya
Computer Science & IT Control & Systems Engineering Education Electrical & Electronics Engineering Engineering Social Sciences Other

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

Found 47 Documents
Search

 1   2   3   4   5 
Mitigasi Serangan Blackhole Pada Wireless Sensor Network Dengan Protokol Routing Aodv Menggunakan Algoritma Probabilitas Sequence Number Yanuar Alfianus Yosephan Raharjo; Dany Primanita Kartikasari; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 5 (2021): Mei 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Wireless Sensor Network (WSN) merupakan infrakstruktur jaringan yang dapat memudahkan dalam pemantauan pada sebuah objek. Penelitian ini menggunakan routing protocol AODV, protocol AODV memudahkan jaringan wireless sensor network dalam melakukan penentuan jalur pengiriman data secara mandiri. Protocol AODV memiliki kelemahan didalam pengiriman data. Blackhole attack dilakukan dengan mengirimkan paket RREP palsu ke dalam jaringan. Tujuannya untuk melakukan drop packet pada setiap pengiriman data antara source node dan destination node. Algoritma probabilitas sequence number merupakan mekanisme yang dapat digunakan untuk melakukan mitigasi blackhole attack pada jaringan wireless sensor network yang menggunakan protocol AODV. Mekanisme algoritma probabilitas sequence number dilakukan dengan cara memfilter sequence number sehingga hanya packet RREP asli yang dapat diterima oleh source node. Sequence number merupakan salah satu parameter yang terdapat pada paket RREQ dan RREP. Nilai parameter sequence number akan semakin bertambah setiap terdapat perubahan jalur yang digunakan. Hasil penelitian ini, algoritma probabilitas sequence number dapat memitigasi blackhole attack sebanyak 8 node dari 25 malicious node. Rata-rata packet loss sebesar 27,72 %. Rata-rata end to end delay sebesar 129.752 ms. Rata-rata packet delivery ratio sebesar 72,30 %.
Deteksi Serangan Black Hole terhadap Protokol Routing Ad Hoc On-Demand Distance Vector menggunakan Support Vector Machine Awit Priharsiwi; Dany Primanita Kartikasari; Fariz Andri Bakhtiar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 10 (2021): Oktober 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Wireless Sensor Networks used to collect all of data and information in complex environments. WSN uses wireless communication channel technology to transmit data, without security protection, data is very vulnerable to internal and external attacks. Black hole is one of the attacks that occur on WSN. A black hole attack works by declaring itself to have the shortest route to the destination node. This is very dangerous if the package contains important information. From these problems, black hole attacks can be detected using the Support Vector Machine method on the Ad Hoc On-Demand Distance Vector reactive protocol. SVM is a powerful method for classification and regression. The purpose of this study is to determine the accuracy of SVM in detecting black hole attacks and how much data is discarded by these malicious nodes. In the test results, it can be seen when the simulation is under normal conditions, the packet loss is small (1), while in the simulation there are black holes (239) 100%. Simulation with normal conditions on the packet delivery ratio as much as 99,5816%, while the simulation has a black hole with a value of 0%. Simulations with normal conditions have an average end-to-end delay of 202,429 ms, while in the simulation there are black holes of about 172,524 ms to 214,979 ms. The results showed that the SVM algorithm in classifying black hole attacks with calculations produced accurate results.
Pengujian Kinerja MQTT Broker berbasis Kontainer menggunakan Docker pada Perangkat Raspberry Pi Andika Kurniawan; Mahendra Data; Dany Primanita Kartikasari
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

To test the performance of the MQTT broker using containerization technology on Raspberry Pi devices with two different image bases, we use several experimental parameters. The experimental parameters are resource usage (CPU and memory), latency, and packet loss. To test the resource usage, we created a Python script. Meanwhile, to test latency and packet loss, we used the MQTT broker measure latency measure. The base images used as the installation media for the MQTT broker (Mosquitto) are belenalib/raspberry-pi2 and belenalib/raspberry-pi2-alpine. We created the Docker images using Dockerfiles. The image is built and run with the commands provided by the Docker program. Regarding resource usage (CPU), the MQTT broker running on docker based on the belenalib/raspberry-pi2 image performs better than native with 0.53% to 10.38% lower CPU usage. However, the resource usage (memory) of both MQTT brokers running on docker is still higher than MQTT brokers running natively, which has a difference about more than 50%. Likewise with the latency test, the two MQTT brokers running on docker are still higher than the MQTT brokers running natively, which has a difference of more than 50%. While in the packet loss test, the MQTT broker with the belenalib/raspberry-pi2 image base can provide better performance where only 28.60% experienced packet loss on 1000 MQTT clients and 0 QoS.
Implementasi Routing Dinamis pada Wireless Sensor Network menggunakan Modul Komunikasi LoRa Mahardika Putra Utama; Dany Primanita Kartikasari; 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

The development of the WSN (Wireless Sensor Network) concept on the Internet of Things allows communication to be carried out wirelessly so as to help node mobility. Nodes that can move freely to move away from the gateway can cause communication to be interrupted so that a relay is needed as an intermediary for data transmission. Other nodes can be used to become a relay that helps bridge data transmission between nodes and gateways and utilizes multihop communication. So that each relay is responsible for sending its own data and forwarding data to other nodes that are not in the range of the gateway. In addition, this multihop concept can increase the range of wireless communication modules by utilizing other nodes as relays. A node that is not directly connected to the gateway must be able to find a routing path to get to the gateway. The path chosen must be the shortest path, so we need a routing protocol that can collect existing network information and choose the shortest path to get to the gateway. The routing protocol that is created must also be dynamic so that it can adapt to changes in the network because nodes on the network can move freely, so the arrangement of routing paths can change. There are two tests carried out to measure the feasibility of the system made, namely functional testing and performance testing. In functional testing the system can run well where nodes can collect all network information and choose the shortest path, send sensor data, forward sensor data from other nodes, and adapt to network changes such as disconnection of the selected path. Performance testing is conducted to test the ability of the system based on convergence time, packet delivery ratio, and delay with the effect of distance, number of hops, and delivery time intervals. The results of the functional testing of the node managed to meet all the requirements that have been determined. In the results of testing the performance of node convergence time it takes 7,365 seconds at a distance of 50 meters to get network information, while at a distance of 100 meters it takes 10,807 seconds. Then in the packet loss performance test, the lowest percentage is at a distance of 100 meters and the number of 1 hop jumps is 6% and the highest percentage is at a distance of 50 meters and the number of 3 hops jumps is 22%. In testing the delay performance, the lowest value is obtained at a distance of 50 meters and the number of 1 hop jumps is 276ms and the highest value at a distance of 100 meters 3 hops is 755ms.
Pengaruh Tipe Propagasi Two Ray Ground dan Free Space terhadap Konsumsi Energi Protokol Destination Sequenced Distance Vector (DSDV) pada Mobile Ad Hoc Network (MANET) Indra Lesmana Putra; Dany Primanita Kartikasari; 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 dynamic wireless network. Each node in MANET has a function as a host to connect to the wireless network and also as a router that functions to forward data packets to other nodes. In a MANET system, MANET is expected to have good performance and have a maximum level of energy efficiency. This is because each node on the MANET network requires energy to communicate with each other. In addition, the selection of propagation type can also affect of energy efficiency in MANET. In order to understand how the effect of the propagation type on energy consumption in MANET, we have conducted a study that focuses on energy consumption in MANET using two different propagation types. The two types of propagation that we used are the free space propagation type and the two ray ground propagation type. In this study, we will use the DSDV routing protocol which will regulate the routing of data transmission from the sending node to the receiving node. The DSDV protocol guarantees that there will be no looping in data transmission, so it is very suitable to be applied in this research. To achieve credible results, this study uses four test scenarios based on the number of nodes used. Each scenario will be tested 10 times using Network Simulator 2.
Implementasi Algoritma Trilateration pada Penentuan Posisi Obyek Dhiyaan Khansa Afifah; Dany Primanita Kartikasari; 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

accuracy
Analisis Dampak Serangan Wormhole terhadap Protokol Routing Ad-Hoc On Demand Distance Vector (AODV) pada LoRa Muhamad Ralfi Akbar; Dany Primanita Kartikasari; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 6 No 11 (2022): November 2022
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Long Range (LoRa) is one of IoT technology used in a system that require long distance communication and in a need of low cost system. Delivering a packet on LoRa takes time depending on the distance to the destination, the farther the distance, the longer delivery time will take. This makes LoRa network security while delivering packet, vulnerable to attacks. This research analyze packet delivery on LoRa using the AODV routing protocol and the impact of Wormhole attack lon the AODV routing protocol on LoRa. This study uses 3 LoRa nodes and 1 malicous wormhole node. The analysis is reviewed with QoS paramers, namely Troughput, Delay, Jitter, and Packet Loss. The result of the test show that Wormhole attack affects the performance of packet delivery in LoRa. In the non-attack scenario, the average Delay value is 0.171s, Packet Loss is 0%, the average of Troughput is 408,321 kbps, and the average of Jitter is 0.0003ms. In the Wormhole attack scenario, the average Delay values is increased to 0.343s, Packet Loss increased to 70%, Troughput decreases by an average of 204,105 kbps and Jitter increases by an average of 0.05724ms. It can be concluded that Wormhole attack on the AODV routing protocol affects the qualiy of QoS on the delivery of each packet.
Naive Bayes untuk Klasifikasi Pergantian Operating System pada Personal Computer di Bank X Syifa Namira Neztigaty; Dian Eka Ratnawati; Dany Primanita Kartikasari
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 6 No 6 (2022): Juni 2022
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Bank X is one of the largest banks in Indonesia. The Desktop Team, which is one of the teams that carry out risk identification and periodic evaluation on PCs. Through this evaluation, the Desktop Team found many operating systems on PCs at Bank X were end-of-support. This condition poses a risk if there are bugs or security holes in the operating system that can lead to data theft. In order to avoid this incident, the entire operating system of end-of-support PCs must be replaced with a newer operating system. Currently the operating system replacement activity has been carried out, but it is still done manually and has not been effective. The process has succeeded in replacing ±5,000 PCs. Through this system, the Desktop Team Desktop Team will get the class results from the PC. The data could be classified by using data mining classification method, namely Naive Bayes. From the PC attribute data does not yet have a class, the system will perform data processing. Then the data is calculated using the existing functions on the controller, by accessing classified PC database. Information about the classification results is displayed on the prediction results page. From the results of testing the accuracy value is 92.8371%.
Kinerja Protokol Contact-Based Routing (CBR) dengan menggunakan Management Buffer Shortest Life First (SHLI) pada Delay Tolerant Network Roy Marten Sirait; Primantara Hari Trisnawan; Dany Primanita Kartikasari
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 6 No 8 (2022): Agustus 2022
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Delay Tolerant Network (DTN) is a network protocol that can connect contacts between devices with unstable connectivity with high delay times. DTN network protocol applies the store-carry-and-forward concept to send messages so that it does not always have an end-to-end connection. The multi-copy message-copying scheme is an effective for message routing approach between the source and destination nodes. However, this scheme results in a large number of unwanted messages being copied, resulting in a high number of remaining packets in the network. To solve this issue, a message copying process policy can be created. Contact-based routing (CBR) is a protocol that can observe the mobility property of each connected node by looking at the amount of node encounters in the past. The message copying selection policy on the CBR, can reduce the average delivery delay time, reduce the remaining packets on the network, but still be able to maintain the success rate of message delivery when compared to the routing protocols used in general. The addition of a management buffer is also needed to control the storage space owned by each node. The simulation results show an increase in the value of delivery probability up to 51.5%, a decrease in the value of overhead ratio up to 24.9%, and average latency up to 20.1% when compared to the flooding-based routing protocol that is often used.
Analisis Kinerja Protokol Routing Destination Sequenced Distanced Vector (DSDV) terhadap Serangan Blackhole dan Grayhole pada Mobile Ad Hoc Network (MANET) Made Ayu Gayatri Widhiastuti; Dany Primanita Kartikasari; Aditya Bhawiyuga
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 6 No 10 (2022): Oktober 2022
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Technological advances make network infrastructure also increasingly developed. One example of the development of network infrastructure is the existence of wireless network technology or Ad-Hoc network. MANET is one type of Ad-Hoc network that has a flexible network topology and nodes on MANET can freely move places. Nodes in MANET that can move around, become vulnerable to security attacks that can threaten network performance in MANET. Blackhole and grayhole attacks are attacks on MANET. In this study using Destination Sequenced Distanced Vector (DSDV) routing protocol that is proactive with random waypoint mobility to determine the performance of the protocol against blackhole and grayhole attacks. The study was conducted using NS2.35 simulation and scenarios in the form of variations in the number of normal nodes and attacker nodes. Testing is done by using QoS parameters such as packet delivery ratio, average end-to-end delay, throughput and normalized routing load. The test results showed that there was a decrease in the performance of the DSDV protocol before and already Blackhole and grayhole attacks based on certain QoS parameter values.
Co-Authors Achmad Basuki Achmad Brahmantyo Arundaya Subianto Adharul Muttaqin Adhitya Bhawiyuga Adi Iman Utama Aditya Bhawiyuga Adytya Tri Syahrul Alim Andika Kurniawan Apriyanto J.P.L Tobing ari kusyanti Attabik Muhammad Amrillah Awit Priharsiwi Ayub Firdhouzi Cahyo Karya Basuki Darma Wahyu R Prameswara Deny Hari Prasetya Dewa Dhimas Satriawan Utama Dhiyaan Khansa Afifah Dian Eka Ratnawati Dwiyan Ramadhan Dharmanzah Dyah Ayu Ocky Mawardani Farah Nabilla Putri Irzan Fariz Andri Bakhtiar Farouq Alamsyah Fathan Muhammad Fathi Nur Azzam Fikry Juan Aulia Hafidz Rizal Indra Lesmana Putra Indriyana Liliasari Rahma Yusvi Jodi Chris Jordan Sihombing Lius Alviando Luqman Hakim Yumnun Made Ayu Gayatri Widhiastuti Mahardika Putra Utama Mahendra Data Muhamad Ralfi Akbar Muhammad Aji Wibowo Muhammad Nursodik Wicaksono Pramukantoro, Eko Sakti Primantara Hari Trisnawan R. Moch Makruf Puja Pradana Rachmat Indra Permadi Rakhmadhany Primananda Rexy Marten Reza Andria Siregar Richad Gilang Wisduanto Riza Anisul Fu'ad Romy Dwi Andika Manullang Roy Marten Sirait Rozali Syahputra Sukma Alamsyah Budianto Syifa Namira Neztigaty Tasrahmiati Istiqomah Tohari Ahmad Veny Charnita Br Ginting Waskitho Wibisono Widhi Yahya Yanuar Alfianus Yosephan Raharjo Yefta Kristiyanto Yosef Febri Wiryawan Yuni Kilawati Yunita Maimunah