Search In this Thesis
   Search In this Thesis  
العنوان
A new routing strategy for VANETS /
المؤلف
El-Gayyar, Khaled Mohamed Samy.
هيئة الاعداد
باحث / خالد محمد سامي عبدالغفار الجيار
مشرف / أحمد إبراهيم صالح
مشرف / لبيب محمد لبيب
مناقش / هشام عرفات علي خليفة
مناقش / سمير الدسوقى السيد الموجى
الموضوع
Computer communication systems. Computer system failures. Computational intelligence. Vehicular ad hoc networks - Computer networks.
تاريخ النشر
2021.
عدد الصفحات
online resource (102 pages) :
اللغة
الإنجليزية
الدرجة
ماجستير
التخصص
هندسة النظم والتحكم
تاريخ الإجازة
1/1/2021
مكان الإجازة
جامعة المنصورة - كلية الهندسة - قسم هندسة الحاسبات والنظم
الفهرس
Only 14 pages are availabe for public view

from 102

from 102

Abstract

The vehicular ad-hoc network (VANET) plays a significant role in future intelligent transportation systems. The main objective of vehicular ad hoc networks (VANETs) is to improve driver safety and traffic efficiency. Many researchers proposed different schemes to improve communication efficiency. It is quite challenging where vehicles’ speed, direction, and density of neighbors on the move are not consistent. Although several routing protocols have been introduced to manage data exchange among vehicles in VANETS, they still suffer from many drawbacks such as lost packets or time penalties. This thesis introduced a new Fog Based Routing Strategy, which constructs a reliable system of adaptive stable, and efficient routing networks. FBRS consists of two main phases; System Setup Phase (SSP) and System Operation Phase (SOP). SSP creates a cluster network, collects its nodes’ data, mining routes between them, and ranking paths using Dijkstra’s algorithm into a simplified table. Although, SOP generates a reliable route between any two nodes that request a communication channel and maintains the route against any crashes simultaneously. Recent VANET routing protocols have been compared against FBRS. Experimental results have proven the outperforming of the proposed algorithm against recent routing protocol in terms of packet delivery ratio and routing overhead.