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 
Implementasi Mekanisme End-To-End Security Menggunakan Algoritma AES dan HMAC pada Pengiriman Data Sensor ECG Berbasis LoRa Al Ghitha Aulia Rahman; Eko Sakti Pramukantoro; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 1 (2020): Januari 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

LoRa (Long-Range) is a wireless transmission media that was designed to be used on low-powered devices such as sensors and only needs to transmit small data over long distances. The application of LoRa in IoT-based ECG (Electrocardiogram) monitoring will assist patients. However, one of the main challenges in implementing IoT is its data security. Moreover, health data such as ECG data are considered to be sensitive because they are used in medical diagnosis. Therefore, a solution to this vulnerability is implementing a security mechanism between endpoints (end-to-end security). End-to-end security mechanisms can be implemented using cryptography. In this research, an end-to-end security using AES and HMAC algorithm is implemented. AES and HMAC is chosen because the devices that is used are low-powered and only have limited resources. That mechanism is applied to sensor nodes and gateway because they are the endpoints.In this research, an end-to-end security mechanism has been implemented successfully. But, the application of this end-to-end security mechanism has an impact, that is an increase in end-to-end delay that exceeds the tolerated delay limit in ECG data transmission. So, this mechanism isn't recommended to be applied in ECG data transmission.
Implementasi Socket Programming dalam Penyesuaian Ukuran Paket pada Jaringan IPv6 Kesit Budi Kusumo; Primantara Hari Trisnawan; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 2 (2020): Februari 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

