Claim Missing Document
Check
Articles

Pengaruh Model Mobilitas Node Pada Protokol Routing AODV dalam MANET Laisa Ryry Pudja Mentari; Rakhmadhany Primananda; Achmad Basuki
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 1 (2019): Januari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Mobile Ad-Hoc Network (MANET) is one type of Ad-hoc Network that consist of independent wireless nodes. Each node can act as a relay and transmit a message to the other nodes that indirectly connected. In MANET, the nodes are moving dynamically so that it allows the use of different types of mobility model. However, the use of mobility models can lead into higher possibility of diconnection and higher routing failure. It could impact on the quality of network performance and became one of the important factor to considered when measuring the quality of network performance. There are some routing protocols that are used on MANET, one of which is Ad-Hoc on Demand Distance Vector (AODV). AODV is used because it is one of the most rapid adaptive routing protocols for dynamic link conditions. This research provided an analysis of the effect of node mobility on AODV in MANET topology using Network Simulator 3.25. Research was conducted using Random Waypoint (RWP) and Random Direction (RD) mobility model by measuring network performance metrics specifically packet delivery ratio (PDR), average end-to-end delay, and routing convergence time. Tests were conducted on both mobility models with scenario of 15, 25, 40, and 50 nodes variation and 750 m2 and 1250 m2 of simulation area. Measurement results show the highest PDR value is in RD with 92.27% in 750 m2 area. Meanwhile, the lowest end-to-end delay value is in RD with 25.93 ms in the ​​750 m2 area and the lowest routing convergence time value is in RD with 0.534 second on 750 m2 simulation area as well.
Rancang Bangun Pengamatan pH Air Menggunakan Protokol MQTT Cahyo Karya Basuki; Dany Primanita Kartikasari; Achmad Basuki
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 1 (2019): Januari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Water pH is the most important aspect in the field of fisheries, especially in fish cultivation in ponds. PH monitoring problems, currently very much talked about one of them is weather changes that make the management sometimes forget or are lazy to check. So that the role of technology is needed that can help overcome the problem, to convey water pH data to managers remotely. IoT or the Internet of Things is a technology concept whose application can be used to help overcome these problems, where the system works is to connect physical objects with internet communication. IoT requires a protocol to run data transmission that functions as data transport from sensors to users on a network. The protocol used is MQTT (Message Queuing Telemetry Transport) where the protocol is expected to work in low bandwidth and unrealiable networks. The mechanism applied to the system used is publish-subscribe. With a sensor node on Arduino microcontroller as a publisher. Then the Raspberry Pi microcomputer is a server that functions as a broker, time control middleware and data storage. Subscriber as the data requester adopts from java language as a simple interface to the user so that it is easy to read. From the implementation that has been made, it is obtained the results of system testing that matches expectations and obtains protocol kinerja protokolnce which refers to the average latency and delay values ​​below 1 ms, which are 0.31 ms and 0.71 ms with a test time of 3x24 hours.
Analisis Kinerja OpenFlow Switch Aruba 2920 Zefanya Hermanta; Widhi Yahya; Achmad Basuki
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 3 No 2 (2019): Februari 2019
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

OpenFlow switches are network switches based on the OpenFlow protocol in forwarding packets on an SDN network. The various switch vendors have provided OpenFlow-enabled networks to support various versions of the OpenFlow protocol. In the implementation of switch there are capacity limitations of TCAM on line-speed forwarding and only accommodate a limited number of streams. Therefore, it will produce different performance. In this study, the authors conducted an analysis of performance OpenFlow switch Aruba 2920. In addition, it uses the emulator mininet as a reference for comparing network performance. The test results show that the system can search several paths in the network topology and along with the path formation time or referred to as convergance time. Tests show that throughput and packet loss on multi-path routing produce better performance, but convergence time is slightly longer than single-path routing. The resulting performance on the Aruba 2920 OpenFlow switch network is very low compared to the emulator mininet, because there are limitations to the group table type select and thrash packet headers on the hardware table so that the flow table is managed in software table.
Optimasi Flow Entries Untuk Mencegah Flow Table Overflow Pada Server Load Balancing Berbasis Software Defined Networking Agung Wahyu Setio Budi; Achmad Basuki
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 (855.301 KB)

Abstract

