4 research outputs found

    Multi-metric Geographic Routing for Vehicular Ad hoc Networks

    Get PDF
    Maintaining durable connectivity during data forwarding in Vehicular Ad hoc Networks has witnessed significant attention in the past few decades with the aim of supporting most modern applications of Intelligent Transportation Systems (ITS). Various techniques for next hop vehicle selection have been suggested in the literature. Most of these techniques are based on selection of next hop vehicles from fixed forwarding region with two or three metrics including speed, distance and direction, and avoid many other parameters of urban environments. In this context, this paper proposes a Multi-metric Geographic Routing (M-GEDIR) technique for next hop selection. It selects next hop vehicles from dynamic forwarding regions, and considers major parameters of urban environments including, received signal strength, future position of vehicles, and critical area vehicles at the border of transmission range, apart from speed, distance and direction. The performance of M-GEDIR is evaluated carrying out simulations on realistic vehicular traffic environments. In the comparative performance evaluation, analysis of results highlight the benefit of the proposed geographic routing as compared to the state-of-the-art routing protocols

    A probability-based multimetric routing protocol for vehicular ad hoc networks in urban scenarios

    Get PDF
    Vehicular Ad hoc Networks have received considerable attention in recent years and are considered as one of the most promising ad-hoc network technologies for intelligent transport systems. Vehicular Ad hoc Networks have special requirements and unique characteristics (e.g., special mobility patterns, short life links, rapid topology changes) which make the design of suitable routing protocols, a challenge. Consequently, an efficient routing protocol that fits with VANETs’ requirements and characteristics is a crucial task to obtain a good performance in terms of average percentage of packet losses and average end-to-end packet delay. To attain this goal, we propose a novel probabilistic multimetric routing protocol (ProMRP) that is specially designed for VANETs. ProMRP estimates the probability for each neighbor of the node currently carrying the packet, to successfully deliver a packet to destination. This probability is computed based on four designed metrics: distance to destination, node’s position, available bandwidth and nodes’ density. Furthermore, an improved version of ProMRP called EProMRP is also proposed. EProMRP includes an algorithm that accurately estimates the current position of nodes in the moment of sending the packet instead of using the last updated position obtained from the previous beacon message. Simulations are carried out in a realistic urban scenario using OMNeT++/VEINS/SUMO, including real maps from the OpenStreetMaps platform. Simulation results show a better performance of ProMRP and EProMRP compared to recent similar proposals found in the literature in terms of packet losses and end-to-end packet delay, for different vehicles’ densities.Peer ReviewedPostprint (published version

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

    Get PDF
    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
    corecore