Article Per Year (5 Year)
p-Index From 2021 - 2026
3.384
P-Index
This Author published in this journals
All Journal Journal of Computer Science and Informatics Engineering (J-Cosine) EDUMATIC: Jurnal Pendidikan Informatika Jurnal Teknologi Informasi, Komputer, dan Aplikasinya (JTIKA ) Jurnal Teknimedia: Teknologi Informasi dan Multimedia Jurnal Begawe Teknologi Informasi
Jatmika, Andy Hidayat
Universitas Mataram
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Education Engineering

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

Found 35 Documents
Search

 1   2   3   4 
Rancang Bangun Website SARANG (Sampah Terang) untuk Membantu Masyarakat Kota Mataram dalam Jual Beli Sampah Daur Ulang Secara Online: Design and build a website application to help people of Mataram City in buying and selling recycled waste Andy Hidayat Jatmika; Muhammad Lanang Agung Anggoro
Jurnal Begawe Teknologi Informasi (JBegaTI) Vol. 4 No. 2 (2023): JBegaTI
Publisher : Program Studi Teknik Informatika, Fakultas Teknik Universitas Mataram

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29303/jbegati.v4i2.1109

Abstract

Kota Mataram, yang terletak di Pulau Lombok, Provinsi Nusa Tenggara Barat (NTB) menghadapi tantangan yang signifikan terkait manajemen sampah. Pertumbuhan penduduk yang cepat dan aktivitas ekonomi yang berkembang telah menghasilkan peningkatan produksi sampah, yang dapat memiliki dampak negatif terhadap lingkungan dan kesehatan masyarakat. Daur ulang adalah salah satu solusi yang sangat efektif untuk mengatasi permasalahan sampah yang semakin memburuk di berbagai komunitas di seluruh dunia, termasuk di Kota Mataram. Berdasarkan hasil survey dan wawancara, banyak masyarakat di Kota Mataram yang berusaha untuk berkontribusi dalam upaya daur ulang sampah, tetapi mereka sering kali merasa kebingungan tentang bagaimana menjual sampah daur ulang dengan efisien dan menguntungkan. Untuk mengatasi permasalahan tersebut, diusulkan pembuatan website SARANG (Sampah Terang) sebagai solusi inovatif untuk mengatasi tantangan dalam penjualan dan pembelian sampah daur ulang. Website ini bertujuan untuk memberi kemudahan bagi pembeli untuk menemukan pasokan bahan baku daur ulang yang berkualitas dan murah. Dari uji coba yang dilakukan selama 3 hari yang dimulai dari tanggal 7 – 10 Agustus 2023 didapatkan 22 responden dengan nilai rata – rata 10% menjawab sangat kurang setuju, 2.7% tidak setuju, 3.62% cukup, 36.36% setuju, dan 47.32% menjawab sangat setuju. Kata kunci : Daur ulang Sampah, Website pengelolaan sampah, MongoDB, ExpressJS
OPTIMASI PROTOKOL ROUTING DSDV MENGGUNAKAN ALGORITMA TIME PREDICTION PADA JARINGAN MANET Baiq Safitri Rabiah Adawiyah; Andy Hidayat Jatmika; Raphael Bianco Huwae
TEKNIMEDIA: Teknologi Informasi dan Multimedia Vol. 6 No. 1 (2025): Juni 2025
Publisher : Badan Penelitian dan Pengabdian Masyarakat (BP2M) STMIK Syaikh Zainuddin NW Anjani

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.46764/teknimedia.v6i1.253

Abstract