Software Defined Networking (SDN) is new paradigm in computer network management to replace a complex conventional network into the flexible and efficient network by separating the control plane and data plane.This concept lead the control plane define each of flow to be written into data plane. However, the space in the flow table is limited resource, requires careful management to prevent flow table overflow. This research discusses a flow entries management to prevent flow table overflow in SDN by proposing two mechanism of flow removal, that is flow expiry and flow modification. The flow expiry remove an expired flow based on its time, meanwhile the flow modification will be triggered whenever the flow tablespace is nearly full. The implementation of our proposal carried out on a stateless server load-balancing application on SDN. The evaluation results show that the system is able to prevent flow table overflow. Before implements our proposal, 53% of total packet did not get response from server. After implements our proposal, 100% of total packet can accommodate by flow table and get a service from server. In addition, the reuse of flow entries can reduce the value of network latency.
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.
Penerapan Metode Token-Based sebagai Mekanisme Autentikasi pada IoT Middleware Aditya Chamim Pratama; Eko Sakti Pramukantoro; Achmad Basuki
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 (748.638 KB)

Abstract

The existing IoT middleware has been developed to answer the challenge of syntactical interoperability by creating a gateway so that it can communicate through the CoAP, MQTT and WebSocket protocols. However, the middleware can accept data from anywhere and various nodes that are not entitled to connect to the middleware. So we need an additional mechanism on the IoT middleware to authenticate the node that will communicate. Authentication is a guarantee that all involved in system communication are valid entities. Therefore, in this research, the development of IoT middleware is done by adding the JSON Web Token (JWT) authentication mechanism. JWT is a token that represents a concise message called claims and is protected by a digital signature, in addition, JWT tokens have an expiration time. JWT tokens are used because of their compact size so they can be sent via URL, query or header. Based on the test results, the authentication mechanism that is applied is able to authenticate the token sent by the node. The impact of applying the authentication mechanism to the IoT middleware causes the node to increase the time it takes to establish connections and publish or subscribe. Compared to IoT middleware without authentication, the average time difference generated is below 30 milliseconds.
Pengaruh Serangan Rushing Terhadap Protocol Ad Hoc On Demand Distance Vector (AODV) pada Jaringan Mobile Ad Hoc Networks (MANET) Eldyto Puspa Laksana; Reza Andria Siregar; Achmad Basuki
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 (371.212 KB)

Abstract

Mobile Ad Hoc Networks (MANET) is one type of wireless network that exists today, where mobile nodes are associated with unplanned or called ad hoc. There are various types of routing protocols on MANET and one of them is reactive routing. One example of reactive routing algorithms is Ad hoc On-Demand Distance Vector (AODV). Rush attacks use RREQ on route discovery to become a connecting node between the source and destination data packets on the network. The number of nodes used is 30 nodes, 40 nodes, 50 nodes. The simulation was carried out using Network Simulator (NS-2.35). Rush attacks have an impact on routing the AODV protocol by reducing its performance. It is proven by the value of the packet delivery ratio, packet loss, throughput, and end to end delay, which decreases in quality. The biggest decrease occurred in the implementation of 4 rushing attacks, there was a decrease in quality where packet delivary ratio at 40 nodes decreased by 12.90%, packet loss at 40 nodes increased by 12.90%, throughput at 40 nodes decreased by 18.27 kbps, and end to end delay on 30 nodes increased by 4035.3259 ms. Compared to experiments on 30 nodes and 50 nodes the quality loss is very small and there tends to be no decrease.
Implementasi MQTT Broker dengan Kemampuan Auto Scaling pada Internet of Things Kevin Jonathan Harnanta; Adhitya Bhawiyuga; Achmad Basuki
Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer Vol 4 No 6 (2020): Juni 2020
Publisher : Fakultas Ilmu Komputer (FILKOM), Universitas Brawijaya

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

Abstract

Internet of Things is a topic of discussion that is growing rapidly now. One protocol commonly used in communication between IoT devices is MQTT. In communication, these devices are interconnected with brokers MQTT. But along with the growth of IoT devices that make connection requests to MQTT brokers, MQTT brokers have decreased resources, and become a single point of failure. Therefore we need MQTT brokers who are able to have auto scaling capabilities so they can adapt to the growing demand for connections from IoT devices. In its implementation, MQTT broker is placed in a container and orchestrated with kubernetes so that it has the ability to auto scaling. In testing, a comparison is made between MQTT brokers with auto scaling capability and without auto scaling capability. Testing is done by measuring the maximum number of clients that can be connected, and the number of connections lost at the time the test is running. As a result, MQTT brokers with auto scaling capabilities can receive connection requests from clients 27% better than MQTT brokers without auto scaling capabilities. Whereas in measuring the number of disconnected connections, MQTT broker with auto scaling capability is able to provide 54.42% fewer disconnected connections than MQTT broker without auto scaling capability.
Implementasi Komunikasi Multi-Hop Menggunakan Metode Controlled Flooding Pada Wireless Sensor Network Berbasis LoRa Zeddin Arief; Primantara Hari Trisnawan; Achmad Basuki
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

