Modifikasi Pemilihan Forwarding Node Pada Ad-Hoc On Demand Distance Vector (Aodv) Berdasarkan Jumlah Routing Table Di Vanets

Firdausy, Faiq (2018) Modifikasi Pemilihan Forwarding Node Pada Ad-Hoc On Demand Distance Vector (Aodv) Berdasarkan Jumlah Routing Table Di Vanets. Undergraduate thesis, Institut Teknologi Sepuluh Nopember.

[img]
Preview
Text
05111440000165-Undergraduate_Thesis.pdf - Accepted Version

Download (1MB) | Preview

Abstract

Vehicular Ad hoc Networks (VANETs) merupakan salah satu teknologi yang banyak dikembangkan di berbagai Negara. Fokus utama penelitian VANETs adalah routing protocol. Ada banyak routing protocol yang dapat diimplementasikan pada VANETs salah satunya adalah Ad-Hoc On Demand Distance Vector (AODV). AODV merupakan salah satu routing protocol yang termasuk dalam klasifikasi reactive routing protocol. Sebuah routing protocol yang hanya akan membuat rute ketika ada paket yang ingin dikirim. Modifikasi akan dilakukan pada proses pengiriman paket route request (RREQ), yaitu dengan cara menentukan jumlah neighbor node yang bertugas mengirim ulang (rebroadcast) paket RREQ. Hal ini dilakukan dengan cara melihat jumlah routing table dan neighbor node dari tiap node tersebut, lalu jika node tersebut memiliki jumlah routing table dan neighbor node kurang dari jumlah threshold, node tersebut menjadi forwarding node dan node tersebut yang bisa melakukan proses rebroadcast. Jika paket RREQ sampai pada node tujuan, maka node tujuan akan mengirim paket route reply (RREP) ke node asal. Lalu rute untuk pengiriman paket akan terbentuk. 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 performa yang lebih bagus. Dibuktikan dengan skenario real yang menghasilkan peningkatan rata-rata packet delivery ratio sebesar 3.37%, rata-rata penurunan routing overhead sebesar 7.14%, rata rata penurunan end to end delay sebesar 36.64%, dan juga rata-rata penurunan forwarded route request sebesar 58.79%. ================================================================================================= Vehicular Ad Hoc Network (VANET) is one technology that has been developed in various countries. The main focus of research VANET is a routing protocol efficiency. There are many routing protocol on VANETs, one of them is Ad-Hoc On Demand Distance Vector (AODV). AODV is classified to reactive routing protocol. A routing protocol that only make the route when there are pakets to be sent. In this thesis a solution have been made by modifying the delivery of route request (RREQ) process, which is determine the neighboring node that assigned to rebroadcast RREQ packet. By looking at the number of neighbor node and the number of routing table of each node, and then if the number of neighbor nodes and the number of routing table less than threshold, the node becomes a forwarding node and the node will rebroadcast the packet. If the RREQ packet has reached the destination node, the destination node will send back a route reply (RREP) packet to the source node and the route will be formed on cache. The performance of the modified protocol has a better result than the original routing protocol AODV.. It is proven that in real scenario, there is an enhancement of average packet delivery ratio by 3.37%, reduction of average routing overhead by 7.14%, reduction of average end to end delay by 36.64% and reduction of average forwarded route request by 58.79%

Item Type: Thesis (Undergraduate)
Uncontrolled Keywords: AODV,Forwarding Node, Threshold, VANETs
Subjects: T Technology > TK Electrical engineering. Electronics Nuclear engineering > TK5105.585 TCP/IP (Computer network protocol)
Divisions: Faculty of Information and Communication Technology > Informatics > 55201-(S1) Undergraduate Thesis
Depositing User: Faiq Firdausy
Date Deposited: 09 Aug 2021 22:51
Last Modified: 09 Aug 2021 22:51
URI: https://repository.its.ac.id/id/eprint/53104

Actions (login required)

View Item View Item