Azmi, Haekal (2021) Modifikasi Proses Route Discovery Ad-Hoc On Demand Distance Vector Berdasarkan Faktor QOS Untuk Menangani Realtime Traffic Dan Non-Realtime Traffic. Undergraduate thesis, Institut Teknologi Sepuluh Nopember.
Text
05111540000110-Master_Thesis.pdf - Accepted Version Restricted to Repository staff only until 1 April 2024. Download (1MB) | Request a copy |
Abstract
Ad-hoc routing protocol memiliki tiga klasifikasi dalam penentuan rutenya yaitu reactive protocol, proactive protocol, dan hybrid protocol. AODV (Ad-hoc On demand Distance Vector) termasuk ke dalam reactive protocol, sebuah protokol yang hanya akan membuat rute ketika node sumber membutuhkannya. AODV memiliki dua fase, yaitu route discovery dan route maintenance. Route discovery digunakan untuk meminta dan meneruskan informasi rute hingga sampai ke destinasi yang terdiri dari proses pengiriman Route Request (RREQ) dan Route Reply (RREP). Sedangkan route maintenance digunakan untuk mengetahui informasi adanya kesalahan pada rute, jika terjadi kesalahan maka akan terjadi proses pengiriman Route Error (RERR).
Salah satu penerapan AODV yaitu pada lingkungan VANET (Vehicular Ad-hoc Network). VANET merupakan bentuk pengembangan dari MANET (Mobile Ad-hoc Network) dimana node memiliki karakteristik dengan mobilitas yang tinggi, namun memiliki keterbatasan dalam pola pergerakannya.
Pada suatu jaringan, suatu node memiliki berbagai keragaman karaktersitik dengan node lainnya. Misal, node A memiliki karakteristik yang berada di jalur pertukaran data yang padat, sedangkan node B berada di jalur pertukaran data yang tidak padat. Sedangkan pada kinerja AODV, perlakuan kedua node tersebut akan disamakan sehingga node yang lebih padat akan memiliki delay yang lebih tinggi dikarenakan harus mengontrol paket yang banyak dan energi pun akan habis lebih cepat. Oleh karena itu, dibutuhkan suatu modifikasi untuk mengatasi keberagaman dari suatu jaringan.
Pada Tugas Akhir ini, mengusulkan suatu algoritma untuk menentukan apakah suatu node termasuk ke dalam realtime traffic atau non-realtime traffic yang bernama Multiclass AODV (MCAODV) agar dapat menggunakan node yang tersedia di dalam jaringan secara efisien. Di dalam algoritma ini, node dibagi menjadi dua klasifikasi ketika menerima suatu paket RREQ dari node tetangganya, yaitu realtime traffic atau non-realtime traffic. Setiap klasifikasi memiliki perumusan cost yang berbeda. Jika cost yang diterima dari node tetangganya lebih kecil dari cost yang ada di routing table, maka cost akan diperbarui. Sedangkan jika cost yang diterima dari node tetangganya lebih besar dari cost yang ada di routing table, maka paket akan dibuang.
Dari hasil uji coba, AODV yang dimodifikasi pada skenario grid rata-rata Packet Delivery Ratio (PDR) turun sebanyak 1,54%, Delay naik hingga 125,63% dan penurunan nilai rata-rata Routing Overhead (RO) hingga 70,01%. Sedangkan pada skenario real nilai rata-rata Packet Delivery Ratio (PDR) turun hingga 14,43%, menurunkan Delivery Delay hingga 13,74% dan penurunan nilai rata-rata Routing Overhead (RO) hingga 65,61%.
=====================================================================================================
Ad-hoc routing protocol has three classifications in determining its route, which are reactive protocol, proactive protocol, and hybrid protocol. AODV (Ad-hoc On demand Distance Vector) is included in reactive protocol, a protocol that will only create a route when the source node needs it. AODV has two phases, namely route discovery and route maintenance. Route discovery is used to request and forward route information until it reaches a destination consisting of the process of sending Route Request (RREQ) and Route Reply (RREP). While maintenance routes are used to find out information about the route error, if an error occurs then the Route Error (RERR) sending process will occur.
One of the applications of AODV is in the VANET (Vehicular Ad-hoc Network) environment. VANET is a form of development from MANET (Mobile Ad-hoc Network) where nodes have characteristics with high mobility, but have limitations in their movement patterns.
On a network, a node has a variety of characteristics with other nodes. For example, node A has characteristics that are in a solid data exchange path, while node B is in a data exchange path that is not solid. Whereas at AODV performance, the treatment of these two nodes will be equalized so that the denser nodes will have a higher delay because they have to control a large package and the energy will run out faster. Therefore, a modification is needed to overcome the diversity of a network.
In this Final Project, propose an algorithm to determine whether a node is included in realtime traffic or non-realtime traffic called Multiclass AODV (MCAODV) in order to use the available nodes in the network efficiently. In this algorithm, nodes are divided into two classifications when receiving a RREQ packet from neighboring nodes, namely realtime traffic or non-realtime traffic. Each classification has different cost formulations. If the cost received from a neighboring node is smaller than the cost in the routing table, the cost will be updated. Whereas if the cost received from the neighbor node is greater than the cost in the routing table, the packet will be discarded.
From the trial results, AODV which replaced the average scenario of Packet Delivery Ratio (PDR) increased by 1.54%, Delay increased to 125.63% and reduced the average value of Routing Overhead (RO) to 70.01%. Whereas in the scenario the real value of the Package Delivery Ratio (PDR) drops to 14.43%, decreases the Delivery Delay by 13.74% and decreases the average value of Routing Overhead (RO) to 65.61%.
Item Type: | Thesis (Undergraduate) |
---|---|
Uncontrolled Keywords: | AODV, VANET, Realtime Traffic, Non-realtime Traffic, MCAODV, RREQ |
Subjects: | T Technology > TK Electrical engineering. Electronics Nuclear engineering > TK5105.543 Routers (Computer networks) |
Divisions: | Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Informatics Engineering > 55201-(S1) Undergraduate Thesis |
Depositing User: | Haekal Azmi |
Date Deposited: | 23 Mar 2022 08:27 |
Last Modified: | 23 Mar 2022 08:27 |
URI: | http://repository.its.ac.id/id/eprint/94863 |
Actions (login required)
View Item |