Wireless sensor network (WSN) is a wireless network that requires there are at least two interconnected nodes to communicate using wireless communication modules. One of the communication modules that has low power consumption and a considerable distance is the Long Range (LoRa). However, the limitations of LoRa that only uses single wireless hop communication creates problems when implementing LoRa networks to reach dark spots or areas that are difficult to reach by the network. Therefore, this research applies multi-hop communication using controlled flooding method. The application of controlled flooding method uses several mechanisms to resolve problems in the flooding method in general. There are mechanism of preventing infinite loop transmission, random delay mechanism, and packet retransmission mechanism. After testing, it was found that the infinite loop transmission prevention mechanism was successful in resolving the same packet forwarding over and over again. In addition, the packet retransmission mechanism for resolving if a packet lost is also successful. Then the performance test results show that the random delay mechanism is able to cut the percentage of packet loss. The test results show when using a random delay mechanism the packet loss results are 18%. Whereas when without using the random delay mechanism the packet loss results are 54%.
Co-Authors Adhitya Bhawiyuga Aditya Chamim Pratama Agung Wahyu Setio Budi Akbar, Sabriansyah Rizkika Akhmad Mukhtarom Al Aziiz Burhanudin Faidzin Labay Amalia Miftakhul Jannah Andi Yudiko Leonardo Solin Angger Abdul Razak Ariefanda Junediansyah Bayu Sutawijaya Budi Darma Setiawan Cahyo Karya Basuki Candra Dewi Candra Dewi Dahnial Syauqy Dany Primanita Kartikasari Deron Liang Eko Laksono Eko Setiawan Eko Setiawan Eldyto Puspa Laksana Endah Octaviana Nasution Fabiansyah Raam Pontoh Fahmi Alfareza Faisal Akhmadi Fandisya Rahman Farid Jauhari Faris Surya Akbar Fariz Andri Bakhtiar Fathan Abdurrahman Shani Amarta Putra Fitra Abdurrachman Bachtiar Fitra Bachtiar Fransiska Sisilia Mukti Friska Anggia Nurlita Sari Hans Romario Sitorus Hariyanto, Rudi Hasanah, Rini Nur Hawwin Purnama Akbar Ibrahim Ibrahim Imron Sazali Ismawati Nurjannah Ismiarta Aknuranda Jehn Ruey Jiang Jodi Prayoga Wahyudwi Jonathan Rovelano Huwae Kasyful Amron Kasyful Amron Kevin Jonathan Harnanta Khabban Sayyidi Razin Surya Khafidzun Fadli La Ode Muh. Fadlun Akbar Laisa Ryry Pudja Mentari Lutfi Fanani Maskur Purwiadi Maystya Tri Handono Moh Wildan Habibi Moh. Wildan Habibi Mohammad Zulfikar Muhamad Miftahur Ridhoilah Muhamad Rizka Maulana Muhammad Aswin Muhammad Aziz Muslim, ST., MT., Ph.D Muhammad Khairullah Harto Muhammad Naufal Dzakie Muhammad Rafi Fauzan Fathin Muhammad Syaifuddin Zuhri Muharrom Abdillah Onny Setyawati Panca Mudjirahardjo Panser Brigade Muhammad Pramukantoro, Eko Sakti Primantara Hari Trisnawan Putri Rizqia Hardein Putu Bagus Arya Raden Arief Setyawan Rakhmadhany Primananda Rasidy Cakra Pratama Refri Rifwan Daharmi Reza Andria Siregar Rifki Karim Ramadhan Rini Nur Hasanah Rini Nur Hasanah Rizky Jelang Romadhondaru Rudi Hariyanto Rudi Hariyanto Sabriansyah Rizqika Akbar Sabriansyah Rizqika Akbar Sabriansyah Rizqika Akbar Shafira Aulia Indrarto Sulandri Sulandri Uis Yudha Tri Wirawan Wayan Firdaus Mahmudy Widhi Yahya Widhi Yahya yuliana diah pristanti Zaky Abdussalam Zeddin Arief Zefanya Hermanta