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

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

Found 65 Documents
Search

 1   2   3   4   5 
Analisis Perbandingan Performa Protokol Routing OSPF, IGRP dan EIGRP pada Topologi Mesh dan Tree Enggar Saka Dirgantara; Rakhmadhany Primananda; Widhi Yahya
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 2 No 7 (2018): Juli 2018
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

The Internet is a set of interconnected Autonomous Systems (AS). Autonomous systems connect with other autonomous systems with different routing policies. Each routing protocol has a different character, need to do research using routing protocol OSPF, IGRP and EIGRP on mesh and tree topologi. This research is intended to find out the best routing protocol in each topologi. This research performs data transmission using TCP and UDP protocol. Data packets that like to use TCP protocol are HTTP and UDP protocol is VoIP. Testing is done by way of several routers into mesh and tree topologi, with the number of routers 16, 32 and 64.The simulation shows on the mesh topologi and topologi tree, EIGRP has the fastest convergence time of other routing protocols. OSPF is very well used in tree topologi compared to other routing protocols. EIGRP occurs stuck in active in the topologi tree, so it has poor performance. EIGRP has the best performance in mesh topologi compared to other routing protocols. But if the mesh topologi is connected with several different types of links there will be bottle neck, larger than other routing protocols.
Rancang Bangun Sistem Pervasive Pada Rumah Cerdas Berbasis Protokol Message Queue Telemetry Transport dan Webservice Arnandha Hadi Pranata; Sabriansyah Rizqika Akbar; Widhi Yahya
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 (923.82 KB)

Abstract

Smarthome is a system at the building or house who give a comfortable, safety, secure, and energy savings. The main problem of smarthome occurs about the identification system work in manually. So, it need some smarthome system that pervasively recognizes smarthome devices. Then the owner of smarthome isn't input the information of equipment in manually. This research implementing method of publish subscribe as data communication protocol between smarthome device with smarthome owner and supported by webservice technology to facilitate smarthome owner in monitoring and controlling smarthome furnishings by using owner's smartphone. In publish subscribe method, researcher use MQTT protocol which publisher as message sender that is smarthome furnishings, MQTT broker as server and data communication, and subscriber as recipient of message. From the testing results that have been done 5x to delay is taken on average as follows: publisher - broker = 3.6 ms, broker - subscriber = 195 ms, subscriber - webservice = 1004.7 ms. From these results it can be concluded that the system has successfully identify pervasive devices and that systems work efficiently. The process of sending data occurs very quickly and delay results obtained in a miliseconds.
Analisis Kinerja Protokol Routing pada Arsitektur Delay Tolerant Network Terhadap Beberapa Pola Pergerakan Hafidz Rizal; Widhi Yahya; Dany Primanita Kartikasari
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 (1060.835 KB)

Abstract

Delay Tolerant Network (DTN) is a network does not matter for delay, disruption, and disconnection from the internet. The continuous movement for send a massege will produce movement patterns, like patterns of random, scheduled, and patterned movements. This research to know performance of routing protocol of Prophet, Maxprop, Epidemic, and Spray And Wait with addition of node and speed on random, scheduled and patterned movement. The One is used for simulation and OpenJUMP for the make a map. The results form the addition of node and speed is probability delivery and overhead rasio has increased and average latency is decreased. The protocol routing maxprop has better performance in the pattern of random movement and patterned movement, because on the addition of nodes and speed produce the value on delivery probability is 63% and 55% in random movement, 62% and 59% patterned movement, average latency is 33% and 31% in random movement, 32% and 32% patterned movement, and overhead ratio is 83% and 78% in random movement, 83% and 88% patterned movement. Then the pattern of scheduled movements protocol routing spray and wait has better performance, because on the addition of nodes and speed produce the value on average latency is 37% and 44%, overhead ratio is 4% and 8%, and delivery probability is 41% and 40%.
Implementasi Node Sensor untuk Sistem Pengamatan pH Air Pada Budidaya Ikan Air Tawar Rian Bayu Pambudi; Widhi Yahya; 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 (823.823 KB)

Abstract

The information on water conditions in the aquatic field can be beneficial to maintain a good water quality. It can provide benefits especially in fish cultivation water. There are several parameters that affect water quality in freshwater fish culture where one of the parameters is pH or acidity level in water. One study explains that living freshwater organisms can only live at a pH between 6.8 to 8.0 and pH changes can occur at any time. At this time, a device that can measure the pH value or water acidity is a colorimeter, pH indicator and pH meter. The pH observations on these three devices can only perform one time data retrieval so that when used for continuous observations it is less efficient. Realtime monitoring systems can be built by implementing monitoring functions on the Internet of Things where they use sensors and actuators. In this study the authors use Probe Sensor SEN1069 as part of the system that performs data retrieval and Arduino microcontroller as part of the system that controls the sensor. Sensors and microcontrollers take pH data and then process pH data and send it to a server using Websocket communication mechanism. From the test results, the performance of system computing time is 2.505 seconds for computing 1000 data of acid solution or alkaline solution, 16 seconds to observe the change from pH 7.00 to acid solution and 8 seconds from pH 7.00 to alkaline solution.
Implementasi K-Shortest Path Routing pada Jaringan Software Defined Network Romy Dwi Andika Manullang; Widhi Yahya; Dany Primanita Kartikasari
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 (785.001 KB)

