TDMP-Reliable Target Driven and Mobility Prediction based Routing Protocol in Complex VANET

Vehicle-to-everything (V2X) communication in the vehicular ad hoc network (VANET), an infrastructure-free mechanism, has emerged as a crucial component in the advanced Intelligent Transport System (ITS) for special information transmission and inter-vehicular communications. One of the main research challenges in VANET is the design and implementation of network routing protocols which manage to trigger V2X communication with the reliable end-to-end connectivity and efficient packet transmission. The organically changing nature of road transport vehicles poses a significant threat to VANET with respect to the accuracy and reliability of packet delivery. Therefore, a position-based routing protocol tends to be the predominant method in VANET as they overcome rapid changes in vehicle movements effectively. However, existing routing protocols have some limitations such as (i) inaccurate in high dynamic network topology, (ii) defective link-state estimation (iii) poor movement prediction in heterogeneous road layouts. In this paper, a target-driven and mobility prediction (TDMP) based routing protocol is therefore developed for high-speed mobility and dynamic topology of vehicles, fluctuant traffic flow and diverse road layouts in VANET. The primary idea in TDMP is that the destination target of a driver is included in the mobility prediction to assist the implementation of the routing protocol. Compared to existing geographic routing protocols which mainly greedily forward the packet to the next-hop based on its current position and partial road layout, TDMP is developed to enhance the packet transmission with the consideration of the estimation of inter-vehicles link status, and the prediction of vehicle positions dynamically in fluctuant mobility and global road layout.Comment: 35 pages,16 Figure

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

Performance Evaluation of Routing Protocols for Vehicle Re-Routing in ITS-based Vehicular Networks

This study aims to assess the performance of routing protocols in Intelligent Transportation System (ITS)-based vehicular networks, specifically in accident and highway scenarios. The effective management of traffic flow in these situations is crucial for ensuring the safety and smooth operation of vehicular networks. Therefore, it is imperative to evaluate routing protocols to identify the most suitable one for these scenarios. The evaluation considers various commonly used routing protocols in vehicular networks, including Ad hoc On-Demand Distance Vector (AODV), Ad hoc On-Demand Multipath Distance Vector (AOMDV), and Destination-Sequenced Distance Vector (DSDV). The evaluation is based on several performance metrics, such as packet delivery ratio, end-to-end delay, network throughput, normalized routing load, and routing overhead. These metrics provide insights into the effectiveness and efficiency of the routing protocols in handling re-routing in accident and highway scenarios. The research is divided into two modules, Module I and Module II, to evaluate the effectiveness of routing protocols in these distinct scenarios using the NS2 simulation tool. The simulation results are analyzed and compared to determine the performance of the routing protocols in each module. The findings indicate that AODV consistently achieves the highest throughput, packet delivery ratio, and lowest end-to-end delay, routing overhead, and normalized routing load, followed by AOMDV and then DSDV. The findings of this study contribute to the understanding of the strengths and weaknesses of different routing protocols in accident and highway scenarios. This knowledge can assist in the development of more efficient and reliable routing protocols for vehicular networks

Vehicle re-routing strategies for congestion avoidance

Traffic congestion causes driver frustration and costs billions of dollars annually in lost time and fuel consumption. This dissertation introduces a cost-effective and easily deployable vehicular re-routing system that reduces the effects of traffic congestion. The system collects real-time traffic data from vehicles and road-side sensors, and computes proactive, individually tailored re-routing guidance, which is pushed to vehicles when signs of congestion are observed on their routes. Subsequently, this dissertation proposes and evaluates two classes of re-routing strategies designed to be incorporated into this system, namely, Single Shortest Path strategies and Multiple Shortest Paths Strategies. These strategies are firstly implemented in a centralized system, where a server receives traffic updates from cars, computes alternative routes, and pushes them as guidance to drivers. The extensive experimental results show that the proposed strategies are capable of reducing the travel time comparable to a state-of-the-art Dynamic Traffic Assignment (DTA) algorithm, while avoiding the issues that make DTA impractical, such as lack of scalability and robustness, and high computation time. Furthermore, the variety of proposed strategies allows the system to be tuned to different levels of trade-off between re-routing effectiveness and computational efficiency. Also, the proposed traffic guidance system is robust even if many drivers ignore the guidance, or if the system adoption rate is relatively low. The centralized system suffers from two intrinsic problems: the central server has to perform intensive computation and communication with the vehicles in real-time, which can make such solutions infeasible for large regions with many vehicles; and driver privacy is not protected since the drivers have to share their location as well as the origins and destinations of their trips with the server, which may prevent the adoption of such solutions. To address these problems, a hybrid vehicular re-routing system is presented in this dissertation. The system off-loads a large part of the re-routing computation at the vehicles, and thus, the re-routing process becomes practical in real-time. To make collaborative re-routing decisions, the vehicles exchange messages over vehicular ad hoc networks. The system is hybrid because it still uses a server to determine an accurate global view of the traffic. In addition, the user privacy is balanced with the re-routing effectiveness. The simulation results demonstrate that, compared with a centralized system, the proposed hybrid system increases the user privacy substantially, while the re-routing effectiveness is minimally impacted

