Article Per Year (5 Year)
p-Index From 2021 - 2026
5.729
P-Index
This Author published in this journals
All Journal International Journal of Electrical and Computer Engineering Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer
Rakhmadhany Primananda
Fakultas Ilmu Komputer , Universitas Brawijaya
Computer Science & IT Control & Systems Engineering Education Electrical & Electronics Engineering Engineering

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

Found 151 Documents
Search

 2   3   4   5   6 
Implementasi Smart Identification Menggunakan Perangkat Smartphone dengan Raspberry PI (Studi Kasus : SMAN 2 Balikpapan) Muhammad Alfarizi; Rakhmadhany Primananda; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 8 (2018): Agustus 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Information Communication Technology (ICT) that is now supposed to be implemented to realize smart school needs more efficient services to achieve the transformation stage of change on ICT. Smart school is to optimize the technology used by students and schools to connect each other like attendance system which now no longer have to fill in written or manual signature. Therefore built smart identification system to integrate the server with mobile devices that students use by utilizing wireless technology. This Smart Identification will identify the mac address contained in the mobile device used by the students, as it will be more efficient for the attendance system that is only sufficiently connected with the access point with the result of stress test test using siege from 20 virtual users with elapsed time 59.65 second, average transaction rate 191.28 trans / sec, throughput 0.05 MB / sec, data transferred 2.98 Megabyte and percentage performance of Central Processing Unit ( CPU) in the range 85 to 95 percent but the system is still able to run well with no lag, system eror or failed transactions. Smart schools that support the smart identification system will be the basis of data user that will later be integrated into other systems.
Perbandingan Performa Database Apache HBase dan Apache Cassandra Sebagai Media Penyimpanan Data Sensor Internet of Things Dimas Malik Ibrahim; Rakhmadhany Primananda; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 8 (2018): Agustus 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Nowadays, internet has dominated the world, millions of data is exchanged daily either through web/mobile apps or internet use involving the objects around us to be able to communicate each another (currently known as Internet of Things/IoT). IoT requires a database with a good performance to be used as its storage media. Good performance it is like fast inserting data process and high level of availability. There are two types of databases at this time, Relational Database and Not Only SQL (NoSQL) Database. NoSQL Database is the proper type to be used as data storage media on IoT system because it has better scalability and availability level than Relational Databases. Of the many NoSQL Database, the author chooses HBase and Cassandra to compare their performance in this research, because both are the best in database Column-based storage model. The authors test the Throughput, Latency, Runtime CPU Usage, and Memory Usage using JMeter and YCSB to compare the performance of both these databases. The results suggest that Cassandra has Throughput, Latency and Runtime that is better than HBase. Meanwhile, HBase has CPU Usage and Memory Usage better than Cassandra.
Analisis Pemakaian Energi Pada Sensor Node Dengan Protokol Komunikasi Zigbee Menggunakan Solar Cell Nur Cahyo Utomo; Rakhmadhany Primananda; Reza Andria Siregar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 9 (2018): September 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Communication protocol on OSI Layer standardization, divided into several layers among them is data link layer. This layer divided into sub layers, one of which is MAC (Medium Access Control) used to transmit signals owned by nodes connected to the network without any conflict. Zigbee is one of the standardized communication protocols on the MAC sub layer that are known to be reliable and low power. With zigbee, the researcher has the idea of ​​analyzing the power consumption level when this protocols are communicates. The communication system between the nodes was tested using xbee s-1 with arduino uno as microcontroller, and because xbee s-1 low power researchers gave solar cells as resources. Solar cells are used because they have self charging capabilities. System testing includes, changes in environmental conditions when nodes communicate. The last step in this research is to analyze the result data from the test to conclude the result of the research. The result of this research is zigbee communication using solar cell resources can be used in areas where the air temperature is stable and there are heat sources. The power of calor can provide arduino microcontroller power and xbee s-1 module to be used in communicating. Changes in working environment in the form of distance, delivery of packets, temperature, and time intervals applied by researchers can affect the level of power consumption. Researchers recommend environmental conditions that are used so that the system can be run optimally. The use of the zigbee protocol would be optimal if used at a distance of 60-70 m, data transmission by 60 - 80 bytes, temperatures at <30 and> 20 ° celcius, and time intervals 25-35 seconds.
Analisis Performa Routing SPIN (Sensor Protocol for Information Via Negotiation) pada Wireless Sensor Network Salsabila Salsabila; Rakhmadhany Primananda; Edita Rosana Widasari
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 9 (2018): September 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Wireless Sensor Network is a network consisting of several nodes that have dynamic properties. This technology can be used to solve existing problems on routing. An example is SPIN routing. In this research the writer tries to analyze SPIN-BC and SPIN-RL routing, which SPIN-BC and SPIN-RL routing can overcome traffic queue on data delivery and can communicate more than one node (broadcast). The research aimed at determining the performance of SPIN-BC and SPIN-RL. routing anymore and the performance of both routing that were done by testing with some parameters. These parameters were Average Latency, Number Data Packets Forwarded, Tx Power, Number Tx.Frames and Memory Node. In the test that had been done by SPIN-BC and SPIN-RL routing with nodes of 4,8,12,16, and 20 had latency mean value of 0.01856 ms, while the SPIN-RL routing had an average value of 0.83633 ms. The average test of NB Packet Data Forward on SPIN-BC routing was obtained averaged of 1.605 ms and SPIN-RL was obtained average of 7.88917 ms. The average value that was obtained by TX Power on SPIN-BC and SPIN-RL routing testing was 0.63292 mw. Furthermore, the average result that was obtained from Nb Tx Frame parameter on SPIN-BC routing was 1.7 ms, while SPIN-RL was obtained average of 7.9 ms. Then the test of the average result from the memory node was on SPIN-BC 7,56 MB, and SPIN-RL 34,454 MB. Based on the average results above, it can be concluded that SPIN-RL had better performance compared with SPIN-BC, because SPIN-RL can cope with command transmission error that was caused by data loss.
Implementasi Penyimpanan Data Sensor Nirkabel dengan MongoDB pada Lingkungan IOT Menggunakan Protokol MQTT Pramudya Mahardika Kusumawardhana; Mochammad Hannats Hanafi Ichsan; Rakhmadhany Primananda
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 9 (2018): September 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Internet of Things (IoT) is the machine-to-machine or machine to application communication concept which has the vision that billion of sensors, actuators, and many daily devices could be connected to the internet. Message Queue Telemetry Transport (MQTT) is one of the protocol included in Internet of Things which is useful to save power and reduce the size of packet data messaging. Therefore, it is important to study the ability of modern IoT systems to handle high rates of data updates coming from devices. The upcoming thing in the future is about storage media to handle the IoT data, such as a database system to store the data. A flexible database which could handle the data from the IoT device is required. The writer in this work will evaluated the performance of Not Only SQL (NoSQL) MongoDB Database towards MQTT Protocol. In this work, writer use the parameter for the performance testing is the Load Testing. The process practice for the MQTT Protocol as a sensor data transmission media uses NodeMCU microcontroller with the publish and subscribe method. Load Testing method was choosen as a technique to test the relation between the execution time of MongoDB to store the data of the sensor from MQTT protocol. From this work, claimed that NodeMCU could be configurated with MQTT Protocol, with a 75% accuracy of success for connection within the range from 4 meter to 20 meter. From this work we also got that the execution time for MongoDB to store 50 to 1500 data without the database being configured is less than 0.5 Second, and the execution time for MongoDB to store 50 to 1500 data if the database was already set needs less than 0.2 second to store.
Analisis Perbandingan Performansi Algoritme Floyd-Warshall dan Algoritme Johnson untuk Penentuan Rute Terpendek pada Software Defined Network Mohamad Ilham Firdaus; Rakhmadhany Primananda; Mochammad Hannats Hanafi Ichsan
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 9 (2018): September 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The growth of computer network technology has an impact on the high demand for network performance and increasingly control network complexity. Network performance can be affected by network management, one of which is routing protocol. On a conventional network, routing protocol configuration is inflexible, inefficient and needs to configure each network device. One of the solution for this problem is SDN (Software defined network). The programmable SDN control plane make it possible to implement routing application. This research uses two kind of shortest path algorithm those are Floyd-Warshall algorithm and Johnson algorithm. Both algorithms are implemented in ryu controller and mininet as SDN network simulator. Packet loss dan delay testing has no significant difference. In the packet loss testing Floyd-Warshall has an average of 2,33% compared to Johnson with an average of 2,48%. While the result of delay testing, the average delay of Floyd-Warshall is 4,08 ms compared to Johnson with an average of 4,02 ms. Convergence time testing, Johnson is faster when the number of switches 6 and 10. While Floyd-Warshall is better when the number of switches 14. In cpu usage testing, Johnson algorithm consumes more resources with an average of 23,84% compared to Floyd-Warshall algorithm with an average of 21,78%. While the result of memory usage of both algorithm equally consume 1,3% of memory.
Analisis Dan Implementasi Load Balancing Pada Web Server Dengan Algoritme Shortest Delay Pada Software Defined Network Lucky Ronny Chandra Negara; Widhi Yahya; Rakhmadhany Primananda
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 9 (2018): September 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Software defined network separation between network architecture is a control plane and data plane. One example of a program that can be implemented on SDN is load balancing. Load balancing is distributing server load to multiple servers. There are several types of load balancing algorithms one is round-robin. When one of the servers was given a huge burden automatically delay getting bigger so in the round-robin will continue through it, this is due to the round-robin divides the load to the server silkular. On the study of load balancing algorithm used is the shortest delay. Shortest delay algorithm to allocate a connection to the server with the lowest delay. This testing to measure performance include throughput, connection rate and reply time. The data obtained using the algorithm of shortest delay compared to the round robin with the same test parameter. Load balancing system with the shortest delay algorithm on testing throughput gives the average connections per second that is 3800.45 KB/s compared to the round robin algorithm that is 3724.26 KB/s. On algorithms shortest delay value the average on a test connection rate that is 3.78 conn/s compared with the average value of round robin algorithm that is 3.70 conn/s. results for reply time on algorithms shortest delay superior to the average value of 177.46 ms compared to the value of the average round robin 266.22 ms.
Analisis Pengiriman Data Di Daerah Terpencil Menggunakan Dua Node Bergerak Berbasis Delay Tolerant Network (DTN) Dengan Algoritme Flooding Bella Aulia Rahmataufany; Rakhmadhany Primananda; Aswin Suharsono
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 9 (2018): September 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Abstract With the development of information technology today, the exchange of data and information becomes a necessity, not least in remote areas. Remote areas have their own characteristics, such as geographical conditions difficult to reach by the network. Due to these circumstances the exchange of information becomes a difficult thing to do. Delay tolerant network (DTN) is a network that can operate at great distances. Internet connections can be present in backward areas though indirectly. Delay tolerant networks can also transmit data packets on networks that have difficult terrain or not continuously available connections. The delay tolerant network architecture implements the method of saving and forwarding messages by using a new protocol layer called bundle layer. One developer of delay tolerant networks is IBR-DTN. IBR-DTN is an efficient software for embedded systems. There are several previous studies related to data transmission based on tolerable network tolerance. However, in this study researchers used the flooding algorithm to conduct research on the analysis of data transmission in remote areas using two moving nodes based on toler tolerance network with flooding algorithm. In this study used two moving nodes to view the broadcast process of the routing flooding algorithm. The two nodes are used to see the effect on time, which is required when sending data from village to city. There are three tests for predefined scenarios, including data transmission with two moving nodes, data transmission with one node moving disconnected, sending data using multiple files. The test results obtained are simulations built to make data transmission with the state there are two moving nodes or there is only one moving node. Despite having longer required data transfer, if the data is small (not more than 5 files, with a size of 1 to 5 Mb) with one intermediate node, the probability of data reaching the destination is smaller than the two moving nodes.
Analisis Performa Load Balancing Pada Broker MQTT Menggunakan Algoritma Round Robin Kevin Charlie; Rakhmadhany Primananda; Mahendra Data
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 9 (2018): September 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

