V2V Routing in VANET Based on Fuzzy Logic and Reinforcement Learning

To ensure the transmission quality of real-time communications on the road, the research of routing protocol is crucial to improve effectiveness of data transmission in Vehicular Ad Hoc Networks (VANETs). The existing work Q-Learning based routing algorithm, QLAODV, is studied and its problems, including slow convergence speed and low accuracy, are found. Hence, we propose a new routing algorithm FLHQRP by considering the characteristics of real-time communication in VANETs in the paper. The virtual grid is introduced to divide the vehicle network into clusters. The node’s centrality and mobility, and bandwidth efficiency are processed by the Fuzzy Logic system to select the most suitable cluster head (CH) with the stable communication links in the cluster. A new heuristic function is also proposed in FLHQRP algorithm. It takes cluster as the environment state of heuristic Q-learning, by considering the delay to guide the forwarding process of the CH. This can speed up the learning convergence, and reduce the impact of node density on the convergence speed and accuracy of Q-learning. The problem of QLAODV is solved in the proposed algorithm since the experimental results show that FLHQRP has many advantages on delivery rate, end-to-end delay, and average hops in different network scenarios

Clustering and 5G-enabled smart cities: a survey of clustering schemes in VANETs

This chapter highlights the importance of Vehicular Ad-hoc Networks (VANETs) in the context of the 5Genabled smarter cities and roads, a topic that attracts significant interest. In order for VANETs and its associated applications to become a reality, a very promising avenue is to bring together multiple wireless technologies in the architectural design. 5G is envisioned to have a heterogeneous network architecture. Clustering is employed in designing optimal VANET architectures that successfully use different technologies, therefore clustering has the potential to play an important role in the 5G-VANET enabled solutions. This chapter presents a survey of clustering approaches in the VANET research area. The survey provides a general classification of the clustering algorithms, presents some of the most advanced and latest algorithms in VANETs, and it is among the fewest works in the literature that reviews the performance assessment of clustering algorithms

DESIGN OF EFFICIENT IN-NETWORK DATA PROCESSING AND DISSEMINATION FOR VANETS

By providing vehicle-to-vehicle and vehicle-to-infrastructure wireless communications, vehicular ad hoc networks (VANETs), also known as the “networks on wheels”, can greatly enhance traffic safety, traffic efficiency and driving experience for intelligent transportation system (ITS). However, the unique features of VANETs, such as high mobility and uneven distribution of vehicular nodes, impose critical challenges of high efficiency and reliability for the implementation of VANETs. This dissertation is motivated by the great application potentials of VANETs in the design of efficient in-network data processing and dissemination. Considering the significance of message aggregation, data dissemination and data collection, this dissertation research targets at enhancing the traffic safety and traffic efficiency, as well as developing novel commercial applications, based on VANETs, following four aspects: 1) accurate and efficient message aggregation to detect on-road safety relevant events, 2) reliable data dissemination to reliably notify remote vehicles, 3) efficient and reliable spatial data collection from vehicular sensors, and 4) novel promising applications to exploit the commercial potentials of VANETs. Specifically, to enable cooperative detection of safety relevant events on the roads, the structure-less message aggregation (SLMA) scheme is proposed to improve communication efficiency and message accuracy. The scheme of relative position based message dissemination (RPB-MD) is proposed to reliably and efficiently disseminate messages to all intended vehicles in the zone-of-relevance in varying traffic density. Due to numerous vehicular sensor data available based on VANETs, the scheme of compressive sampling based data collection (CS-DC) is proposed to efficiently collect the spatial relevance data in a large scale, especially in the dense traffic. In addition, with novel and efficient solutions proposed for the application specific issues of data dissemination and data collection, several appealing value-added applications for VANETs are developed to exploit the commercial potentials of VANETs, namely general purpose automatic survey (GPAS), VANET-based ambient ad dissemination (VAAD) and VANET based vehicle performance monitoring and analysis (VehicleView). Thus, by improving the efficiency and reliability in in-network data processing and dissemination, including message aggregation, data dissemination and data collection, together with the development of novel promising applications, this dissertation will help push VANETs further to the stage of massive deployment