Abstract

Software Defined Network (SDN) is a network modeling separating control plane and data plane. Network routing is part of SDN that give interest for the research. The most commonly used routing algorithm today is the single path routing algorithm. This algorithm uses only one path as the data transmission medium. This will reduced network performance known as network congestion. In this study we implemented Yen K-Shortest Path as routing algorithm. These algorithm will search for as many K lines as the data transmission medium. The Yen K-shortest path algorithm will minimize network congestion. These algorithms has been implemented using Mininet emulator and Ryu controller in two topology. The tests performed to measure the performance of the algorithm include convergence time, throughput, packet loss. The data obtained in the test using the Yen K-Shortest Path algorithm compared to data obtained using Dijkstra algorithm with the same test method. And there is a test to see the success of the algorithm for using more than one path on multipath testing. In the convergence time test, the Yen K-Shortest Path algorithm gets an average of 0.01962 seconds for the first topology, and 0.02409 seconds for the second topology. Based on the results of throughput testing, the Yen K-Shortest Path algorithm outperformed Dijkstra's algorithm with the highest throughput increase reaching 176.01% larger. For packet loss test results, Yen K-Shortest Path is also superior because it has fewer packet loss than Dijkstra algorithm.
Implementasi Penentuan Bobot Link Menggunakan Logika Fuzzy Untuk Pencarian Jalur Terpendek Pada Software Defined Networking Doni Hadiyansyah; Widhi Yahya; Wijaya Kurniawan
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 (1163.105 KB)

Abstract

Software-Defined Networking (SDN) is a dynamic architecture, manageable, cost-efficient, and easy to adapt. One example of a program that can be implemented on SDN is routing. One of the routing algorithm is Dijkstra's algorithm. A routing protocol using Dijkstra's algorithm is an Open Shortest Path First (OSPF). In OSPF, the cost of each link will be configured by network administrator. The administrator can choose to set all costs to 1 (Static Cost Dijkstra). The link with the the smallest hop count will be chosen without considering the presence of network traffic and delay. By using the paradigm of SDN, artificial intelligence can be implemented on a network. For that the authors have implemented a system of determining the weight of links using fuzzy logic for routing with the parameters used are traffic and delay. The results of the simulation of the system is that the system has been able to determine the cost of links for routing based on traffic and delay. Based on the results of testing the throughput, these systems have greater throughput significantly superior compared to the Static Cost Dijkstra algorithm. Then based on testing packet loss, the packet loss of this system has ranged between 0-5%, compared with Static Cost Dijkstra algorithm that has increased packet loss significant when the number of clients more than 39. But on this system have the convergence time worse then the Static Cost Dijkstra algorithm.
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.
Implementasi High Availability pada Gateway Wireless Sensor Network dengan Protokol Komunikasi Message Queuing Telemetry Transport Bagus Prasetyo; Sabriansyah Rizqika Akbar; Widhi Yahya
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 (1253.58 KB)

Abstract

MQTT-SN is a development of the widely used protocol on the Internet of Things Technology, MQTT. In common MQTT-SN protocol is same as well as MQTT, but MQTT-SN is focused on the sector of wireless sensor network. In MQTT-SN the most prominent is the presence of gateway. Gateway is used to collective data from multiple sensor nodes and forwarding data to broker server. Gateway is the most important part of MQTT-SN technology, because gateway is communicator between sensor node and broker server. Therefor availability of gateway is crucial when facing failure-system or down. This research will be focus on increasing the availability of MQTT server brokers and gateway by implementing Haproxy Load Balancer and Keepalived that installed on 3 Raspberry Pi's as gateways. This system also used multiple broker servers which sharing message or topic for improve availability on broker server side. Research results is brokers and gateways successfully improved availability by using clusterization, balancer traffic, multiple broker implementation and redudancy up to 100% when one of the gateway or broker has a failure.
Mencari Jalur K Terpendek Menggunakan Yen Algoritm Untuk Multipath Routing Pada Openflow Software-Defined Network Afredy Carlo Sembiring; Wijaya Kurniawan; Widhi Yahya
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 (776.542 KB)

Abstract

