Article Per Year (5 Year)
p-Index From 2021 - 2026
6.306
P-Index
This Author published in this journals
All Journal Jurnal Teknologi Informasi dan Ilmu Komputer Journal of Information Technology and Computer Science Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer IKRA-ITH Informatika : Jurnal Komputer dan Informatika
Reza Andria Siregar
Fakultas Ilmu Komputer , Universitas Brawijaya
Computer Science & IT Control & Systems Engineering Education Electrical & Electronics Engineering Engineering

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

Found 103 Documents
Search

 1   2   3   4   5 
Analisis Routing Multi Copy Dengan Stationary Relay Node Dan Management Buffer First In - First Out (FIFO) Pada Delay Tolerant Network (DTN) Muhammad Reza Wahyu Chrisdyan; Rakhmadhany Primananda; Reza Andria Siregar
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 (670.92 KB)

Abstract

On the delivery of digital data, a big delay is one of the factors in failure of the receipt of message. On this problems, one theory that can be applied is a DTN network (delay tolerant networking). DTN has advantages when its applied to network with long delay characteristics, the high degree of loss, and the low level of connectivity and minimal infrastructure. Multi Copy routing types on DTN can maximize the ratio of delivery and reduce delays but requires additional network resources. A lot of research that assumes a network resource is infinite, one of them is buffer. DTN can implement Buffer management policy as a limited buffer optimization when sending messages. Stationary Relay Node at DTN can be used this way to increase probability of the acceptance of the message as well as a bridge for sending messages. At this time, the research protocol comparing DTN routing Multi Copy by adding stationary Relay Node and Buffer management algorithm with a first in-first out were simulated using a Simulator. The test results are analyzed using the performance parameters of the probability of shipping and Overhead ratios with scenarios using epidemic routing, prophets and spray and wait by moving as many as 150 nodes and Node Relays as many as 10 Stationary, the message size of 5 MB and 30 MB of buffer limitation, 50 MB, 80 MB and 100 Mb. From the results of testing and analysis can be concluded that routing spray and wait is effective to convey the message with the network load that is lower than the other routing that applied with the greatest probability value delivery 0.2464 and Overhead ratio amounted to 10.85%.
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.
Analisis Perbandingan Dampak Serangan Black Hole Pada Kinerja Routing Protocol LAR (Location-Aided Routing) dan DYMO (Dynamic Manet On-Demand) di Mobile Ad-Hoc Network (MANET) I Dewa Gede Ardana Pucanganom; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 3 (2019): Maret 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Mobile Ad-Hoc Network is a network consisting of nodes that can move in all directions (mobile). These nodes can communicate with temporary communication channels). On mobile ad-Hoc networks, routing protocol is useful in determining the best data packet delivery path. Issues that exist in the MANET network are limited bandwidth, energy, transmission range, and security. In the security aspect, data packet is still vulnerable to forms of attack, one of them is black hole that can dropping data packets. To knowing the routing protocol's performance against black hole attacks, then the performance analysis of reactive routing protocols (Dynamic MANET On-Demand and Location-Aided Routing) needed. When black hole run, the average value of packet delivery ratio routing protocol LAR and DYMO is 51.38% and 51.92%. The average end to end delay value of LAR and DYMO routing protocol is 70.58 ms and 24.01 ms. The average value of normalized routing load of routing protocol LAR and DYMO is 2.68 and 1.38. Based on the comparison of these average values, the DYMO routing protocol gets better performance than the LAR routing protocol in the normalized routing load, average end to end delay and packet delivery ratio parameters when black hole is run.
Analisis Kinerja Routing Protocol Ad-hoc On Demand Multipath Distance Vector (AOMDV) Menggunakan Pergerakan Gauss-Markov Pada Mobile Ad-hoc Network (MANET) Eko Aditya Ramadianto; Rakhmadhany Primananda; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 3 (2019): Maret 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Mobile Ad-hoc Network (MANET) is a topology that consist of several wireless nodes which can configure dynamically without using fix existing network infrastructure. Nodes in MANET can move freely and between nodes are connected through wireless networks. Due to the dynamic topology, an appropriate routing protocol is needed in determining the routing path between nodes in MANET topology. Ad-hoc On Demand Multipath Distance Vector (AOMDV) is a multipath routing protocol which used in this research. Multipath routing protocols can determine several routes between source nodes and destination nodes, this will provide benefits in terms of performance such as increased performance on network reliability. Beside routing protocol, a mobility model is needed to maintain the movement of nodes. Gauss-Markov is a mobility model used in this research, where Gauss-Markov will maintain movement of nodes based on the speed and angle (alpha) of movement. This research discuss analysis Ad-hoc On Demand Multipath Distance Vector (AOMDV) routing protocol using the Gauss-Markov mobility model on Mobile Ad-hoc Network (MANET) using Network simulator 2. The results of the simulation are if the number of nodes and the area of the simulation are increasing the value of end to end delay and normalized routing overhead will be increased, while the value of throughput tends to be decreased.
Dampak Serangan Black Hole Terhadap Protokol Routing Destination-Sequenced Distance Vector (DSDV) Dengan Model Mobilitas Random Pada MANET Asroful Khusna Arifianto; Rakhmadhany Primananda; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 3 (2019): Maret 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Mobile ad hoc network (MANET) is a wireless network that consists of a mobile node and has a non-fixed infrastructure. In the absence of a fixed infrastructure in MANET causes the node has an arbitrary movement. The MANET node can enter and exit the network freely, this causes MANET to be vulnerable to attacks. One of the attacks on MANET was a black hole attack. In this study using destination-sequenced distance vector (DSDV) routing as well as random waypoint mobility models and random direction models. The simulation parameters in this study are the area of ​​1000x1000m2, 700x700m2, 500x500m2, number of nodes 40, 50, 60 nodes with 5, 10, 15 and 20 black hole nodes. This study aims to determine the impact of black hole attacks on the DSDV routing protocol on random model mobility. The test parameters used are delivery ratio packages, average end-to-end delay, and normalized routing load. Based on the results of tests conducted, it was concluded that in the area of ​​1000x1000m2 and 700x700m2 the DSDV routing protocol on random waypoints had a greater impact than the DSDV routing protocol in a random direction. In the area of ​​500x500m2, the DSDV routing protocol in random direction has a greater impact than the DSDV routing protocol at random waypoints.
Analisis Pengaruh Blackhole Attack Terhadap Kinerja Protokol Routing BATMAN (Better Approach To Mobile Ad Hoc Network) Pada Mobile Ad Hoc Network Imam Nurhidayat; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 3 (2019): Maret 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Mobile Ad-hoc Network (MANET) is a network architecture consisting of several nodes that move freely and communicate with each other. Each node can function as a router or client for other nodes. MANET has 3 types of routing protocols, namely proactive, reactive and hybrid routing protocols. BATMAN (Better Approach to Mobile Adhoc Network) is one of the routing protocols on MANET. In terms of security, MANET is still vulnerable to various forms of attacks, especially against active attacks that can destroy, modify, and delete data and information. One type of active attack that can occurs in MANET is blackhole attack. Blackhole Attack is an attack that can cause loss of data packets. Based on the above problems, the authors made a study entitled Analysis the Effect of Blackhole Attack on the Performance of the BATMAN (Better Approach To Mobile Adhoc Network) Routing Protocol on Mobile Adhoc Network. The results obtained in this study are blackhole attacks affect the performance of the BATMAN routing protocol. Testing is done using OMNET ++ with a test scenario in the form of variations in number of nodes, number of attacking nodes, and area of ​​the simulation. Test parameters used are packet delivery ratio (PDR) and packet loss. The packet loss calculation is only done on packets dropped by the attacker node. The test results show that the lowest packet delivery ratio is 14,24% in the 30 node scenario with an area of ​​1200x1200 m2. While the highest average packet loss is 56.62% in the 30 node scenario with an area of ​​1000x1000 m2.
Perbandingan dan Pengaruh Handover Terhadap Kinerja Penjadwalan Paket Round Robin dan Proportional Fair Pada Jaringan LTE Chandra Yogi Adhitama; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 3 (2019): Maret 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Long Term Evolution (LTE) is a network that has many users using it to get information. Because mobile users are currently on this network, a packet scheduling algorithm is needed to schedule packages for ubiquitous communication. This research will discuss the performance of the packet scheduler Round Robin and the Proportional Fair and the effect of the handover on that packet schedulers. This research was conducted by simulating an LTE network in the NS-3 simulator and produce data that is reprocessed so that a value is formed to measure the performance of the packet scheduling algorithm such as throughput, packet loss ratio, delay, and jitter. These data will be analyze by comparing them from the results of the Round Robin scheduling algorithm and the Proportional Fair scheduling algorithm.
Analisis Kinerja Protokol AODV (Ad Hoc On-Demand Distance Vector) dan AOMDV (Ad Hoc On-Demand Multipath Distance Vector) Terhadap Serangan Aktif Pada Jaringan Manet (Mobile Ad Hoc Network) Muhammad Alif Bahari; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 4 (2019): April 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