In IPv6 (Internet Protocol Version 6), fragmentation is only allowed on the end host side. As a result, IPv6 packets can experience potential failures in delivery. The potential failure is caused by two things. First, the packet size exceeds the MTU (Maximum Transmission Unit) value. Second, the router is configured by the network administrator to filter ICMPv6 Packet Too Big packets. Existing solutions are PMTUD (Path Maximum Transmission Unit Discovery), PLPMTUD (Packetization Layer Path Maximum Transmission Unit Discovery), and MSS (Maximum Segment Size) Clamping. However, these three solutions cannot be used in UDP (User Datagram Protocol) based communication and not all operating systems activate these features. Therefore, this research presents a solution by implementing socket programming through the case of audio streaming. With socket programming, research results show communication can take place well. This has been tested through several scenarios. In the first scenario, the results of the experiment without ICMPv6 Packet Too Big filtration and uniform MTU values are smooth communication with a small average packet loss below one percent. In the second scenario, the test results accompanied by ICMPv6 Packet Too Big filtration and MTU values are not uniformed are the same as in scenario one. The difference is that there is a pause as a result of the congestion control mechanism by the DCCP (Datagram Congestion Control Protocol) streaming protocol and limitation on socket buffer.
Implementasi Pencarian Jalur berdasarkan Bandwidth dengan menggunakan Algoritme Dijkstra pada Arsitektur Jaringan Software-Defined Networking (SDN) Raihan Radito; Primantara Hari Trisnawan; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 5 (2020): Mei 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Software-Defined Networking (SDN) is a new concept on network computers. By seperating the data plane and the control plane, logics and algorithms for managing networks are placed on a controller. Currently, an algorithm that is being used for finding a shortest path on SDN networks is Diijkstra's algorithm. However, Dijkstra's algorithm has its downside, that is doesn't count bandwidth overhead. As a result, network congestion will occur if the packet size that is being send, is bigger than the available bandwidth. Therefore, the modification of Dijkstra's algorithm is needed. Dijkstra's algorithm is modified with available bandwidth as its cost. When searching a path, the algorithm will find a path which has a bigger avalaible bandwidth. There are three tests on topology A and B, that is finding a path 1 test, finding a path 2 test, and time convergence test. Finding a path 1 test is conducted when there is no traffic and changes of bandwidth on networks. Finding a path 2 test is conducted when there is traffic and changes of bandwidth on networks. Time convergence test is conducted by counting how much time that the algorithm needs to find a path 1 and 2 on each topology. When finding a path 1 and 2 tests, Dijkstra's algorithm succeed for finding a path based on bandwidth. For time convergence test, the algorithm works better on topology A when finding a path 1 and 2. The average time is 8.2 seconds and 13.1 seconds. However on topology B, finding a path 1 and 2 takes an average time about 93 seconds and 114.8 seconds.
Pengembangan Platform Pengolahan Data Sensor Internet of Things Berjenis Streaming dengan Komputasi Terdistribusi Menggunakan Spark Streaming Fidia Rosianti; Adhitya Bhawiyuga; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 7 (2020): Juli 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Stream processing is becoming essential of IoT stack to increase the values and benefits for the organization. Along with the growth in streaming data, centralized architecture will cause large delays for providing service. To solve this problem, additional resources or machines in the cluster are needed to maintain processing performance. This research proposes to develop a distributed IoT data stream processing platform using Spark Streaming. Throughput and latency show high results, 321.4 records/s and 13.3 seconds, if the amount of data processed is less than the available resources.While the system capability scenario of up to 12 seconds of batch interval shows the highest throughput and latency, 2112.4 records/s and 5.93 seconds. Furthermore, the fault tolerance scenario shows that 6 nodes can process faster with 60 seconds. Spark Streaming also shows the ability to use distributed resources efficiently by showing CPU and memory usage across all nodes having no significant differences. The average difference in memory and CPU usage at each node is 3.6% and 2.04%.
Penggunaan Jalur dalam Multipath Routing secara Proporsional Berdasarkan Kebutuhan Bandwidth Pengguna pada Software Defined Networking Muhamad Miftahur Ridhoilah; Achmad Basuki; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 8 (2020): Agustus 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Multipath routing is a routing method that uses more than one path for transferring data in Network. Using multipath routing can cause not proportional traffic distribution. In a network with different bandwidth, evenly distributed traffic can cause a drop in data transfer performance because of the bottleneck in one of the available paths. This paper proposes a system that controls traffic distribution according to the value of demand (traffic from the user) and path unused bandwidth. The system uses Sflow-rt to monitor the value of demand and path unused bandwidth and uses group action feature of Openvswitch to distribute the traffic. The values from Sflow will be used to calculate the weight of all available paths that control traffic distribution. The test result shows traffic distribution that considers the value of demand and prioritizes path with more unused bandwidth. The system response time that change traffic distribution is effected by the value of Sflow polling. If the value of Sflow polling is 1, then system response time is in range of 1 to 3 seconds. If the value of Sflow polling is 3, then system response time is in range of 1 to 5 seconds. If the value of Sflow polling is 10, then system response time is in range of 14 to 16 seconds with a chance of no change in traffic distribution.
Implementasi Sistem Penentuan Lokasi Dalam Gedung (Indoor Localization) Menggunakan Metode Fingerprinting Berjenis Monitor Based Localization (MBL) Dengan Teknologi Bluetooth Low Energy (BLE) Muhammad Hasbi Ash Shiddieqy; Adhitya Bhawiyuga; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 8 (2020): Agustus 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Besides being famous for its accuracy in determining outdoor location, GPS technology also has weaknesses in determining indoor location due to signal attenuation. Therefore, to determine the indoor location, one of the methods that can be used is the fingerprinting method. The fingerprinting method is a method for determining location by classifying the obtained signal patterns into location names based on the signal characteristics at a location. . One technology that can be utilized to produce signals in the fingerprinting method is Bluetooth Low Energy (BLE) technology. BLE technology is used because it has several advantages such as fast advertisement packet duration, small device size, can use long-lasting batteries, etc. In this research, the fingerprinting method and BLE technology use the concept of Monitor Based Localization (MBL). The MBL concept is a concept where the device to be located only emits a passive signal, while other devices will determine the location. Percentage of the system error in determining location reaches 15.24% which means it has accuracy in determining location of 84.76%. The errors in determining location can be caused by the similarity of signal patterns at certain points at 2 different locations.
Implementasi Load Balancing Web Server pada Software Defined Networking menggunakan Metode K-Nearest Neighbor (K-NN) Dimas Agung Rizky Ananta; Primantara Hari Trisnawan; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 10 (2020): Oktober 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Nowadays everyone uses internet that cause higher traffic on internet network. High traffic causes server overload and service not available. This problem can be solved by implementing multiple web servers with a load balancing mechanism. Load balancing is mechanism how traffic will distributed by using certain methods to optimize network. Load balancing in Software Defined Networking (SDN) handles big traffic load and complexity issues so it improves server performance. Performance of server is affected by resource usage from each server. Resource usage includes CPU, Disk and Memory usage. Information of resource usage is obtain from psutill agent. This research applies load balancing using K-Nearest Neighbor (K-NN) algorithm on POX controller to decide which server will handle incoming traffic. Traffic will distribute to server which has smallest value from CPU, Disk and Memory usage. Performance testing uses two scenarios, first is different rate number (req/s) and second is different load in server. Result from this research showed if K-NN algorithm can distribute traffic to server which has smallest status. In throughput test showed if increasing of rate (req/s) also make increasing of throughput. The highest value of throughput get in 500 req/s with value is 207.3 KB/s. Response time test showed if increasing of rate and load in web server also make increasing of response time. It happens because server receive and handle much request from client. Best response time get in this research is 3.9 ms.
Kinerja Antar Protokol EIGRP, IS-IS, Dan OSPF Dengan Metode Route Redistribution Menggunakan GNS3 Bagus Prasetya; Primantara Hari Trisnawan; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 10 (2020): Oktober 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

