A Hybrid Approach to Increase the Scalability in VANETs

Wireless Communications and Mobile Computing

Vehicular ad hoc networks (VANETs) are eminent class of mobile ad hoc networks due to their applications. However, mobility management and network scalability are still addressable problems in VANETs. In the current paper, a hierarchical approach has been designed for handling significantly large VANETs by providing better mobility management. The formation of multiple overlapped clusters from large VANETs using k-means algorithm is major characteristics of this approach. Additionally, an addressing architecture has been introduced using two data registers. The derived algorithm allows preparing an appropriate route between source and destination vehicles. Correctness and performance of the approach have been discussed.

Vehicular Ad-Hoc Networks (VANETs) have received considerable attention in recent years, due to its unique characteristics, which are different from Mobile Ad-Hoc NETworks (MANETs), such as rapid topology change, frequent link failure, and high vehicle mobility. The main drawback of VANETs network is the network instability, which yields to reduce the network efficiency. In this article we propose three algorithms: Affinity PROpagation for VEhiclar networks-Cluster-Based LifeTime Routing (APROVE-CBLTR) protocol, Intersection Dynamic VANET Routing (IDVR) protocol, and Control Overhead Reduction Algorithm (CORA). APROVE – CBLTR forms clusters using the Affinity Propagation algorithm in a distributed manner. It presents a new mobility based clustering scheme for VANET. This algorithm takes into account the mobility and stability. Cluster performance was measured in terms of average CH duration, average cluster member duration, the average number of clusters, and the average rate of cluster-head change. Each node transmits messages of responsibility and availability to its neighbors and then takes a decision on the clustering independently. The Cluster Heads (CHs) are selected based on maximum LifeTime (LT) among all vehicles that are located within each cluster. The IDVR protocol aims to increase the route stability and average throughput, and to reduce end-to-end delay in a grid topology. The elected Intersection CH (ICH) receives a Set of Candidate Shortest Routes (SCSR) closed to the desired destination from the Software Defined Network (SDN). The IDVR protocol selects the optimal route based on its current location, destination location, and the maximum of the minimum average throughput of SCSR. Finally, the CORA algorithm aims to reduce the control overhead messages in the clusters, by developing a new mechanism to calculate the optimal numbers of the control overhead messages between the CMs and the CH. The proposed scheme is validated by real urban scenarios and Experimental results show that APPROVE-CBLTR outperforms the compared routing protocols with respect to the end-end delay, the packet delivery ratio and the path duration time.

International Journal of Computer Applications, 2010

This paper proposes a new approach for cluster based routing algorithm for hybrid mobility model to regulating the vehicular traffic. Our approach uses a new hybrid mobility model combining randomwaypoint and group mobility model using static and dynamic sources and a novel cluster based routing algorithm. To transmit the real time updated information and maintain long link duration to improve the data delivery ratio, we propose Location based Multipath Flooding (LMF) algorithm, which is suitable for vehicles with variable mobility. The scenario and the network are modeled and investigated through extensive simulations using Ns2 simulator to study the performance in terms of cluster construction.

A Vehicular Ad-hoc Network (VANET) is a collection of wireless vehicle nodes forming a temporary network without using any centralized Road Side Unit (RSU). VANET protocols have to face high challenges due to dynamically changing topologies and symmetric links of networks. A suitable and effective routing mechanism helps to extend the successful deployment of vehicular ad-hoc networks. An attempt has been made to compare the performance of two On-demand reactive routing protocols namely AODV and DSR which works on gateway discovery algorithms and a geographical routing protocol namely GPSR which works on an algorithm constantly geographical based updates network topology information available to all nodes in VANETs for different scenarios. Comparison is made on the basis of different metrics like throughput, packet loss, packet delivery ratio and end-to-end delay using SUMO and NS2 simulator. In this paper we have taken different types of scenarios for simulation and then analyzed the performance results.

