Article Per Year (5 Year)
p-Index From 2021 - 2026
1.383
P-Index
This Author published in this journals
All Journal Journal of Environmental Engineering and Sustainable Technology Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer IKRA-ITH Informatika : Jurnal Komputer dan Informatika
Kasyful Amron
Fakultas Ilmu Komputer Universitas Brawijaya
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Education Electrical & Electronics Engineering Energy Engineering Environmental Science Mechanical Engineering

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

Found 55 Documents
Search

 2   3   4   5   6 
Analisis Kinerja Protokol Routing Dynamic MANET On-Demand (DYMO) dan Cluster Based Routing Protocol (CBRP) pada Mobile Ad-Hoc Network (MANET) Muhammad Nurusshobah; Primantara Hari Trisnawan; Kasyful Amron
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 (651.255 KB)

Abstract

Mobile Ad-Hoc Network (MANET) is a network technology that is composed of a collection of similar or different ad-hoc nodes that are connected using a wireless connection. MANET development is very likely to be applied to areas or conditions with minimal network infrastructure, such as disaster areas. Qualitative data analysis was performed on Dynamic MANET On-Demand (DYMO) and Cluster Based Routing Protocol (CBRP) performance by saving data from test results consisting of convergence, average throughput, average delay, average jitter, and package loss. From the results of the test analysis, the DYMO protocol has better results than the CBRP protocol based on the scheme of variations in the number of nodes. The average value of parameter throughput, average end to end delay, average jitter, and packet loss are 102.09 Kbps, 73.54 ms, 11.81 ms, and 1.79% respectively. In the wide variation scenario, DYMO is better seen from the average end to end delay, average jitter, and packet loss parameters with a value of 18.98 ms, 3.07 ms, and 0.35%. While the CBRP protocol is better of the average throughput with a value of 105.74 Kbps. In the data packet size variation scheme, the DYMO protocol is also known to be better seen from the average end to end delay, average jitter, and packet loss parameters with values of 32.86 ms, 8.44 ms, and 0.53%. While the CBRP protocol is better of the average throughput with a value of 104.86 Kbps. A better convergence value is obtained from the CBRP protocol with an average convergence time of 0.755375 seconds, but from the routing routing protocol level, the DYMO protocol is better than CBRP.
Pengembangan Sistem Penyimpanan Data Sensor IoT Berbasis Permissioned Blockchain dengan menggunakan Platform Hyperledger Arya Wardhana Budi Utomo; Adhitya Bhawiyuga; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 5 (2019): Mei 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The use of IoT technology in everyday life will produce a lot of data containing user data privacy. In this era the use of cloud to store IoT data involves the privacy of user data related to data management provided by cloud providers. Therefore, a data storage system that can protect the privacy of user data is needed so that the threat of privacy of user data can be minimized. One technology that can be used to store data and protect data privacy is blockchain. As one solution to solve the privacy issues of user data in data management centered on the cloud, this study create an IoT sensor data storage system that applies permissioned blockchain by using the Hyperledger platform. Hyperledger choosed to get short storage validation time. The results of the implementation of this research are systems that can store, change, and take IoT data sensors on the blockchain. Then, user privacy data is maintained with access controls and channels on the blockchain. Latency test shows the data storage time is increase in accordance with the number of IoT data sensors that will be saved.
Implementasi Permissioned Blockchain Berbasis Hyperledger Sebagai Penjamin Integritas Data Pada Sistem E-Vote Dyah Ayu Prabandari; Adhitya Bhawiyuga; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 6 (2019): Juni 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