There are many routing protocols used in the current network topology. EIGRP, IS-IS and OSPF are examples of routing protocols in a network topology. each of these routing protocols has different algorithm to communicate and also has different ways of working algorithms. Therefore, additional methods such as route redistribute are given so that different protocols can communicate in a topology. In this research, an analysis related to the route redistribute method to find which routing protocol has the best performance in the same network topology. This study uses the Graphical Network Simulator 3 or (GNS3) and uses a hierarchical topology. The scenario is to send an ICMP PING packet from source to destination to observe the round-trip time and convergence time. The results showed that each routing protocol can be run by the route redistribute method. The IS-IS protocol has a round-trip time of 531.4 milliseconds and a convergence time of 158.2 seconds that makes time is the lowest time compared to other protocols and proves that the ISIS protocol is able to work well on the route redistribute method.
Optimasi Posisi Relay Node pada Wireless Sensor Network menggunakan Algoritma Genetika Eki Renaldi; Primantara Hari Trisnawan; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 10 (2020): Oktober 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Relay is one of the most important devices to forward sensory data to sink. Therefore, relay's connectivity must be kept well so Wireless Sensor Network works optimally. Common problem in Wireless Sensor Network is relay node placement in a deterministic way is not getting optimal results. Heuristic way is done with hope that optimal position of relay can be achieved. In this research 3 scenarios with static relay and internet gateway locations are carried out. Scenario 1's area is 90x77 and has 45 relays. Scenario 2's area is 60x77 and has 31 relays. Scenario 3's area is 120x77 and has 59 relays. In this research genetic algorithm is carried out to solve relay's position optimization. Genetic algorithm is an algorithm that can be used to find the nearly optimum solution from wide possibility solution area. In this research, researcher used extended intermediate crossover, random mutation, and elitism selection. The results from this research are early convergence happened at 752nd generation for scenario 1, 846th generation for scenario 2, and 424th generation for scenario 3. Population size for scenario 1 is 150 scenario 2's is 100 and scenario 3's is . Ratio for scenario 1 is 0,6 and for scenario 2 and scenario 3 are 0,7. The result from this research is that relays position optimization using genetic algorithm is not as good as using deterministic because fitness from genetic algorithm is not greater as fitness from deterministic and genetic algorithm needs longer time.
Implementasi Continuous Authentication dengan Token pada Wireless Sensor Network (WSN) berbasis LoRaWAN Regita Yustania Esyaganitha; Adhitya Bhawiyuga; Kasyful Amron
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 5 No 1 (2021): Januari 2021
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Wireless sensor network is a part of Internet of Things (IoT) used to sensing an environment, collecting the sensed data, and sending the information to a nearer gateway on the same wireless sensor network environment. Communication between sensor node and gateway needs to be connected to a wireless communication module to finally called a wireless sensor network, one of many technologies that support a wireless connection for wireless sensor network is LoRaWAN. Long-range and low-power feature that provided by LoRa making it the attractive candidate for smart sensing devices that usually used to sense temperature, air pressure, humidity, resonance, and many more according to needs. On a fast-paced moving environment, authentication between device to device is a mandatory issue that needs to be fixed to ease an authentication without enlarge the security gap. This research proposed an idea of lightweight authentication and enhanced security using a dynamic value as example is token that never have the same values for the whole communication session. With the advantage of using token with timeouts, continuous authentication supposed to reduce the possibility of invalid node or intruder node to join the existed communication. The result of this research is, continuous authentication can distinguish the valid node with the invalid one based on their id and the token value that used for authentication. Besides, the system performance with continuous authentication shows 100% success rate on an ideal time and average time needed for sensor node to generate an authentication token is 41,5 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