International Journal of Innovative Technology and Exploring Engineering (IJITEE

The rising popularity of network based technologies has witnessed growing interests in research of inter-vehicular communications. In this scenario, Vehicular Ad-hoc Network (VANET) has evolved as the largely admired network traffic routing and control system. The main idea of this work is to enhance quality of clustering approach implemented in VANET. To achieve this, authors proposed the addition of two new elements in the existing clustering architecture, namely, the number of cluster heads required in a specific simulation area and the selection of paramount candidate to be used as cluster head. Supervised learning technique is implemented in the employed methodology. The proposed architecture is evaluated in terms of Jitter and Packet Delivery Ratio (PDR). The simulation results demonstrated that the node variation with PDR shows relatively higher average PDR for polynomial kernel as compared to the average PDR for linear kernel.

International Journal of Scientific Research in Computer Science, Engineering and Information Technology, 2021

ITS (Intelligent Transportation Systems) are growing increasingly popular because of the necessity for superior cyber-physical systems and comfort applications and services required for usage in autonomous vehicles. There are two types of Vehicular Ad-Hoc Networks (VANETs) that are vital to ITS: V2I (Vehicle-to-Infrastructure) and V2V (Vehicle-to-Vehicle). VANETs are a new technology with several potential uses in the ITS. It comprises smart vehicles and roadside equipment that connect over open-access wireless networks. An attacker may disrupt vehicular communication which can lead to potentially life-threatening scenarios because of the significant expansion in the number of vehicles in use today. VANETs must use robust security and authentication procedures to provide safe vehicular communication. This paper provides a comprehensive analysis ofthe VANET system including its characteristics and challenges. There is a concept of data dissemination that has been provided in brief. Clustering is the most important topic in VANET that is used to cluster the vehicles to secure and safely message transmission over the network. There is a taxonomy of clustering techniques has provided in a detailed manner. Besides, it has also shown the comparison of different clustering parameters-based mechanisms and MAC protocols in VANET.

International Journal of Innovative Research in Science, Engineering and Technology, 2014

In past few years, VANET (Vehicular Ad-hoc Network) has become a remarkable area for research analysis and development. VANET is a subgroup of MANET (Mobile Ad-hoc Network). VANET and MANET both are wireless networks which are characterized as self-configured and autonomous ad-hoc networks. VANETs differ from MANETs in terms of dynamic topology and high mobility. Due to unstable connectivity, high mobility and network partitioning, information routing in VANETs becomes difficult and challenging, thus creating a need for efficient VANET routing protocols. This paper provides a summary on VANET and gives its routing protocols which focuses on vehicle to vehicle i.e. V2V communication. This paper aims at classifying protocols on the basis of routing information and comparing them using following parameters namely methodology used, benefits/strengths and limitations. The paper compares reactive and proactive routing protocols based on their advantages and disadvantages, also discussing ...

VANET is Vehicular Adhoc Network which is the application of MANET (Mobile Adhoc Network) envisioned for both safety and navigational purposes of vehicles on the road. Different routing protocols are used for communication in VANET. GPSR is one of the efficient protocols used for routing in VANET. But some problems exist with this protocol. GPSR is used to find the greedy path from one node to another node in a communication, but at some particular conditions (like when we choose a wrong node or any node is the last node of the network) it gets fails. So this research paper is basically giving solution to this problem by first determining the vehicles moving direction before forwarding any packet to the intermediate nodes. Second, important factor considered for GPSR is the speed of any vehicle.

Bulletin of Electrical Engineering and Informatics, 2023

Vehicular ad-hoc network (VANET) is a technique that uses cars moved in cities or highways as nodes in wireless networks. Each car in these networks works as a router and allows cars in the range to communicate with each other. As a result of this movement, some cars will become out of range, but these networks can connect to the internet and the cars in these networks can connect to each other. This research proposes a unique clustering strategy to improve the performance of these networks by making their clusters more stable. One of the biggest problems these networks face is traffic data, which consumes network resources. Agent based modeling (ABM) evaluates better networks. The evaluation showed that the proposed strategy surpasses earlier techniques in reachability and throughput, but ad hoc on-demand distance vector (AODV) (on-demand/reactive) outperforms it in total traffic received since our hybrid approach needs more traffic than AODV.

The Vehicular Ad-Hoc Network, or VANET, is a technology that uses moves cars as nodes in a network to create a mobile network. VANET turns every participating car into a wireless router or node, allowing cars approximately 100 to 300 metres of each other to connect and, in turn, create a network with a wide range. As cars fall out of the signal range and drop out of the network, other cars can join in, connecting vehicles to one another so that a mobile Internet is created. Working with GPSR routing protocol main aim is to increase the performance and the efficiency of the GPSR as well as E-GPSR routing protocol. In this paper, we also give out a mathematical model to evaluate the performance of our proposal. Basing on the model, we use ns to simulate the highway condition. Form the result, we find that our proposal is better that GPSR at aspect of time delay. But in the packet delivery ratio, it doesn't bring us a remarkable improvement. The proposed methodology considers the border node and angle of orientation of the neighboring nodes. Based on this the D-GPSR outperforms the GPSR and E-GPSR routing protocol in terms of throughput, average end-to-end delay, packet delivery ratio and network load. D-GPSR is methodology and algorithm is studied in detailed.

IEEE Transactions on Vehicular Technology, 2012

Vehicular ad hoc networks (VANETs) are highly mobile wireless networks that are designed to support vehicular safety, traffic monitoring, and other commercial applications. Within VANETs, vehicle mobility will cause the communication links between vehicles to frequently be broken. Such link failures require a direct response from the routing protocols, leading to a potentially excessive increase in the routing overhead and degradation in network scalability. In this paper, we propose a new hybrid location-based routing protocol that is particularly designed to address this issue. Our new protocol combines features of reactive routing with location-based geographic routing in a manner that efficiently uses all the location information available. The protocol is designed to gracefully exit to reactive routing as the location information degrades. We show through analysis and simulation that our protocol is scalable and has an optimal overhead, even in the presence of high location errors. Our protocol provides an enhanced yet pragmatic location-enabled solution that can be deployed in all VANET-type environments.

International Journal of Innovative Research in Computer and Communication Engineering, 2013

Interest in vehicular ad hoc networks (VANETs) has grown over the last few years, particularly in the context of emerging intelligent transportation systems (ITS). Vehicular ad hoc networks (VANETs) are highly mobile wireless networks that are designed to support vehicular safety, traffic monitoring, and other commercial applications. However, efficient routing in VANETs remains challenging for many reasons, e.g., the varying vehicle density over time, the size of VANETs (hundreds or thousands of vehicles), and wireless channel fading due to high motion and natural obstructions in urban environments (e.g., buildings, trees, and other vehicles). Within VANETs, vehicle mobility will cause the communication links between vehicles to frequently be broken. Routing becomes an important issue in VANET. If the network has very less vehicle then it becomes more challenging to send a packet from source to destination. In such scenarios efficient routing plays an important role. With efficient...

Key issues in VANETs are high mobility, constraint of road setup, common topology variations, unsuccessful network links, and timely communication of data, which make the routing of packets to a exacting destination difficult. To tackle these issues, a new reliable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. Security is a vital concern for many Vehicular Ad-hoc Network applications. This is a very reasonable assumption, since GPS receivers can be fitted easily in vehicles, a number of which already comes with this technology. In this method, each Road Side Unit calculates and stores different parameter values after receiving the inspiration packets from nearby vehicles.

IEEE Access, 2020

Recently, a novel cluster-based medium access control (CB-MAC) protocol has been proposed for vehicular ad hoc networks (VANETs). Though performance of CB-MAC protocol is affected by cluster size, no mechanism is provided to manage cluster size efficiently. In this paper, the performance of CB-MAC protocol is optimized for VANETs by optimizing transmission probability with cluster size. Each vehicle should adopt the optimum transmission probability in the cluster which can be obtained by tuning the number of clusters in VANET. Therefore, optimum number of clusters is defined based on the number of vehicles in VANETs. An analytical study based on Markov chain model is provided. Optimum transmission probability, and optimum number of clusters expressions are derived. The microscopic mobility model is generated in SUMO for practical scenario. Simulation results are presented which verify analytical (theoretical) analysis and show that the performance of CB-MAC protocol is maximized in terms of throughput, packet dropping rate (PDR), and delay. Throughput is remarkably increased, whereas PDR and delay are decreased.

International Journal of Trend in Scientific Research and Development, 2018

Vehicular Ad-hoc networks are established between mobile vehicles equipped with wireless interfaces that could be either of heterogeneous or homogeneous nature. Vehicles and road side fixed equipment's both of them can be either private (belonging to individuals or companies) or public means of transport service providers. In this network every participating vehicle works as single node or wireless router, allowin which are 100 to 300 m from each other to connect and create a network with a large range. Since vehicle/ node in VANET are quick moving element, so the route among the nodes breaks much of the time. In this paper, clustering performed for the transmission of the data from the source to destination. This technique increases the go with the flow rate of data packets inside the network and decreases the end-to-end delay.