MQTT is a communication protocol that requires a small resource and bandwidth. MQTT uses a broker in charge of connecting publishers and subscribers. MQTT brokers, especially Mosquitto, do not have mechanisms to overcome failures caused by CPU overload or device damage when only one broker is used. Thus, it takes load balancer and some brokers. In this research, a load balancer performance analysis using round robin algorithm is used to distribute MQTT brokers workload. The study was conducted on a single host using virtualization. There are 4 virtual devices, namely 3 brokers and 1 load balancer. Subscriber subscribes to the topic by accessing the load balancer address. Testing is done by using load balancer as differentiator variable to know impact given load balancer to broker. The result shows that load balancer with round robin algorithm is able to distribute the load evenly with the condition of all connected clients without any interruption with 13.56%, 13.68% and 15.12% CPU load for each broker with request of 400 that receive 10 publish message for each client. Then the system is able to reconnect to other brokers with a speed of 1.007 seconds when traffic is low and 1.005, 2.791, 4.593, and 2.005 seconds when traffic is high. Finally, the broker's message distribution takes about 0.362, 0.687, 0.891, 1.199, and 1.622 seconds for the number of publish messages of 25, 50, 75, 100, and 125.
Analisis Performansi Protokol Routing Epidemic Dan Spray And Wait Pada DTN Berdasarkan Mobilitas Node Jodi Prayoga Wahyudwi; Rakhmadhany Primananda; Achmad Basuki
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 (1307.36 KB)

