Reza Andria Siregar
Fakultas Ilmu Komputer , Universitas Brawijaya

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

Studi Pengaruh Jumlah Cluster pada Wireless Sensor Network (WSN) menggunakan Protokol Low Energy Adaptive Clustering Hierarchy (LEACH) Risqi Nuril Aimah; Primantara Hari Trisnawan; Reza Andria Siregar
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

One of the problems in Wireless Sensor Network (WSN) is the use of energy.WSN is a network that connects devices, such as sensor node, router and sink node. This problem occurs because the power supply used for each node only uses battery in every process such as sending and receiving data, so the energy reserves are very limited. Therefore, the use of energy in the WSN sensor node becomes efficient by using the Low Energy Adaptive Clustering Hierarchy (LEACH) protocol. The performance of the LEACH routing protocol is influenced by several factors such as the number of node and the number of cluster. This study focuses on determining the performance of the LEACH routing protocol to determine the effect of variations in the number of cluster with the test parameters of Average Energy, Packet Delivery Ratio (PDR), Average Delay and Average Throughput on WSN. Based on the test results of Average Energy, Packet Delivery Ratio (PDR), Average Delay and Average Throughput obtained, the number of cluster 1 has the smallest Average Energy. The Packet Delivery Ratio test was found for the number of cluster 4 to get the highest result. Throughput testing for the number of cluster 4 get the highest Average Troughput results.
Perancangan dan Implementasi Server Presensi Online dengan Geotagging berbasis Foto Mohammad Rizky Dwisaputra; Primantara Hari Trisnawan; 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

Today, governments or any office attendance system still uses paper or RFID (Radio Frequency Identification) and finger prints in their office, and if someone needs to work outside the office, it will be difficult to maintain and monitor their employee. Therefore, the writer suggests an attendance system with their selfie picture based on their location. Because everyone nowadays uses their smartphone for communication, implementing this attendance system is the best solution, as the employee begins by logging in with their credentials, uploading a selfie photo with geotagging, and displaying their time and location. The server that maintains their data must be checked, and testing the network performance from outside the office using either a cellular network or fixed broadband from the employee side started with filling out their credentials to upload their picture, which contains geolocation, and showing up their time and location for monitoring.
Pengaruh Rekayasa Tingkat Energi Routing Protocol Dynamic Source Routing (DSR) pada Mobile Ad Hoc Network (MANET) Hilmy Riadika; Primantara Hari Trisnawan; 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