E-vote system is a system to collect vote that involves electronic devices in order to improve the rate of voting practice, reduce the cost used, and improve the accuration in vote counting. Several researches utter that procedures which exist in current e-vote system is not enough to ensure data integrity, especially against an insider attack. Thus, this research is conducted to improve stored data integrity in data storage using permissioned blockchain where data processing and data storage are carried out in distributed manner. This research will produce an e-vote system which is integrated with permissioned blockchain using Hyperledger Fabric as the platform and Hyperledger Composer as a tool. To access the permissioned blockchain, user can utilize a node appropriate to his role in system. There are three roles in the system, that is Admin, Voter, and Operator. Application development for user's node will make use of Hyperledger Composer. Then, to know whether the system can actually protect data integrity in peer or not, some test cases will be conducted. The results of those cases show that e-vote system integrated with permissioned blockchain is capable to protect data integrity.
Optimasi Penempatan Relay Node Pada Wireless Sensor Networks Menggunakan Algoritme Particle Swarm Optimization (PSO) Abdul Aziz Hadyansyah Widada; Kasyful Amron; Fariz Andri Bakhtiar
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 7 (2019): Juli 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Precision agriculture is predicted to become the future of the agricultural industry. The application of information technology to enhanced production automation or land security requires that agricultural areas be filled with sensing devices. In fact, many sensors that have been deployed on land cannot send data optimally. The battery lifetime of wireless sensing devices causes network connectivity to be less and affects the final results of land monitoring. Relay node placement in wireless sensor networks field presents a power-limiting solution by dividing the role of data actuators and as hops that forward data towards internet gateway. However, the application of two-tier communication architecture using relay requires a high cost, so that the relay placement needs to be optimized. The research was conducted aimed at optimizing the placement of relays on agricultural land, by proposing optimization strategies that are adapted to conditions in the field. PSO (Particle Swarm Optimization) algorithm is used as a relay placement optimization heuristic method. The results of relay placement optimization show that a collection of relays that are optimized in number and position can produce maximum connectivity value compared to its placement deterministically. The complexity of the method will increase 19-35 percent as the number of relays is considered.
Analisis Perbandingan Penerapan Stateless Dan Stateful Pada Aplikasi Server Load Balancing Berbasis Software-Defined Networking Fahmi Alfareza; Achmad Basuki; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 9 (2019): September 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Software-defined networking or commonly called SDN is a computer network architecture in which data flow and communication control are separate. This separation makes SDN able to configure network applications more efficiently than traditional networks, one example is the server load balancing application. Server load balancing is a technique for balancing load distribution to several servers that provide a service. There are two techniques that can be implemented as server load balancing, that is stateless and stateful. The problem is, if the state on SDN affects performance on SDN-based network applications. Then, which technique has better performance to be implemented as SDN-based server load balancing seen on the client side, SDN controller, and server. On the client side, it is found that the performance of stateless is better than stateful with the throughput value of stateless 222.9% greater at request rates of 250 requests/second than stateful. On the SDN controller side, it was found that the performance of the stateless is better than the stateful with the connection rate value of the stateless 222.9% greater at the request rate of 250 requests/second than the stateful. And on the server side, it was found that the performance of stateful was better than with a more even distribution of requests. In a stateful, server 0 receives 6,667 requests, server 1 receives 6,666 requests, and server 2 receives 6,666 requests. Whereas on stateless, server 0 receives 10,000 requests, server 1 receives 5,000 requests, and server 2 receives 5,000 requests.
Evaluasi Kinerja Strategi In-Network Caching pada Information-Centric Networking menggunakan Simulator Icarus Ismawati Nurjannah; Achmad Basuki; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 9 (2019): September 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Information-centric networking is a concept of network architecture which is a content-centric model, so there is no need to connect directly to the server to get the content sought by the client. The in-network caching strategy in ICN is a caching strategy that stores content as cache spread across the network. In-network caching consists of two combinations of cache placement and cache replacement strategies. The cache placement strategy manages the placement of content on a collection of routers that acts as a content store, while the cache replacement strategy manages content replacement when the cache storage capacity is full. If the content is not removed quickly and precisely it will have an impact on the efficiency of the content that will be received by the client, resulting in a small cache hit ratio and increased latency. The cache placement and cache replacement strategies are interrelated with each other in in-network caching. Content needs to be disseminated to the network through the content store optimally and ensure that the stored content is the latest and has the chance of a cache hit. Performance evaluation of in-network caching strategies is based on cache hit ratio performance metrics, latency and path stretch. In-network caching strategy testing is done with the Icarus simulator which is specifically designed according to the ICN architecture. The results obtained from this study are the combination of ProbCache cache placement strategy with LFU cache replacement has a superior performance according to test parameters compared to other in-network caching strategies. ProbCache and LFU obtained an average CHR value of 54.02%, an average latency of 0.54 ms, and an average path stretch ratio of 4.76.
Perbandingan Kinerja Protokol Routing RIP (Routing Information Protocol) dan OSPF (Open Shortest Path First) Berbasis IPv6 Muhammad Affan Alvyan; Primantara Hari Trisnawan; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 10 (2019): Oktober 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Routing is the process of selecting the best route or route that must be passed so that packets get to the destination quickly. Most of the application of RIP and OSPF protocols on real networks and previous studies still use a lot of IPv4 networks, which we know is that the number of IPv4 address allocations in the world has decreased over the years. This study tries to use IPv6 addresses implemented in the RIP and OSPF routing protocols in the form of simulations in the Riverbed Modeler software to determine the performance of the two routing protocols by adding disconnections and recovery paths for sending data packets or failure recovery. The purpose of this study is to determine the best routing protocol in overcoming failure recovery from two IPv6-based RIP and OSPF routing protocols by comparing the performance of three parameters namely metric cost, convergence actvity, and routing traffic. The test results obtained from this study that the OSPFv3 routing protocol has a performance superior to RIPng in convergence activity and routing traffic. Difference in convergence activity speed of 8,59 seconds in scenario one and 3,39 seconds in scenario two. Difference in the average amount of traffic 153163,33 bps in scenario one and 109214,08 bps in scenario two. The conclusion from this study, that the best routing protocol in overcoming failure recovery is the OSPFv3 routing protocol. The metric cost parameter does not participate in determining the best routing protocol in overcoming failure recovery, because each routing protocol has its own algorithm in the routing process or has its own metric value in determining the best path that distinguishes between routing protocols.
Implementasi Algoritme SIMON untuk Enkripsi dan Dekripsi Berbasis QR Code Ngr. Putu Raka Novandra Asta; Ari Kusyanti; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 11 (2019): November 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Some advantages of e-payment model is the form of use of use of time, energy, and efficient. Positive and significant effects have been inflicted on this payment against the trade of goods and services. On the other hand it has been found in the field that there is data tapping by hackers disguised as customers to hack customer data. To prevent data from being hacked required a method to ensure data is kept secure. Cryptography and QR Code are methods for data to be secure. The research objective is to implement the SIMON algorithm 32 & 64 for a simple QR Code payment in the form of mobile application software. This research results that the implementation of SIMON 32 & 64 algorithm for QR Code payment can function to secure data. The results of other studies show that the validation of the plaintext and ciphertext based on the SIMON test vector shows that the results are the same as the SIMON test vector. Through encryption processing and decryption shows the total key expansion time is 5.3 seconds. The Total encryption time is 4.7 seconds. The Total key expansion decryption time is 5.3 seconds. Total Decryption Process is 2.1 seconds.
Analisis Perbandingan Kinerja Protokol Routing OSPF, RIP, EIGRP, dan IS-IS Pahlevi Muhammad; Primantara Hari Trisnawan; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 11 (2019): November 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