Optimised protocols for time-critical applications and internetworking in wehicular ad-hoc networks

Vehicular ad-hoc networks (VANETs) that enable communication among vehicles and between vehicles and unmanned aerial vehicles (UAVs) and cellular base stations have recently attracted significant interest from the research community, due to the wide range of practical applications they can facilitate (e.g., road safety, traffic management and rescue missions). Despite this increased research activity, the high vehicle mobility in a VANET raises concerns regarding the robustness and adaptiveness of such networks to support time-critical applications and internetworking. In this thesis, as a first step toward the design of efficient MAC protocol to support time-critical applications and internetworking, we show that it is indeed possible to follow the dynamics of a network and consequently adapt the transmission probability of the Aloha protocol to reduce the interference and maximise the single-hop throughput between adjacent nodes. Extensive simulation validates the proposed analytical model, which thus can serve as a promising tool to improve VANETs performance. By exploiting the parallel between the CSMA/CA and Aloha performance models, the optimal transmission probability for the Aloha protocol as a function of estimated vehicular density is derived. This probability is then used to obtain the optimal maximum CW that can be integrated in an amended CSMA/CA protocol to maximise the single-hop throughput among adjacent vehicles. We show by means of simulation that the beneficial impact the proposed protocol is increased channel throughput and reduced transmission delay when compared with the standardised protocol CSMA/CA in IEEE 802.11p. These results reveal the applicability of the new, optimised protocol to safety applications and clustering techniques with stringent performance requirements. Lastly, we propose a Stable Clustering Algorithm for vehicular ad-hoc networks (SCalE) internetworking. The exchange of the necessary status information to support the efficient clusters formation can firmly relay on the support of our optimised CSMA/CA protocol. The SCalE algorithm makes use of the knowledge of the vehicles behaviour (explained in Chapter 5) for efficient selection of CHs, and selects a backup CH on top of the CH to maintain the stability of cluster structures. The increased stability and improved performance of the SCalE algorithm is studied and compared with existing clustering algorithms.Open Acces

Performance analysis of communication model on position based routing protocol: Review analysis

Research on the Vanet system has its own challenges and obstacles with the communication system between nodes being the main issue. Four categories in the Vanet system topology, namely position based routing protocols, broadcast based routing protocols, cluster based routing protocols and multicast/geocast routing protocols, have fundamental differences, especially in the concept of sending data and information between nodes. For this reason, in this study, the selection of standardization and integration of data delivery between nodes is of particular relevance. The ability to send data properly in busy and fast traffic conditions is another challenge. For this, there are many variables that must be considered to improve communication between nodes

Enhanced stability of cluster-based location service mechanism for urban vehicular ad hoc networks