SDN (software defined network) is a separate network model between control plane and data plane using Openflow communication protocol standard to connect the two. Software defined network developed in recent years and has done many implementation one of them is for network routing. There are three routing algorithms in this research are Yen algorithm DFS algorithm and Dijikstra algortime. For three algortime it will be implemented using mininent and ryu controller. This test is performed to see the performance of the algorithm includes throughput, convergence time and packet loss. After testing from convergence time, Yen algorithm get an average of 0.0070 seconds and DFS of 0.00734 seconds. After getting the data on the test using the yens algorithm then it will be compared with the data obtained using DFS algorithm and Djkstra algorithm with the same method. Based on throughput results, Yen Algorithm outperformed the DFS algorithm and Dijkstra's algorithm with an average of 178,422. In packet loss test yens algorithm, dfs and dijkstra, here yens have a smaller loss packet compared with dfs and dijkstra.
Implementasi Load Balancing Pada Server Dengan Menggunakan Algoritme Least Traffic Pada Software Defined Network Nur Fauzi; Widhi Yahya; Adhitya Bhawiyuga
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 (395.384 KB)

Abstract

On the use of the computer network technology continues to evolvefrapidly. One of the solutions to these problems are Software defined network liquid separating the concept of control plane and data plane. Control plane SDN is programmed allows to implement a wide range of applications, including network load balancing. Load balancing server performance Test liquid distribution in mere play every request and divides the incoming requests to be given to a server by providing the same service. There are several algorithms of load balancing that is used in one round-robin algorithm, but the algorithm does not pay attention to the traffic. An important aspect of liquid traffic to choose the path the sound server. In this research. A load balancing algorithm is used in this researchis the Algorithm a little traffic the algorithm allocates liquid special lines to the server with the shortest traffic. This algorithm will be tested and performance analyzed. This test is used in the test is has the functionality, throughput, packet loss, and time korvegensi. On testing the functionality of server-mapping algorithms a bit traffic handling big demand from the clients is better than a round-robin algorithm because the algorithm at least traffic would not choose the path to the server that there is a burden of the past Cross and will choose the path to another server. Throughput testing of the algorithm a little traffic is superior compared to the round robin algorithm on a high category. While the Pack lost the roud robin has an average of 6.96% higher than little traffic with an average of 2.97%. On the results of the test of convergence, convergence time is the time gained Round Robin Algorithm is 10.51 seconds compared to 14.80 seconds time obtained the algorithm a little traffic
Co-Authors Achmad Basuki Adhitya Bhawiyuga Adi Iman Utama Aditya Bhawiyuga Afredy Carlo Sembiring Agung Nugroho Ahmad Naufal Romiz Ahmad Rizal Muttaqin Andhika Dwitama Putra Andika Kurniawan Andreas Frederius Aprilia Kartika Sriastunti Aprillia Arum Pratiwi Ardy Frayogi ari kusyanti Arief Budi Setiawan Arnandha Hadi Pranata Aswin Suharsono Bagas Prawira Adji Wisesa Bagus Prasetyo Bagus Satria Wiguna Bhaskara Vito Tarigan Dany Primanita Kartikasari Dany Rahmana Dea Asmara Gita Delarta Tok Adin Dimas Dwi Radhityo Dimas Setiawan Afis Doni Hadiyansyah Enggar Saka Dirgantara Faizal Ramadhan Fariz Andri Bakhtiar Florensius Tri Putra Simamora Frondy Fernanda Ferdianto Gabreil Arganata Galeh Prehandayana Guntur Wahyu Pamungkas Hafidz Rizal Hafizhul Karim Hasbi Razzak Heru Nurwarsito Hilkya Dwima Palembangan Ibrahim Attamimi Imam Santoso Ismiarta Aknuranda Kasyful Amron Lalu Fani Islahul Ardy Landika Hari Suganda Lucky Ronny Chandra Negara M. Ali Fauzi Mahendra Data Maskur Purwiadi Moch. Wahyu Imam Santosa Mochammad Hannats Hanafi Mochammad Hannats Hanafi Ichsan Moh Wahyudi Putra Mohamad Rexa Mei Bella Mohammad Hafidzar Rakhman Muhammad Aji Wibowo Muhammad Luthfi Muhammad Rifqi Muzaki Muhammad Sholeh Muharrom Abdillah Niki Yuniar Wicaksono Nur Fauzi Panser Brigade Muhammad Poltak G. Hutajulu Pramukantoro, Eko Sakti Primantara Hari Trisnawan Rahadiyan Yuniar Rahmanda Rakhmadhany Primananda Ratih Kartika Dewi Reza Andria Siregar Rian Bayu Pambudi Risailin Dwi Jaka Fauzi Riski Julianto Romy Dwi Andika Manullang Sabriansyah Rizqika Akbar Sandy Ramadhan Wijaya Steven Urbani Tista Pamungkas Ragil Alit Uis Yudha Tri Wirawan Ulfa Khoirul Azizah Wijaya Kurniawan Yasin Rizqi Afandi Zavero Brillianata Abilovani Zefanya Hermanta