Maulana, Rizky Fenaldo (2020) Pengembangan Gredy Perimeter Stateless Routing (GPSR) dengan Konsep Overlay Network pada VANETs. Masters thesis, Institut Teknologi Sepuluh Nopember.
Preview |
Text
05111850010019-Master_Thesis.pdf Download (2MB) | Preview |
Abstract
Salah satu teknologi komunikasi nirkabel terkini adalah Vehicular Ad hoc Networks (VANETs). VANETs merupakan pengembangan dari Mobile Ad hoc Networks (MANETs). Salah satu protokol routing yang dinilai memberikan solusi terhadap permasalahan komunikasi di lingkungan VANETs adalah Greedy Perimeter Stateless Routing Protocol (GPSR). GPSR merupakan protokol routing berbasis posisi tiap node dimana rute pengiriman ditentukan dengan posisi node tujuan. Namun, protokol ini memiliki kelemahan ketika node penerus paket mengalami keadaan local maximum. Keadaan local maximum adalah node penerus paket tidak dapat mengirim paket ke node selanjutnya dikarenakan tidak ada node di sekitar yang memiliki posisi terdekat dengan node tujuan atau semua node terdekat sudah pernah menerima paket tersebut.
Pada penelitian ini, peneliti mengembangkan protokol GPSR tradisional dengan konsep overlay network. Overlay network diterapkan dengan menggunakan route discovery milik protokol routing dynamic source routing (DSR) sebelum paket pertama dikirim. Hasil rute dari proses route discovery akan menjadi acuan pencarian virtual anchor point (VAP). VAP merupakan representasi dari overlay network dan berguna untuk mengganti acuan posisi node tujuan dalam metode greedy forwarding untuk menghindari pemilihan node yang mengalami keadaan local maximum. Selain VAP, peneliti telah menerapkan metode area optimum dalam pemilihan node penerus paket agar tidak memilih node penerus paket di luar batas transmisi node pengirim.
Berdasarkan hasil uji coba, pencarian VAP memerlukan waktu 0.12 detik hingga 0.23 detik serta GPSR yang dimodifikasi pada skenario real berhasil meningkatkan nilai rata-rata PDR sebesar 72% dibandingkan dengan GPSR tradisional. Kenaikan nilai PDR yang signifikan dikarenakan GPSR tradisional tidak mampu menghindari area void pada skenario real. Pada analisa nilai rata-rata end to end delay, GPSR modifikasi mengalami peningkatan sebesar 1118% pada skenario real. Peningkatan nilai rata-rata end to end delay yang signifikan dikarenakan formula penghitungan nilai rata-rata end to end delay hanya menghitung paket yang terkirim, sedangkan jumlah paket yang terkirim pada GPSR tradisional kurang dari GPSR modifikasi. Pada analisa nilai rata-rata routing overhead (RO), GPSR modifikasi mengalami peningkatan sebesar 0.6% pada skenario real. peningkatan nilai rata-rata RO dikarenakan GPSR modifikasi melakukan pencarian VAP sebelum melakukan pengiriman paket. Pencarian VAP dengan metode route discovery menambahkan jumlah paket pada RO
============================================================
One of the latest wireless communication technologies is Vehicular Ad hoc Networks (VANETs). VANETs are a development of Mobile Ad hoc Networks (MANETs). One routing protocol that is considered to provide solutions to communication problems in the VANETs environment is the Greedy Perimeter Stateless Routing Protocol (GPSR). GPSR is a position-based routing protocol for each node where the sending route is determined by the position of the destination node. However, this protocol has a weakness when the packet forwarding node experiences a local maximum state. The local maximum is a condition where the forwarding node cannot send the packet to the next node because there are no nearby nodes that are closest to the destination node or all the closest nodes have ever received the packet.
In this research, researchers developed the traditional GPSR protocol with the concept of overlay networks. The overlay networks concept is applied using route discovery belonging to the dynamic source routing (DSR) routing protocol before the first packet is sent. The results of the route from the route discovery process will become a reference to search for virtual anchor points (VAP). VAP is a representation of overlay networks and is useful for changing the reference position of the destination node in the greedy forwarding method to avoid selecting nodes that experience maximum local conditions. In addition to VAP, researchers have applied the optimum area method in selecting packet forwarding nodes so that they do not select packet forwarding nodes outside the sending node sending boundary.
Based on the results of simulation, the VAP search takes 0.12 seconds to 0.23 seconds and the modified GPSR in the real scenario succeeded in increasing the average PDR value by 72% compared to traditional GPSR. A significant increase in PDR value due to traditional GPSR is not able to avoid the void area in the real scenario. In the analysis of the average value of end to end delay, modified GPSR has increased by 1118% in the real scenario. The significant increase in the average value of end to end delay is because the formula for calculating the average value of end to end delay only counts the packets sent, while the number of packets sent on traditional GPSR is less than the modified GPSR. In the analysis of the average value of routing overhead (RO), modified GPSR has increased by 0.6% in the real scenario. the increase in the average value of RO is because the modified GPSR does a VAP search before sending packages. VAP search with the route discovery method adds the number of packets to RO.
| Item Type: | Thesis (Masters) |
|---|---|
| Additional Information: | RSDP 658.575 2 Han e-1 2020 |
| Uncontrolled Keywords: | GPSR, greedy forwarding, local maximum, overlay network, Virtual anchor point |
| Subjects: | T Technology > TK Electrical engineering. Electronics Nuclear engineering > TK5101 Telecommunication |
| Divisions: | Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Informatics Engineering > 55101-(S2) Master Thesis |
| Depositing User: | Rizky Fenaldo Maulana |
| Date Deposited: | 22 Jun 2023 07:27 |
| Last Modified: | 22 Jun 2023 07:27 |
| URI: | http://repository.its.ac.id/id/eprint/73011 |
Actions (login required)
 |
View Item |