Implementasi Pemilihan Forwarding Node Yang Dinamis Pada Route Discovery Process Ad-Hoc On Demand Distance Vector (AODV) Berdasarkan Tingkat Kepadatan Neighboring Node dan Jumlah Active Route

Syahputra, Naufan Arifie (2019) Implementasi Pemilihan Forwarding Node Yang Dinamis Pada Route Discovery Process Ad-Hoc On Demand Distance Vector (AODV) Berdasarkan Tingkat Kepadatan Neighboring Node dan Jumlah Active Route. Undergraduate thesis, Institut Teknologi Sepuluh Nopember.

[img] Text
05111440000136-Undergraduate_Theses.pdf - Accepted Version
Restricted to Repository staff only until 1 October 2023.

Download (3MB) | Request a copy
[img] Text
05111440000136-Undergraduate_Theses.pdf
Restricted to Repository staff only until 1 October 2023.

Download (3MB) | Request a copy

Abstract

Vehicular Ad hoc Networks (VANETs) adalah salah satu teknologi yang sering dibahas di seluruh dunia sebagai mekanisme komunikasi. VANETs sendiri ialah teknologi yang mengintegrasikan kemampuan jaringan nirkabel generasi baru pada kendaraan. Pada tugas akhir ini, fokus utama yang diteliti adalah routing protocol VANETs itu sendiri. Ada banyak routing protocol yang dapat diimplementasikan pada VANETs salah satunya adalah Ad-Hoc On Demand Distance Vector (AODV). Routing protocol dalam VANETs dibedakan menjadi dua model, yaitu reactive dan proactive routing. AODV termasuk dalam reactive routing protocol yang akan membangun rute antara node hanya jika mereka diminta oleh node sumber. Protocol AODV memiliki RREQ (Route Request), RERR (Route Error), dan RREP (Route Reply) request dalam algoritmanya. Pada tugas akhir ini, pemilihan pada proses forwarding node dilakukan secara dinamis. Modifikasi akan dilakukan pada proses pengiriman paket route request (RREQ), yaitu dengan mengeliminasi jumlah forwarding node yang melakukan re-broadcast RREQ dengan batas threshold yang telah ditentukan. Hal ini dilakukan dengan cara melihat jumlah active route (jumlah node asal yang dapat terhubung dengan node tujuan pada routing table) dan neighbor node dari tiap node tersebut, lalu jika node tersebut memiliki jumlah active route dan neighbor node kurang dari jumlah threshold, node tersebut menjadi forwarding node dan node tersebut yang bisa melakukan proses rebroadcast. Perhitungan threshold neighbor node dilakukan dengan mengambil rata rata dari jumlah node yang ada. Modifikasi yang dilakukan akan menghasilkan routing overhead dan forwarded route request yang lebih kecil daripada routing protocol AODV yang asli. Pada tugas akhir ini, performa pada routing protocol AODV yang telah dimodifikasi menghasilkan beberapa performa yang lebih bagus pada beberapa fitur. Dibuktikan dengan skenario real yang menghasilkan peningkatan rata-rata packet delivery ratio sebesar 1.98%, rata-rata penurunan routing overhead sebesar 7.99%, rata rata penurunan end-to-end delay sebesar 43.27%, dan juga rata-rata penurunan forwarded route request sebesar 66.58%. ================================================================================================ Vehicular Ad hoc Networks (VANETs) is one of the technologies that is often discussed around the world as a communication mechanism. VANETs themselves are technologies that integrate new generation wireless networking capabilities in vehicles. In this thesis, the main focus of the study is the VANETs routing protocol itself. There are many routing protocols that can be implemented on VANETs, one of which is Ad-Hoc On Demand Distance Vector (AODV). Routing protocols in VANETs are divided into two models, namely reactive and proactive routing. AODV is included in the reactive routing protocol that will build routes between nodes only if they are requested by the source node. The AODV protocol has RREQ (Route Request), RERR (Route Error), and RREP (Route Reply) requests in its algorithm. In this thesis, selection of the forwarding node process is done dynamically. Modifications will be made to the route request (RREQ) packet transmission process, which is by eliminating the number of forwarding nodes that re-broadcast RREQ with predetermined threshold limits. This is done by looking at the number of active routes and neighbor nodes of each node, then if the node has the number of active routes and neighbor nodes less than the threshold number, the node becomes the forwarding node and the node can do the rebroadcast process. The neighbor node threshold calculation is done by taking the average of the number of existing nodes. Modifications made will result in routing overhead and forwarded route requests that are smaller than the original AODV routing protocol. In this final project, the performance of the modified AODV routing protocol produces some better performance on some features. It is proven by a real scenario that produces an increase in the average packet delivery ratio by 1.98%, the average decrease in routing overhead by 7.99%, the average decrease in end-to-end delay by 43.27%, and also the average decrease in forwarded route requests by 66.58%

Item Type: Thesis (Undergraduate)
Additional Information: RSIf 004.62 Sya i-1 2018
Uncontrolled Keywords: AODV, Forwarding Node, Active route , Threshold, VANETs
Subjects: T Technology > T Technology (General)
T Technology > T Technology (General) > T57.62 Simulation
T Technology > TK Electrical engineering. Electronics Nuclear engineering > TK5105.585 TCP/IP (Computer network protocol)
Divisions: Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Informatics Engineering > 55201-(S1) Undergraduate Thesis
Depositing User: Naufan Arifie Syahputra
Date Deposited: 28 Sep 2021 19:42
Last Modified: 28 Sep 2021 19:42
URI: https://repository.its.ac.id/id/eprint/61051

Actions (login required)

View Item View Item