A Mobile Ad Hoc Network (MANET) is a network consisting of multiple nodes that are interconnected to exchange data. Nodes act as routers to route packets to other nodes. A routing protocol is needed to exchange data. Dynamic Source Routing (DSR) is an example of a reactive routing protocol often used in MANETs. Nodes in a MANET have limited energy, so energy conservation is necessary. One method for conserving energy in nodes is by engineering the energy level and by selecting the appropriate routing protocol, such as the DSR protocol. This research uses two testing scenarios: one with energy conservation and one without. The parameters used are packet delivery ratio (PDR) and remaining energy. The results show that the scenario without energy conservation performs better in improving system performance with the DSR routing protocol. Optimal energy use can improve system performance with the DSR routing protocol because it ensures that there are enough nodes with sufficient energy to continue sending and receiving packets. This will increase the packet delivery ratio (PDR) because more messages are successfully sent and received. On the other hand, if energy use is not optimal, then there will be more nodes that run out of energy before all messages can be sent and received, resulting in a lower packet delivery ratio (PDR).
Pengaruh Serangan Wormhole terhadap Kinerja Protokol Temporally Ordered Routing Algorithm (TORA) pada Mobile Ad Hoc Network (MANET) Ravy Agistya Alkamaly; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 7 No 2 (2023): Februari 2023
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 wireless network that has several interconnected nodes and acts as a router to transmit data. Several nodes can interact with each other by implementing routing protocols, one of which is TORA. TORA has a control message in the form of UDP (Update) to update the routing table and a CRL (Clear) control message that can minimize the occurrence of continuous looping which results in data not reaching its destination. The minimization process is not said to be perfect if there are many additional nodes. Research needs to be done using other methods, namely manipulating control traffic on the network by adding attacks in the form of wormhole attacks. Wormhole has characteristics that are very likely to affect the environmental conditions of MANET using TORA. The characteristics possessed by Wormhole are 2 nodes that can be connected to each other and can send data even with a very far position so that it is likely to reduce the occurrence of looping during packet transmission. The test results are obtained based on the Packet Delivery Ratio, Packet Loss, Troughput, and End to End Delay test parameters. Overall, the application of wormhole in TORA produces better performance compared to not applying wormhole. Packet delivery ratio testing with a scenario of 20 nodes shows 90.56% results compared to only 79.64% without wormhole. Testing the average troughput with a scenario of 20 nodes shows results of 95.06kbps compared to only 83.6kbps without wormhole. And testing the average end to end delay with a scenario of as many as 20 nodes shows results of only 19.18ms compared to without a wormhole rising to 30.12ms.
Implementasi Priority Packet Scheduling di Sisi Node Pengirim pada Mobile Ad-hoc Network berdasarkan Ukuran Paket Data Muhammad Ichwan Pradana; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 7 No 3 (2023): Maret 2023
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 mobile network, due to its nature MANET has basic weaknesses in its reliability when traffic is high. High network traffic is caused by one of the factors including the size of the packets being transmitted, which can cause smaller packets to be susceptible to not reaching the recipient or packet loss. Packet Scheduling is one solution to address these issues. This research uses Priority Packet Scheduling method based on the size of the data packet. Data packets with a size greater than 1000 bytes will be given high priority and sent first. Packets with a size between 1000 bytes and 500 bytes will be given medium priority and packets below 500 bytes will be given the lowest priority. Each priority will still receive a sending quota to prevent starvation. The results of Priority Packet Scheduling show that the method does not have an impact on the Packet Delivery Ratio and even experienced an increase in Average End-to-End Delay when compared to not using Priority Packet Scheduling. However, the Average Throughput values obtained with this method are significant.
Analisis Karakteristik Transmisi LORA dalam Ruangan Haidar Harfi Hadhiansah; Kasyful Amron; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 7 No 4 (2023): April 2023
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Perkembangan teknologi LoRa yang semakin pesat telah memicu penggunaannya dalam berbagai kegiatan diluar ruang (outdoor). Namun pemanfaatan LoRa untuk didalam ruangan (indoor) belum banyak dilakukan. Dalam penelitian ini, kami akan melakukan kajian dan analisa performansi LoRa di dalam ruangan, khususnya pada gedung bertingkat. Analisa dan performansi LoRa didalam ruangan meliputi karakteristik Spreading Factor (SF), Bandwidth (BW), Coding Rate (CR) dan Transmission Power (TP). Penelitian ini dilakukan sebagai studi komprehensif tentang perilaku LoRa dan analisis parameternya dalam pemakaian didalam gedung. Pengujian ini dilakukan untuk mengetahui keandalan dan stabilitas LoRa jika diterapkan di dalam Gedung F di Fakultas Ilmu Komputer Universitas Brawijaya Malang. Pengumpulan data dilakukan dalam 3 titik yaitu dalam jarak 50m, 100m, dan 150m secara vertikal didalam gedung Adapun hasil nya menunjukan nilai RSSI berkisar antara -81 dB sampai -101 dB dengan TP 5, SF 11 dan Bandwidth 125 KHz memiliki hasil paling sesuai dengan kondisi Gedung F di Fakultas Ilmu Komputer Universitas Brawijaya Malang. Saran dalam penelitian adalah perlu kajian penelitian lebih mendalam tentang : 1) Penyesuaian jumlah perangkat sensor node 2),Nilai payload, 3) implementasi platform LoRaWan 4) Pemilihan antena,
Dampak Serangan Wormhole terhadap Kinerja Protokol Routing Adhoc On Demand Multipath Distance Vector (AOMDV) pada Jaringan Mobile Ad-hoc Network (MANET) Mahardika Yuristyawan Putra; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 7 No 5 (2023): Mei 2023
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Mobile Adhoc Networks (MANET) adalah jaringan terdesentralisasi dan terorganisir sendiri yang bersifat dinamis, dapat berubah – ubah terhadap keluar masuknya node dalam jaringan. Dalam proses pengiriman data pada jaringan MANET dibutuhkan sebuah protokol routing. Salah satu protokol routing yang dalam jaringan MANET yaitu protokol Adhoc On-Demand Multipath Distance Vector (AOMDV). Protokol AOMDV merupakan upgrade terhadap protokol routing Ad hoc On-Demand Distance Vector Routing (AODV) yang didesain khusus untuk jaringan Adhoc yang bersifat dinamis. MANET menghadapi masalah keamanan yang akut dibandingkan dengan media kabel salah satu adalah, serangan wormhole. Serangan wormhole beroperasi dengan dua node yang bekerja sama dengan cara men-tunneling paket antara satu sama lain untuk membuat jalan pintas (atau Wormhole) dalam jaringan. Penelitian dilakukan menggunakan Network Simulator v2 (NS-2.35) dengan skenario variasi jumlah node wormhole dan jumlah node pada jaringan. Parameter pengujian yang digunakan, yaitu throughput, packet delivery ratio (PDR), dan end-to-end delay. Dari pengujian didapatkan hasil bahwa serangan wormhole berdampak terhadap penurunan maupun kenaikan terhadap kinerja dari protokol routing. Nilai throughput yang terbaik adalah 0,48893 Kbps pada skenario 60 node tanpa node wormhole. Nilai packet delivery ratio yang terbaik adalah 95,4% pada skenario 60 node tanpa node wormhole pada jaringan. Nilai end-to-end delay yang terbaik adalah 0,0194352 detik pada skenario 50 node dengan 3 pasang node wormhole pada jaringan.
Utilizing a Routing Table of Proactive MANET Routing Protocol to Monitor a Group of People Mobility Trisnawan, Primantara Hari; Siregar, Reza Andria; Robbani, Dwindra Helmi
Journal of Information Technology and Computer Science Vol. 9 No. 2: August 2024
Publisher : Faculty of Computer Science (FILKOM) Brawijaya University

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25126/jitecs.92648