MANET (Mobile Ad hoc Network) is a network that does not have a fixed infrastructure and the nodes in it function as routers to forward the information that is sent. MANET has 3 types of routing protocols, namely proactive, reactive and hybrid routing protocols. AODV (Ad Hoc On Demand Distance Vector) and AOMDV (Ad Hoc On Demand Multipath Distance Vector) are reactive type protocols found on MANET. Security on MANET is a big challenge, because nodes will be connected to one unprotected wireless network. Based on the above problems, the authors made a study entitled Performance Analysis of AODV Protocol and AOMDV Against Active Attacks on MANET (Mobile Ad hoc Network) networks. The results obtained from this study are proven that active attacks in the form of Blackhole and DDoS attacks of type Flooding RREQ Attack affect the performance of the two protocols. Tests in this study were conducted on Network Simulator 2 and measured based on 3 parameters, namely Packet Delivery Ratio, End-To-End Delay, and Normalized Routing Load. The test results show that the lowest value of Packet Delivery Ratio is found in the 100 node scenario using the AOMDV protocol with the type of DDoS attack that is worth 52.00%. While the highest end-to-end delay value is found in the 100 node scenario using the AODV protocol with DDoS attack types that are worth 134.25 ms. The highest average value of Normalized Routing Load is found in the 100 node scenario using the AOMDV protocol with DDoS attack types valued at 158.8.
Analisis Pengaruh Kepadatan Node terhadap Kinerja Protokol Routing DYMO dan DSR Pada Mobile Ad-Hoc Network (MANET) Muhammad Syaifuddin FP; Primantara Hari Trisnawan; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 4 (2019): April 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Mobile ad-Hoc Nertwork (MANET) is a technology that has the ability to adapt to the condition of mobile nodes. Each node has the same position that is doing a routing function that can determine and forward communication lines between nodes, so that a routing protocol is needed that can handle the exchange of data in providing an optimal routing path. The routing protocol used in this study is reactive routing, namely DYMO and DSR. The DYMO and DSR routing protocols route formation from the source node to the destination node based on the request of the source node. This study using Network Simulator 2.35 with a node density scenario using variations in the number of nodes totaling 50 nodes to 200 nodes with multiples of 10 nodes, and variations in data packet size using packet sizes of 512 bytes and 1024 bytes. Performance is measured based on average throughput, end to end parameters delay, packet loss, and average jitter with the best values in a row are 101.45 KBps in the data packet size of 512 bytes, 44.26 ms in the data packet size of 512 bytes, 2.36% in the size of a 512 bytes data packet, 1.72 ms in the data packet size of 512 bytes. These results were obtained on the DYMO routing protocol, so it can be concluded that the DYMO routing protocol has better performance than DSR in the aspect of node density with different packet size variations.
Analisis Kinerja Protokol Routing Destination Sequence Distance Vector (DSDV) dan Optimized Link State Routing (OLSR) Berdasarkan Mobilitas Gauss-Markov Pada Mobile Ad-hoc Network (MANET) Aditya Prayudhi; Rakhmadhany Primananda; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 4 (2019): April 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Wi-fi technology is very dependent on the infrastructures, therefore Mobile Ad-Hoc Network (MANET) arises as a solution to this problem. MANET is a network technology that can run without a centralized infrastructure. MANET also needs a protocol so that every devices can communicate with each other. DSDV and OLSR are the protocols commonly used in MANET. Simulation is needed to determine which protocol is better in a certain network condition. Researchers mainly used software simulator to help them simulate MANET because real life simulation costs too high. Mobility model is needed so that nodes in simulation can represent mobile devices properly. The example of a mobility model is gauss-markov. In this mobility model, initially the node will run with a certain speed and direction, then after some time interval the calculation of destination and speed will be carried out based on the destination and speed of the node at that time. This research examined the performance of DSDV and OLSR using the gauss-markov mobility model. The results of the tests conducted, the OLSR protocol generally has better performance. But the advantages of the DSDV protocol are lower end-to-end delay values when testing with fewer nodes and lower node speeds.
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 Azmi, Zhafran Rama 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 Nugraha, Rayhan Egar Sadtya 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