The rapid movement of nodes and signal interference in Mobile Ad Hoc Networks (MANETs) cause communication routes to become unstable and often lead to packet loss. One of the major drawbacks of the Destination Sequenced Distance Vector (DSDV) protocol is its inability to maintain optimal network performance under such conditions. To address this issue, this study proposes a modification of the DSDV protocol by implementing a node's residual time prediction algorithm, named TimePrediction-DSDV, to enhance route stability and reduce the impact of signal interference. Simulations were conducted using Network Simulator version 2.35 on the Linux Ubuntu 14.04 operating system, with node density scenarios of 25, 50, and 100 nodes, and speeds of 30, 60, and 90 m/s in a 1500x1500 meter squared area. The performance parameters tested included throughput, end-to-end delay, and packet delivery ratio (PDR). The simulation results show that TimePrediction-DSDV significantly improves performance across all scenarios. For the throughput test, the average increase was 15% for 25 nodes, 14.5% for 50 nodes, and 13% for 100 nodes. For the end-to-end delay test, the decrease was 22% for 25 nodes, 20.8% for 50 nodes, and 19.5% for 100 nodes. For the Packet Delivery Ratio (PDR) test, the increase was 12.5% for 25 nodes, 11.6% for 50 nodes, and 10.67% for 100 nodes. Although network performance decreases with increased node density and speed, TimePrediction-DSDV consistently shows better results compared to the standard DSDV in all tested scenarios.
MENINGKATKAN KINERJA PROTOKOL ROUTING AOMDV UNTUK MENCARI RUTE BERDASARKAN PERGERAKAN NODE DAN MENGURANGI BROADCAST STORM DALAM JARINGAN MANET Mei Sukriani; Andy Hidayat Jatmika; Raphael Bianco Huwae
TEKNIMEDIA: Teknologi Informasi dan Multimedia Vol. 6 No. 1 (2025): Juni 2025
Publisher : Badan Penelitian dan Pengabdian Masyarakat (BP2M) STMIK Syaikh Zainuddin NW Anjani

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.46764/teknimedia.v6i1.254

Abstract

Rapid topology changes in Mobile Ad Hoc Networks due to node movement often cause network instability. Each node in the network can move freely with varying speeds in different directions. As a result, the connection between devices can be disconnected or reconnected depending on the different communication ranges. Node movement causes constraints on the communication path created by AOMDV, because it does not take into account node mobility, so AOMDV has difficulty in maintaining route stability. This study aims to improve the performance of the AOMDV routing protocol in MANET by using the TimePrediction algorithm to improve the calculation of node movement during the route search process. This approach involves modifying the "Hello" message so that the position and speed information of neighboring nodes, which will be sent gradually to ensure communication between nodes. adding location and speed information of each device into the message that will be sent by each other. The TimePrediction protocol was created to overcome the problem of a constantly changing network. By predicting where nodes in the network will move, this protocol can also create a more stable communication path. The results showed that the TimePrediction AOMDV protocol successfully increased the average throughput by 5.39% for 50 nodes, 6.48% for 75 nodes, and 6.87% for 100 nodes. In addition, the average end-to-end delay decreased by 5.39% for 50 nodes, 6.48% for 75 nodes, and 6.87% for 100 nodes. The packet delivery ratio also increased by an average of 7.19% for 50 nodes, 8.80% for 75 nodes, and 12.70% for 100 nodes.
PENCARIAN RUTE BERDASARKAN PERGERAKAN NODE TETANGGA PADA PROTOKOL ROUTING AODV UNTUK MENEMUKAN RUTE YANG HANDAL DI JARINGAN MANET Novita Mabruka Azahra; Andy Hidayat Jatmika; Raphael Bianco Huwae
TEKNIMEDIA: Teknologi Informasi dan Multimedia Vol. 6 No. 1 (2025): Juni 2025
Publisher : Badan Penelitian dan Pengabdian Masyarakat (BP2M) STMIK Syaikh Zainuddin NW Anjani

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.46764/teknimedia.v6i1.255

Abstract