To communicate with each other, routers need routing protocols for sending information. There are several routing protocols used to send information, OSPF, RIP, EIGRP, and IS-IS. Each of these protocols has different algorithms in determining the best path for sending information, this of course makes a difference in the workings and performance of the routing protocol. Therefore it is necessary to analyze the best protocol in a condition in order to obtain the best performance. This study uses the Graphical Network Simulator 3 (GNS-3) application to simulate the actual network using a Mesh topology with 4 routers, 6 routers, and 8 routers. The parameters used as a measurement of the performance of the routing protocol are convergence time and round trip time. The smaller the value of the test parameters obtained from the routing protocol, the better the improved protocol.
Pengembangan Gateway untuk Menghubungkan Jaringan IoT (Internet Of Things) Dan Jaringan Blockchain Muhammad Chalif Nurfaizi; Adhitya Bhawiyuga; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 12 (2019): Desember 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The large amount of data generated from Internet of Things (IoT) devices makes cloud computing widely used as IoT data storage. Cloud computing which has full access control over IoT data, causes a limitation where users are unable to fully manage and monitor the data they have. Users also can not know the integrity of each data. Therefore, we need a system that can store IoT data while also giving users more access control in managing and monitoring their data. On the other hand, blockchain, a technology with a decentralized architecture that has a consensus mechanism, is able to guarantee the integrity of any data stored without centralized authority. With these advantages, it is expected that the blockchain can become an alternative solution in managing and storing IoT data. In this study, the integration between the Internet of Things and the blockchain is to develop a gateway as an intermediary in terms of sending sensor data. The results of this study is gateway is able to receive data from sensor nodes, manage data structures and send them to the blockchain network. In addition, the authentication mechanism was also successfully provided in order to validate the gateway as a form of limiting access to the blockchain network. Finally, the measurement of gateway performance gives a success rate of 100% and an average processing time of 0.52 ms.
Co-Authors Abdul Aziz Hadyansyah Widada Achmad Basuki Adhitya Bhawiyuga Agung Nugroho Ahmad Nasrul Illahi Al Ghitha Aulia Rahman Alfian Rizky Susanto Andrias Yudianto Antarif Ekadhia Cahyadi ari kusyanti Arief Sukma Indrayana Arya Sena Marga Mukti Arya Wardhana Budi Utomo Bagus Prasetya Chrisyantar Hasiholan Desy Ulina Purba Dian Astika Rini Dimas Agung Rizky Ananta Dyah Ayu Prabandari Dyan Krisyanto Edgar Juvianno Santoso Egi Muliandri Eki Renaldi Fahmi Alfareza Fariz Andri Bakhtiar Ferra Adelinna Wibowo Putri Fidia Rosianti Fredianto Fredianto Gilang Ramadhan Haidar Arijuddin Haidar Harfi Hadhiansah Hendra Danu Laksana Ismawati Nurjannah Jefri Muhrimansyah Kesit Budi Kusumo Mahendra Data Mohammad Fachry Mohammad Fahrur Rozi Mohammad Hafidzar Rakhman Muhamad Miftahur Ridhoilah Muhamad Rizka Maulana Muhammad Affan Alvyan Muhammad Chalif Nurfaizi Muhammad Hasbi Ash Shiddieqy Muhammad Muhajir Kurniawan Muhammad Nurusshobah Ngr. Putu Raka Novandra Asta Ocki Bagus Pratama Olivia Very Noorlinda Pahlevi Muhammad Pramukantoro, Eko Sakti Primantara Hari Trisnawan Raihan Radito Rakhmadhany Primananda Rayza Arfian Redila Permata Anindita Regita Yustania Esyaganitha Retno Perwita Sari Reza Andria Siregar Rezky Hadiwiriyanto Sabriansyah Rizqika Akbar Sofi Hanifah Widhi Yahya Yandra Charlos Hasugian Yoga Faodiansyah