Abstract

In general, a special group has a leader who is responsible for his or her members. The problem that often occurs in groups is the loss of members due to leaving the group. To overcome this problem, it is necessary to build a system that can help the leader monitor the members of his or her group by getting an alarm warning if there are members who have the potential to leave the group or even those who have left the group. Existing solution is using such one hop/direct communication, which may monitor each member too close. Then, our proposed system to overcome the limitation of a single hop wireless range is to monitor each member to some extent to reach multiple hops of wireless range. The system is developed using one of proactive MANET routing protocol, ie the Destination Sequenced Distance Vector (DSDV) protocol, and utilizes hop number information in the routing table to detect slave nodes (members' equipment) that have three or more hops from the master node (leader's equipment) or even if the slave node is lost. The testing on this system is carried out functionally and non-functionally. The results of functional testing show that the master node can produce an alarm warning in the form of a buzzer sound intermittently and the LED light flashes if there is a slave node with three number of hops or more and can produce an alarm warning in the form of a buzzer sound and the LED light flashes continuously if some slave nodes are lost. Routing table updates on this system have an average time of once every 92.445 seconds. The results of non-functional testing show that the average round trip time (RTT) required for the node to send broadcast messages is 0.208 seconds with 23 bytes of data and the average round trip time (RTT) to send SendMeYourNeighbour messages is 0.215 seconds with 43 bytes of data. Keywords: Routing table; Monitoring Mobility; Dynamic routing protocol; MANET; multihops; DSDV
Sistem Pemantauan Lahan Perkebunan berbasis Jaringan Sensor Nirkabel ZigBee Achmadi, Adrian; Amron, Kasyful; Siregar, Reza Andria
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 7 No 9 (2023): September 2023
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Lahan perkebunan memerlukan kondisi yang optimal agar tanaman mampu menyerap nutrisi dari tanah dengan baik. Kemampuan tanah untuk menyediakan nutrisi yang kemudian diserap oleh tanaman dipengaruhi oleh kelembaban dan pH tanah. Kelembaban berpengaruh terhadap jumlah air dan nutrisi yang mampu diserap oleh tanaman dari tanah. Sedangkan pH berpengaruh terhadap jumlah mikroorganisme dan kandungan nutrisi dalam tanah yang membantu tanaman untuk tumbuh dan berkembang. Pengukuran kelembaban dan pH tanah menggunakan cara analog memakan waktu yang lama dan sampel tanah yang banyak. Penelitian ini bertujuan untuk memangkas waktu pengukuran dan sampel tanah dengan bantuan Jaringan Sensor Nirkabel. Dengan bantuan dari implementasi Jaringan Sensor Nirkabel, harapan dari penelitian adalah dapat membantu petani untuk memantau lahan mereka dengan hasil yang akurat dan efektif. Pada penelitian ini, node sensor yang terdiri dari mikrokontroler dan sensor kelembaban dan pH akan melakukan pengukuran data. Lalu, data tersebut dikirim menuju node gateway menggunakan protokol komunikasi ZigBee. Node gateway akan mengunggah data yang didapat dari node sensor menuju platform ThingSpeak. Petani bisa memantau data kelembaban dan pH pada situs ThingSpeak menggunakan telepon seluler atau komputer. Setelah dilakukan pengujian, akurasi pengukuran nilai kelembaban sebesar 95,16% dan akurasi pengukuran nilai pH sebesar 97,08%. Delay rata-rata yang didapatkan saat pengukuran pada jarak 10 meter, 25 meter, 50 meter, dan 75 meter masing-masing adalah 1.014 detik, 1.031 detik, 2.661 detik, dan 3.113 detik.
Implementasi Load Balancing Web Server dengan Algoritma Dynamic Load Balancing berbasis Server pada Software Defined Network Abyantara, Za’da; Trisnawan, Primantara Hari; Siregar, Reza Andria
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 7 No 9 (2023): September 2023
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Dibandingkan dengan jaringan secara tradisional cloud-computing­ menawarkan berbagai macam keuntungan seperti fleksibilitas dalam virtualisasi jaringan, mampu mengalokasikan kebutuhan berdasarkan kepentingan pengguna dan mengatasi masalah high usage. Salah satu perkembangan ­cloud-computing untuk membantu mengatasi alokasi kebutuhan pada jaringan yaitu menggunakan Load Balancing. Beberapa penelitian sebelumnya sudah menggunakan berbagai jenis algoritma dalam arsitektur jaringan SDN(software defined network) yaitu round robbin, shortest delay, random dan algoritma berbasis penggunaan CPU dengan hasil yang berbeda-beda. Untuk mengetahui beban yang diterima oleh server maka digunakan parameter nilai penggunaan CPU dan memori pada masing-masing server. Sistem ini bekerja menggunakan algoritma dynamic load balancing dengan memilih server mana yang memiliki nilai penggunaan memori dan cpu terendah dari setiap server guna untuk menentukan server mana yang akan menangani request dari client. Hasil dari penggunaan algoritma dynamic load balancing akan dibandingkan dengan hasil penggunaan dari algoritma random dan round-robbin dengan parameter nilai response time dan nilai troughput serta akan menggunakan skenario uji yang sama. Pada algoritma dynamic load balancing, server 3 memiliki penggunaan cpu dan memori lebih rendah yaitu 16,15% dibandingkan dengan penggunaan algoritma random dan round-robbin yaitu 19,77% dan 19,37%. Dan pada server 2 penggunaan cpu dan memori saat menggunakan algoritma dynamic load balancing bernilai lebih tinggi yaitu 7,45% jika dibandingkan dengan penggunaan algoritma random dan round-robbin yaitu dengan nilai 6,37% dan 6,41%. Pada algoritma dynamic load balancing, server 1 memiliki penggunaan cpu dan memori lebih tinggi yaitu 9,59% dibandingkan dengan penggunaan algoritma random dan round-robbin yaitu 9,52% dan 9,28%.
Co-Authors Abyantara, Za’da Achmad Basuki Achmadi, Adrian Adam Hendra Brata Adam Syahputra Adhitya Bhawiyuga Adhitya Bhawiyuga, Adhitya Aditya Prayudhi Ahmad Aji Santoso Ahmad Faiz Ahmad Hanif AR Ahmad Lutfi Bayu Aji Ahmad Rizal Muttaqin Aladina, Yohanna Fransiska Alldo Raafi'ilman Andi Mohammad Thareq Akbar Annisa Widuri Murti Utami Anugerah Wijaya Ardhian Rizki Ramadhani Ari Kusyanti ari kusyanti Asika Ayu Wandira Asroful Khusna Arifianto Atha, Mochamad Audi Azzura Falaq Audi Fauzan Septano Bangsa, Rehan Putra Chandra Yogi Adhitama Cut Naurah Cassrisa Daffarez Elguska Dahru Wildan Pradanaputra Danny Candra Rumantyo Dany Primanita Kartikasari Dany Primanita Kartikasari Dany Primanita Kartikasari Destyorini, Diah Ratih Donny Kurniawan Dyan Krisyanto Dzaki, Alvin Pradano Ekky Pramudito Setiawan Eko Aditya Ramadianto Eldyto Puspa Laksana Fadhlan Muhammad Fariz Andri Bakhtiar Faruqi, Ibrahim Zhilal Fauzan Pahlawan Fedro Jordie T. H. Simangunsong Fitra Firdaus Gibran Akbaromi Luhkito Haidar Harfi Hadhiansah Heru Nurwarsito Hidayatus Syafa'ah Hilkya Dwima Palembangan Hilmy Riadika I Dewa Gede Ardana Pucanganom I Gede Wahyu Sanjaya I Made Oka Semara Putra Imaduddin, Muhammad Fakhri Imam Nurhidayat Imam Utomo Iman Aidil Nugraha Indra Lesmana Putra Isnaini Isnaini Ivan Faturahman Jaliasmar, Rendy Putra Jogi Oliver Yohanes Tampubolon Julio Dimitri Fredrik Kasyful Amron Kasyful Amron Khalid Hamzah Haza Al Hamami Labib Imam Hidayat Mahardika Yuristyawan Putra Mahendra Data Maxi Luckies Ginanjar Azis Miftaqul Novandi Moh. Ahsani Taqwim Mohammad Harits Mohammad Rizky Dwisaputra Muhamad Ralfi Akbar Muhammad Alfarizi Muhammad Alif Bahari Muhammad Alvian Syahputra Muhammad Ichwan Pradana Muhammad Muhajir Kurniawan Muhammad Reza Wahyu Chrisdyan Muhammad Ryan Firmansyah Muhammad Syaifuddin FP Muhammad Taufiq Aryadi Mulyadi, Yonathan Fanuel Nur Cahyo Utomo Nurovi Andiyani Nurudin Santoso Nurul Hidayat Pramukantoro, Eko Sakti Prasetyo Eko Yulianto Primantara Hari Trisnawan Puspita Ainunnazahah Ragil Setyo Utomo Rakhmadhany Primananda Rakhmadhany Primananda, Rakhmadhany Rakhmashany Primananda Ravy Agistya Alkamaly Retno Nizma'urrahmi Rian Bayu Pambudi Risqi Nuril Aimah Rivai Fansuri Nasution Rizky Suhaimi Robbani, Dwindra Helmi Rozali Syahputra Ryan Eko Listyanto Selma Aulia Sekarrizky Siska Irawati Sutrisno, Bagasdio Tasrahmiati Istiqomah Thelemanica Wicaksana Tiara Erlinda Tommy Bona Hamonangan Sitorus Trisnawan, Primantara Hari Tsany Afif Ula Auliya Ilham Irsahnda Widhi Yahya Widhi Yahya Yanuar Alfianus Yosephan Raharjo Yosua Tito Sumbogo Yudhanto, Alif Alamsyah