The movement of nodes in a Mobile Ad Hoc Network (MANET) is very dynamic and unpredictable. Each node in this network moves freely at different speeds and directions, which causes continuous changes in the network topology. The movement of nodes affects the communication path between nodes, as connec-tions between nodes are lost or re-established according to the position of the node whether it is still with-in communication range or not. In addition, the movement of nodes also affects the performance of rout-ing protocols used in finding routes, such as AODV (Ad hoc On-Demand Distance Vector). The AODV routing protocol does not take into account the movement of neighboring nodes in finding routes, so the route found can be quickly disconnected because the nodes involved in the route move away, out of range of the communication signal. This research aims to improve the performance of the AODV routing proto-col by considering the movement of nodes in the route finding process using the TimePrediction algorithm. The approach used includes modifications to Hello messages, so that they also include position and ve-locity information of neighboring nodes. Hello messages are packets sent periodically by each node in a MANET network to inform neighboring nodes of its presence. The results show that from a given node speed variation, TimePrediction-AODV routing protocol is able to provide better average throughput im-provement of 8.63% for 20 nodes, 29.10% for 40 nodes, and 60.70% for 60 nodes, better average PDR improvement of 6.06% for 20 nodes, 20.54% for 40 nodes, and 27.50% for 60 nodes, and average end-to-end delay reduction of 31.53% for 20 nodes, 28.86% for 40 nodes, and 43.98% for 60 nodes compared to standard AODV.
PENCARIAN RUTE BERDASARKAN JARAK NODE TERDEKAT DAN EFISIENSI ENERGI PADA PROTOKOL ROUTING AOMDV DI JARINGAN MANET Muhamad Rizqi Duha Pramudya; Andy Hidayat Jatmika; Raphael Bianco Huwae
TEKNIMEDIA: Teknologi Informasi dan Multimedia Vol. 6 No. 1 (2025): Juni 2025
Publisher : Badan Penelitian dan Pengabdian Masyarakat (BP2M) STMIK Syaikh Zainuddin NW Anjani

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.46764/teknimedia.v6i1.256

Abstract

The distance of nodes when communicating is a major challenge in route finding. The long distance of nodes will consume a lot of energy in the routing process so that the occurrence of failure or disconnection of the routing path becomes a problem that needs to be considered. One of the weaknesses in the AOMDV protocol is that it does not pay attention to node distance and node energy in the routing process. Therefore, this research proposes to modify the standard AOMDV routing protocol by adding the Preserving Energy Optimization Algorithm to identify node selection based on the node's distance to the source node by considering the node's energy in the routing process. The approach used includes modifications to the Hello message, so that the message has a geographic location based on x and y coordinates. The simulation was conducted using NS-2.35 on Linux Ubuntu operating system. The test parameters include energy consumption, end-to-end delay and packet delivery ratio (PDR). The simulation results of applying the PEO-AOMDV algorithm provide significant performance on all tested parameters. In terms of energy consumption, there is a saving of 16.04%. In addition, there is a decrease in average end-to-end delay by 43.08% to an increase in PDR percentage by 15.17% at various node density variations.
Co-Authors Abdul Chalel Rahman Afwani, Royana Agitha, Nadiyasari Ahmad Zafrullah Mardiansyah Ahmad Zafrullah Mardiansyah Ahmad Zafrullah Mardiyansyah Anggi Fitriani Ari Hernawan Ariyan Zubaidi Ariyan Zubaidi B. Nurwahyu Hairani Baiq Alung Septiya Nirmala Baiq Safitri Rabiah Adawiyah Basariah Budi Irmawati Fitri Bimantoro Heri Wijayanto I Gde Putu Wirarama Wedashwara I Gede Putu Wirarama Wadashwara Wirawan I Made Windra Yudistiana I Putu Gede Krisna Parwata I Wayan Agus Arimbawa Juan Dwiky Liestanto Laeli Oktami Lalu Ikhwan Rosadi Lalu Yusran Said Mei Sukriani Mila Rosiana Moh Ali Albar Muhamad Rizqi Duha Pramudya Muhammad Lanang Agung Anggoro Nazibullah Nazibullah Ni Desak Ketut Pujika Dewi Niana Niana Nini Kurnia Safitri Noor Alamsyah Noor Alamsyah Novita Mabruka Azahra Nurul Hidayah Nurul Umami Priya Tama Sugara Ramaditia Dwiyansaputra Raphael Bianco Huwae Rhomy Idris Sardi Sri Endang Anjarwani Suri Darmiantini Wirarama Wedashwara Wirarama Wedashwara Wirarama Wedashwara Yunia Puspita Wulandari