Enhanced Load Balanced Clustering Technique for VANET Using Location Aware Genetic Algorithm

The vehicular Adhoc Network has unique charac-teristics of frequent topology changes, traffic rule-based node movement, and speculative travel pattern. It leads to stochastic unstable nature in forming clusters. The re-liable routing process and load balancing are essential to improve the network lifetime. Cluster formation is used to split the network topology into small structures. The reduced size network leads to accumulating the topology information quickly. Due to the absence of centralised management, there is a pitfall in network topology man-agement and optimal resource allocation, resulting in ineffective routing. Hence, it is necessary to develop an effective clustering algorithm for VANET. In this paper, the Genetic Algorithm (GA) and Dynamic Programming (DP) are used in designing load-balanced clusters. The proposed Angular Zone Augmented Elitism-Based Im-migrants GA (AZEIGA) used elitism-based immigrants GA to deal with the population and DP to store the out-come of old environments. AZEIGA ensures clustering of load-balanced nodes, which prolongs the network lifetime. Experimental results show that AZEIGA works appreciably well in homogeneous resource class VANET. The simulation proves that AZEIGA gave better perfor-mance in packet delivery, network lifetime, average de-lay, routing, and clustering overhead

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

Simulating MIMT Attackers' Strategies in VANET to Secure ITS in Smart Cities via Multiverse Optimization-based Hybrid Routing Approach

The connection between moving vehicles and stationary Road Side Units is made possible by VANET technology, which is an essential component of Intelligent Transportation Systems. Vanet based intelligent transportation system (ITS) security is major issue in present days. MIMT Attackers' Strategies are taken into account to test the security of VANET based ITS system in present research paper. The major objective of research paper is to evaluate the potential of security model in case of different type of message dropping and delay attack. It is observed that there is probability of message delay, message drop, and message tampering attack in VANET based ITS system. Due to such attacks there is huge impact on content delivery ratio, packet delay and dropping. Thus proposed hybrid routing approach that is considering Multi-verse optimization has been used to simulate the Quantifying MIMT attacks. In present research, Vanet security in case of intelligent transportation system in smart cities has been considered

A Survey on platoon-based vehicular cyber-physical systems

Vehicles on the road with some common interests can cooperatively form a platoon-based driving pattern, in which a vehicle follows another one and maintains a small and nearly constant distance to the preceding vehicle. It has been proved that, compared to driving individually, such a platoon-based driving pattern can significantly improve the road capacity and energy efficiency. Moreover, with the emerging vehicular adhoc network (VANET), the performance of platoon in terms of road capacity, safety and energy efficiency, etc., can be further improved. On the other hand, the physical dynamics of vehicles inside the platoon can also affect the performance of VANET. Such a complex system can be considered as a platoon-based vehicular cyber-physical system (VCPS), which has attracted significant attention recently. In this paper, we present a comprehensive survey on platoon-based VCPS. We first review the related work of platoon-based VCPS. We then introduce two elementary techniques involved in platoon-based VCPS: the vehicular networking architecture and standards, and traffic dynamics, respectively. We further discuss the fundamental issues in platoon-based VCPS, including vehicle platooning/clustering, cooperative adaptive cruise control (CACC), platoon-based vehicular communications, etc., and all of which are characterized by the tight coupled relationship between traffic dynamics and VANET behaviors. Since system verification is critical to VCPS development, we also give an overview of VCPS simulation tools. Finally, we share our view on some open issues that may lead to new research directions

Secure multi-constrained QoS reliable routing algorithm for vehicular ad hoc networks (VANETs)

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University LondonVehicular Ad hoc Networks (VANETs) are a particular form of wireless network made by vehicles communicating among themselves and with roadside base stations. A wide range of services has been developed for VANETs ranging from safety to infotainment applications. A key requirement for such services is that they are offered with Quality of Service (QoS) guarantees in terms of service reliability and availability. Furthermore, due to the openness of VANET’s wireless channels to both internal and external attacks, the application of security mechanisms is mandatory to protect the offered QoS guarantees. QoS routing plays an essential role in identifying routes that meet the QoS requirements of the offered service over VANETs. However, searching for feasible routes subject to multiple QoS constraints is in general an NP-hard problem. Moreover, routing reliability needs to be given special attention as communication links frequently break in VANETs. To date, most existing QoS routing algorithms are designed for stable networks without considering the security of the routing process. Therefore, they are not suitable for applications in VANETs. In this thesis, the above issues are addressed firstly by developing a link reliability model based on the topological and mathematical properties of vehicular movements and velocities. Evolving graph theory is then utilised to model the VANET communication graph and integrate the developed link reliability model into it. Based on the resulting extended evolving graph model, the most reliable route in the network is picked. Secondly, the situational awareness model is applied to the developed reliable routing process because picking the most reliable route does not guarantee reliable transmission. Therefore, a situation-aware reliable multipath routing algorithm for VANETs is proposed. Thirdly, the Ant Colony Optimisation (ACO) technique is employed to propose an Ant-based multi-constrained QoS (AMCQ) routing algorithm for VANETs. AMCQ is designed to give significant advantages to the implementation of security mechanisms that are intended to protect the QoS routing process. Finally, a novel set of security procedures is proposed to defend the routing process against external and internal threats. Simulation results demonstrate that high levels of QoS can be still guaranteed by AMCQ even when the security procedures are applied