Study of Obstacle effect on the GPSR protocol and a Novel Intelligent Greedy Routing protocol for VANETs

In recent years, connected vehicle technologies have been developed by automotive companies, academia, and researchers as part of Intelligent Transportation Systems (ITS). This group of stakeholders continue to work on these technologies to make them as reliable and cost-effective as possible. This attention is because of the increasing connected vehicles safety-related, entertainment, and traffic management applications, which have the potential to decrease the number of road accidents, save fuel and time for millions of daily commuters worldwide. Vehicular Ad-Hoc Network (VANET), which is a subgroup of Mobile Ad-Hoc Network (MANET), is being developed and implemented in vehicles as the critical structure for connected vehicles applications. VANET provides a promising concept to reduce the number of fatalities caused by road accidents, to improve traffic efficiency, and to provide infotainment. To support the increasing number of safety-related applications, VANETs are required to perform reliably. Since VANETs promise numerous safety applications requiring time-bound delivery of data packets, it is also necessary to replicate real-world scenarios in simulations as accurately as possible. Taking into account the effect of realistic obstacles while simulating a variety of case scenarios increases the reliability of the tested routing protocol to appropriately perform in real-world situations. It also exposes routing protocols to possible vulnerabilities caused by obstacles. Nevertheless, it is not uncommon for researchers to omit real-world physical layer communication hurdles in simulation-based tests, including not considering the effect of obstacles on their routing protocol performance evaluation simulations. Consequently, the performance of these protocols is usually overestimated and do not support in real-world environment. Failure to account for obstacle effects overstate the network performance. In this thesis, a framework for measuring obstacle effects on routing protocols is defined. We also propose, a new routing protocol based on the traditional Greedy Perimeter Stateless Routing (GPSR) protocol called Intelligent Greedy Routing (IGR) protocol. The proposed IGR protocol considers a parameter called $Receptivity$ to chose the next hop in a route. We implemented the new protocol using the Simulation of Urban Mobility (SUMO) and the Network Simulator (NS-3). An analysis of Packet Delivery Ratio (PDR), End-to-End Delay (E2ED) and Mean Hop count with the assumption that nodes (vehicles) are moving in various topologies is presented in this thesis. The study presented here gives a general idea of the effects of obstacles on the Greedy Perimeter Stateless Routing (GPSR) protocol considering multiple realistic scenarios such as Urban, Residential and Highway. In addition, we compare the performance of GPSR and the new IGR protocols with the presence of obstacles considering various topologies. The new proposed IGR protocol performs better compared to the traditional GPSR for all the investigated metrics

Effects of Data Resolution and Human Behavior on Large Scale Evacuation Simulations

Traffic Analysis Zones (TAZ) based macroscopic simulation studies are mostly applied in evacuation planning and operation areas. The large size in TAZ and aggregated information of macroscopic simulation underestimate the real evacuation performance. To take advantage of the high resolution demographic data LandScan USA (the zone size is much smaller than TAZ) and agent-based microscopic traffic simulation models, many new problems appeared and novel solutions are needed. A series of studies are conducted using LandScan USA Population Cells (LPC) data for evacuation assignments with different network configurations, travel demand models, and travelers compliance behavior. First, a new Multiple Source Nearest Destination Shortest Path (MSNDSP) problem is defined for generating Origin Destination matrix in evacuation assignments when using LandScan dataset. Second, a new agent-based traffic assignment framework using LandScan and TRANSIMS modules is proposed for evacuation planning and operation study. Impact analysis on traffic analysis area resolutions (TAZ vs LPC), evacuation start times (daytime vs nighttime), and departure time choice models (normal S shape model vs location based model) are studied. Third, based on the proposed framework, multi-scale network configurations (two levels of road networks and two scales of zone sizes) and three routing schemes (shortest network distance, highway biased, and shortest straight-line distance routes) are implemented for the evacuation performance comparison studies. Fourth, to study the impact of human behavior under evacuation operations, travelers compliance behavior with compliance levels from total complied to total non-complied are analyzed.Comment: PhD dissertation. UT Knoxville. 130 pages, 37 figures, 8 tables. University of Tennessee, 2013. http://trace.tennessee.edu/utk_graddiss/259