Please use this identifier to cite or link to this item: https://ptsldigital.ukm.my/jspui/handle/123456789/486945
Title: Geographic routing algorithms for vehicle-to-vehicle communications in an urban vehicular ad hoc networks environment
Authors: Yusor Rafid Bahar Al-Mayouf (P72193)
Supervisor: Mahamod Ismail, Prof. Dr.
Keywords: Vehicular ad hoc networks (Computer networks)
Routing (Computer network management)
Universiti Kebangsaan Malaysia -- Dissertations
Dissertations, Academic -- Malaysia
Issue Date: 14-Jun-2017
Description: In the Vehicular Ad hoc Network (VANET) communications, the presence of intersections, buildings and vehicles practically in an urban environment may obstruct signal propagation, thus direct signal-hop communication between sending and receiving vehicles failed in many cases. Therefore, VANETs employing multi-hop communications via intermediate vehicles to forward packets to destination has been introduced. However, the vehicles mobility and density cause intermittent in inter-vehicle connection. The geographic-based routing strategy has been identified as one of the most promising and suitable strategy for the dynamic nature of VANETs. However, the strategy still inefficient to satisfy the diverse quality of service requirements of VANET applications, thus it difficult to sustain network stability without congestion. Moreover, the selection of metrics to decide end-to-end route for best utilization of the network resources is inadequate. The aim of this work is to propose two geographic routing algorithms for vehicle-to-vehicle communications in an urban VANET environment. Firstly, a node-based routing called the Efficient and Stable Routing Algorithm based on user Mobility and node Density (ESRA-MD) that provides an efficient and stable route by selecting the best next candidate node for data packet forwarding towards destination without considering traffic segment status been proposed. ESRA-MD also includes an innovative method called the Next Node Self-Selection for reducing the Communication Overhead (CO) in congested networks. Secondly, a segment aware-based routing, an improved version of ESRA-MD called the Real-Time Intersection-based Segment Aware Routing (RTISAR) algorithm that collects traffic segment status information been developed. This algorithm integrates a Verity Period mechanism to minimize CO. The proposed algorithms were validated via simulation and their performance has been evaluated under various simulation environments. The impact of the data traffic, and network size on the performance of the proposed algorithms were studied and compared with existing protocols in terms of Packet Delivery Ratio (PDR), Packet Delivery Delay (PDD), and CO. ESRA-MD increase PDR by 36.3% and 25.1%, reduce PDD by 56.4% and 52.7%, and reduce CO by 38% and 32.5% compared with existing Diagonal-Intersection-based Routing and Link State aware Geographic Opportunistic protocols, respectively. Similarly, RTISAR increases PDR by 19.7% and 24.4%, reduce PDD by 40.9% and 63.8%, and reduce CO by 46% and 8.4% when compared with the existing intersection-based Connectivity Aware Routing and the Traffic-Flow-Oriented Routing protocols, respectively. The findings of this research contribute towards the implementation of optimal network routes and a more efficient communication stack, for the purpose of designing a green multi-hop ad hoc wireless networks.,"Certification of Masters/Doctoral Thesis" is not available,Ph.D.
Pages: 131
Call Number: TE228.37M349 2017 3 tesis
Publisher: UKM, Bangi
Appears in Collections:Faculty of Engineering and Built Environment / Fakulti Kejuruteraan dan Alam Bina

Files in This Item:
File Description SizeFormat 
ukmvital_118427+SOURCE1+SOURCE1.0.PDF
  Restricted Access
684.19 kBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.