1,144 research outputs found

    Computational Intelligence Inspired Data Delivery for Vehicle-to-Roadside Communications

    Get PDF
    We propose a vehicle-to-roadside communication protocol based on distributed clustering where a coalitional game approach is used to stimulate the vehicles to join a cluster, and a fuzzy logic algorithm is employed to generate stable clusters by considering multiple metrics of vehicle velocity, moving pattern, and signal qualities between vehicles. A reinforcement learning algorithm with game theory based reward allocation is employed to guide each vehicle to select the route that can maximize the whole network performance. The protocol is integrated with a multi-hop data delivery virtualization scheme that works on the top of the transport layer and provides high performance for multi-hop end-to-end data transmissions. We conduct realistic computer simulations to show the performance advantage of the protocol over other approaches

    Vehicular multitier gateway selection algorithm for heterogeneous VANET architectures

    Get PDF

    Detecting Traffic Conditions Model Based On Clustering Nodes Situations In VANET

    Get PDF
    In the last decade, cooperative vehicular network has been one of the most studied areas for developing the intelligent transportation systems (ITS). It is considered as an important approach to share the periodic traffic situations over vehicular ad hoc networks (VANETs) to improve efficiency and safety over the road. However, there are a number of issues in exchanging traffic data over high mobility of VANET, such as broadcast storms, hidden nodes and network instability. This paper proposes a new model to detect the traffic conditions using clustering traffic situations that are gathered from the nodes (vehicles) in VANET. The model designs new principles of multi-level clustering to detect the traffic condition for road users. Our model (a) divides the situations of vehicles into clusters, (b) designs a set of metrics to get the correlations among vehicles and (c) detects the traffic condition in certain areas. These metrics are simulated using the network simulator environment (NS-3) to study the effectiveness of the model

    Secure and robust multi-constrained QoS aware routing algorithm for VANETs

    Get PDF
    Secure QoS routing algorithms are a fundamental part of wireless networks that aim to provide services with QoS and security guarantees. In Vehicular Ad hoc Networks (VANETs), vehicles perform routing functions, and at the same time act as end-systems thus routing control messages are transmitted unprotected over wireless channels. The QoS of the entire network could be degraded by an attack on the routing process, and manipulation of the routing control messages. In this paper, we propose a novel secure and reliable multi-constrained QoS aware routing algorithm for VANETs. We employ the Ant Colony Optimisation (ACO) technique to compute feasible routes in VANETs subject to multiple QoS constraints determined by the data traffic type. Moreover, we extend the VANET-oriented Evolving Graph (VoEG) model to perform plausibility checks on the exchanged routing control messages among vehicles. Simulation results show that the QoS can be guaranteed while applying security mechanisms to ensure a reliable and robust routing service

    Clustering Algorithm in Vehicular Ad-hoc Networks: A Brief Summary

    Get PDF
    An Intelligent Transportation System (ITS) application requires vehicles to be connected to each other and to roadside units to share information, thus reducing fatalities and improving traffic congestion. Vehicular Ad hoc Networks (VANETs) is one of the main forms of network designed for ITS in which information is broadcasted amongst vehicular nodes. However, the broadcast reliability in VANETs face a number of challenges - dynamic routing being one of the major issues. Clustering, a technique used to group nodes based on certain criteria, has been suggested as a solution to this problem. This paper gives a summary of the core criteria of some of the clustering algorithms issues along with a performance comparison and a development evolution roadmap, in an attempt to understand and differentiate different aspects of the current research and suggest future research insights
    • 

    corecore