Vehicular Ad Hoc Networks (VANETs) are gaining tremendous research interest in developing an Intelligent Transportation System (ITS) for smart cities. The position of vehicles plays a significant role in ITS applications and services such as public emergency, vehicles tracking, resource discovery, traffic monitoring and position-based routing. The location service is used to keep up-to-date records of current positions of vehicles. A review of previous literatures, found various locationbased service mechanisms have been proposed to manage the position of vehicles. The cluster-based location service mechanisms have achieved growing attention due to their advantages such as scalability, reliability and reduced communication overhead. However, the performance of the cluster-based location service mechanism depends on the stability of the cluster, and the stability of the cluster depends on the stability of the Cluster Head (CH), Cluster Member (CM) and cluster maintenance. In the existing cluster-based location service schemes, the issue of CH instability arises due to the non-optimal cluster formation range and unreliable communication link with Road Side Unit (RSU). The non-optimal cluster formation range causes CH instability due to lack of uniqueness of Centroid Vehicle (CV), uncertainty of participating vehicles in the CH election process and unreliability of the Cluster Head Election Value (CHEV). Also, the unreliable link with RSU does not guarantee that CH is stable with respect to its CMs and RSU simultaneously. The issue of CM instability in the existing cluster-based location service schemes occurs due to using instantaneous speed of the CH and fixed CM affiliation threshold values. The instantaneous speed causes the CM to switch the clusters frequently and fixed CM affiliation threshold values increase isolated vehicles. The frequent switching of isolated vehicles augment the CM instability. Moreover, the inefficient cluster maintenance due to non-optimal cluster merging and cluster splitting also contributes to cluster instability. The merging conditions such as fixed merging threshold time and uncertain movement of overlapping CHs within merging threshold time cause the cluster instability. Furthermore, the unnecessary clustering during cluster splitting around the intersection due to CH election parameters also increases cluster instability. Therefore, to address the aforementioned cluster instability issues, Enhanced Stability of Cluster-based Location Service (ESCLS) mechanism was proposed for urban VANETs. The proposed ESCLS mechanism consists of three complementary schemes which are Reliable Cluster Head Election (RCHE), Dynamic Cumulative Cluster Member Affiliation (DCCMA) and Optimized Cluster Maintenance (OCM). Firstly, the aim of the RCHE scheme was to enhance the stability of the CH through optimizing the cluster formation range and by considering communication link reliability with the RSU. Secondly, the DCCMA scheme focussed on improving the stability of the CMs by considering the Cumulative Moving Average Speed (CMAS) of the CH and dynamic CM affiliation threshold values, and finally, the OCM scheme enhanced the cluster stability by improving cluster merging conditions and reducing unnecessary clustering in cluster splitting. The results of the simulation verified the improved performance of the ESCLS in terms of increasing the location query success rate by 34%, and decreasing the query response delay and localization error by 24% and 35% respectively as compared to the existing cluster-based location service schemes such as HCBLS, CBLS and MoGLS. In conclusion, it is proven that ESCLS is a suitable location service mechanism for a wide range of position-based applications of VANETs that require timely and accurate vehicle locations

Social Clustering of Vehicles Based on Semi-Markov Processes

The full text version attached to this record is the authors final peer reviewed version. The publisher's final version of record can be found by following the DOI link.Vehicle clustering is a crucial network managementtask for vehicular networks in order to address the broadcaststorm problem, and also to cope with rapidly changing networktopology. Developing algorithms that createstable clustersis avery challenging procedure because of the highly dynamic movingpatterns of vehicles and the dense topology. Previous approachesto vehicle clustering have been based on either topology-agnosticfeatures, such as vehicle IDs, on hard to set parameters, orhave exploited very limited knowledge of vehicle trajectories.This article develops a pair of algorithms, namelySociologicalPattern Clustering (SPC), andRoute Stability Clustering (RSC),the latter being a specialization of the former that exploit, forthe first time in the relevant literature, the “social behavior”of vehicles, i.e. their tendency to share the same/similar routes.Both methods exploit the historic trajectories of vehiclesgatheredby road-side units located in each subnetwork of a city, anduse the recently introduced clustering primitive ofvirtual forces.The mobility, i.e. mobile patterns of each vehicle are modeledas semi-Markov processes. In order to assess the performanceof the proposed clustering algorithms, we performed a detailedexperimentation by simulation to compare its behavior withthat of high-performance state-of-the-art algorithms, namely, theLow-Id,DDVCandMPBCprotocols. The comparison involvedthe investigation of the impact of a range of parameters onthe performance of the protocols, including vehicle speed andtransmission range as well as the existence and strength of socialpatterns, for both urban and highway-like environments. Allthe received results attested to the superiority of the proposedalgorithms for creating stable and meaningful clusters

SDNと車両クラスタリングを活用したV2I通信方式

電気通信大学202