Abstract

DTN or Delay Tolerant Network is an internet network that does not matter the time delay. In this study, DTN routing analysis using Epidemic and Spray And Wait based on node mobility. In DTN routing use The One simulator application to list route path with actual city condition. In the performance appraisal, three test parameters were used: Probability of Submission, Overhead Ratio, Average Latency. In the first scenario, the highest Delivery Probability on the Open Shortest Path Mobility is 0.9853 messages, the second ranked Map by Movement of 0.9412 messages, and the last Route Movement Map of 0.9265 messages. In the second scenario, High Possibility on Mobility of Movement Based Map by 1 message, second rank of Open Shortest Path and Movement Map Map with the same value is 0.9796 message. On the third map of the highest Delivery Probability on Mobility Route Map Movement for 0.9457 messages, the second ranked Map Based Movement of 0.9225 messages, and last Open Shortest Path of 0.8837 messages. In Overhead Ratio, routing Epidemics in all mobility have. Average Lowest Latency on Open Shortest Path Mobility based on 72.9538 ms.
Co-Authors Abimanyu Sri Setyo Abraham Arya Satyana Achmad Basuki Adhitya Bhawiyuga Aditya Geraldo Aditya Hermawan Aditya Prayudhi Agiya Yoshua Agung Setia Budi Ahdi Hudaya Ahmad Fajri Rahman Ahmad Faris Adhnaufal Ahmad Fikri Marzuqi Ahmad Ghufron Agustian Ajeng Nurrohmah Akbar Pandu Segara Alfrienza Tighfaraka Alifibioneri Ali Ali Ammar Waliyuddin Jannah Andi Yudiko Leonardo Solin Andre Ananda Pratama Andre Rizki Haryuaditya Andrean Dwi Andaru Andreas Widyatmoko Anggit Surya Gumilang Aprilia Kartika Sriastunti ari kusyanti Arief Indra Rivaldy Permana Arief Sukma Indrayana Arif Rahmanto Arya Sena Marga Mukti Asroful Khusna Arifianto Aswin Suharsono Aulia Nabih Rizqullah Bagas Gerry Caesario Bagos Wahyu Suprayugi Baiq Findiarin Billyan Bambang Gunawan Tanjung Bayu Bagus Prabowo Bella Aulia Rahmataufany Brillian Taufan Budiyanto Budiyanto Cakra Bhirawa Chrisyantar Hasiholan Da&#039;imul Royan Dahnial Syauqy Damianus Dewa Pratama Daniel H. Simatupang Dany Primanita Kartikasari Dany Rahmana David Isura Dedy Andrean Ardiansyah Dedy Tinovrasibo Nababan Desy Ulina Purba Dhani Wahyu Wijaya Dimas Malik Ibrahim Edgar Juvianno Santoso Eka Putri Aprilianingsih Eko Aditya Ramadianto Eko Setiawan Enggar Saka Dirgantara Erricson Bernedy Setiawan Fadila Rafi Alifiandi Fahmi Ardiansyah Faizal Ramadhan Fajra Rizky Faris Naufal Al Farros Fariz Andri Bakhtiar Fathia Ningtyasari Aroeboesman Feriz Pradibya Uditama Fikri Miftah Akmaludin Firza Nur Hibatullah Fitriyah, Hurriyatul Frans Muliawan Panjaya Galeh Fatma Eko Ardiansa Galih Bhaktiar Candra Getdra Saragih Sumbayak Gibran Haq Giservin Tifira Zain Hafizhul Karim Helmy Rafi Nawawi Heri Setiawan Heru Nurwarsito Heru Nurwasito Hidayatus Syafa&#039;ah Holden Gunawan Hudan Abdur Rochman I Putu Krisna Yoga Tanaya Igo Vicky Firmandia Ira Oktavianti Irfani Fadlan Irvan Ramadan Irvan Wahyu Bagus Pratama Irvana Alfiyan Nur Irwan Primadana Mulya Izaaz Waskito Widyarto Jefri Muhrimansyah Jenrinaldo Tampubolon Jodi Prayoga Wahyudwi Kasyful Amron Kevin Charlie Kurnia Ade Prasetia Laisa Ryry Pudja Mentari Lastio Irfathan Ananda Lucky Ronny Chandra Negara Lutfi Fanani Lyna Dwi Maryati M Ilham Fadilah Akbar M. Ammar Batistuta Haryawan Mabda Amnesti Hananto Mahendra Data Moch. Wahyu Imam Santosa Mochamad Hannats Hanafi Ichsan Mochammad Hannats Hanafi Ichsan Moh Irfan Haris Mohamad Ilham Firdaus Mohamad Lutfi Muhammad Afian Musthofa Muhammad Alfarizi Muhammad Fachri Hasibuan Muhammad Farradhika Muntaha Muhammad Fattah Na&#039;im Pang Ripto Muhammad Hannats Hanafi Ichsan Muhammad Mahar Jahary Muhammad Naufal Aziz Huryansyah Muhammad Nursodik Wicaksono Muhammad Rasyid Perdana Muhammad Reza Wahyu Chrisdyan Muhammad Risyat Nashrullah Muhammad Sabilillah Mukhamad Roni Nugraha Pangestu Nur Cahyo Utomo Nuril Huda Pramudya Mahardika Kusumawardhana Pramukantoro, Eko Sakti Prastise Titahningsih Primantara Hari Trisnawan Putri Ayu Delina Sari Putri Rizqia Hardein Rendyanto Adi Kurniawan Resya Wakhid Ardiansyah Retno Perwita Sari Reynald Novaldi Reza Andria Siregar Rifki Pinto Hidayat Risailin Dwi Jaka Fauzi Riza Anisul Fu&#039;ad Rizal Maulana Rizqi Agung Dwi Nugraha Sabriansyah Rizqika Akbar Salsabila Salsabila Sastra Ginata Satria Kencana P. Kacaribu Selma Aulia Sekarrizky Shindy Maria Ulfa Siwi Rahmat Januar Suhadak Akbar Sultan Achmad Chidir Fajar Sutikno Sutikno Syahifudin Shahid Syahmi Rifqi Hudha Perwira Syifaul Hud&#039;riyah Tugar Aris Andika Prastiyo Raharjo Upik Jamil Shobrina Vico Andrea Budi Harto Wahyu Pria Purnama Wian Virgi Widasari, Edita Rosana Widhi Yahya Wijaya Kurniawan Wisnu Fajar Dewantara Yefta Kristiyanto Yemima Dara Gloriawati Yugi Trilia Septiana Zaky Farsi