ArticlePublisher preview available

PSO Optimized Geocast Routing in VANET

Authors:
To read the full-text of this research, you can request a copy directly from the authors.

Abstract and Figures

High speed of vehicles in vehicular ad hoc network (VANET) makes the dissemination of information from source to destination a very challenging task. The moving vehicles share a predefined road layout, therefore data packets are needed to forward within a particular geographical region only. The geographical region so identified is known as geocast region. Many authors have investigated geocast routing protocols in VANET to ensure effective and efficient transmission of information to a geocast region. The existing geocast routing protocols have limited success due to highly dynamic characteristics of vehicular network and suffer from number of limitations such as scalability and overhead for routing. To reduce and overcome these problems some bio-inspired soft computing techniques have been developed to route the information from source to destination in an optimize manner. In this paper, we have developed and analyzed three geocast routing protocols using particle swarm optimization (PSO) approach named as LARgeoOPT, DREAMgeoOPT, and ZRPgeoOP.
This content is subject to copyright. Terms and conditions apply.
Vol.:(0123456789)
Wireless Personal Communications (2020) 115:2269–2288
https://doi.org/10.1007/s11277-020-07681-9
1 3
PSO Optimized Geocast Routing inVANET
AkhtarHusain1· SantarPalSingh2· S.C.Sharma3
Published online: 4 August 2020
© Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract
High speed of vehicles in vehicular ad hoc network (VANET) makes the dissemination
of information from source to destination a very challenging task. The moving vehicles
share a predefined road layout, therefore data packets are needed to forward within a par-
ticular geographical region only. The geographical region so identified is known as geo-
cast region. Many authors have investigated geocast routing protocols in VANET to ensure
effective and efficient transmission of information to a geocast region. The existing geocast
routing protocols have limited success due to highly dynamic characteristics of vehicular
network and suffer from number of limitations such as scalability and overhead for routing.
To reduce and overcome these problems some bio-inspired soft computing techniques have
been developed to route the information from source to destination in an optimize manner.
In this paper, we have developed and analyzed three geocast routing protocols using par-
ticle swarm optimization (PSO) approach named as LARgeoOPT, DREAMgeoOPT, and
ZRPgeoOP.
Keywords VANET· Geocast routing· Scalability· Overhead· PSO
1 Introduction
Computer networking is one of the areas where bio-inspired techniques have been widely
used [1, 2]. Particularly these techniques are applied to solve the routing problems for trans-
mission of safety messages timely and reliably in an optimal fashion for vehicular ad hoc
* Santar Pal Singh
spsingh78@gmail.com
Akhtar Husain
akhtarhusain@mjpru.ac.in
S. C. Sharma
scs60fpt@iitr.ac.in
1 Department ofComputer Science & IT, Faculty ofEngineering Technology, MJP Rohilkhand
University, Bareilly243006, India
2 Department ofComputer Science & Engineering, Thapar Institute ofEngineering & Technology,
Patiala147004, India
3 Wireless Network Lab, Electronics andComputer Discipline, DPT, IIT Roorkee, Roorkee247667,
India
Content courtesy of Springer Nature, terms of use apply. Rights reserved.
... VANETs have many potential applications, including improving road safety, reducing traffic congestion, and enabling new mobility services [5][6][7]. VANETs can be used to exchange information about road conditions, such as accidents, road closures, and weather conditions. This information can be used by drivers to make more informed decisions about their driving, which can help reduce accidents and save lives [8,9]. ...
... Husain et al. [7] proposed a "PSO optimized geocast routing in VANET" and introduces three geocast routing protocols, DREAMgeoOPT, LARgeoOPT, and ZRPgeoOPT, developed using particle swarm optimization (PSO) in VANET. The protocols were compared with existing protocols and showed improvements in PDR, throughput, E2E-D, and normalized routing load. ...
... Figure 5 shows the impact of vehicle density on packet delivery ratio (PDR). It shows that as the number of vehicles are increasing, the PDR of proposed GBTR is increasing and higher than LARgeoOPT [7], KMRP [8], and OPBRP [9]. Moreover, in the proposed GBTR, the PDR is consistently increasing but in other schemes, PDR value is fluctuating as the number of vehicles are increasing. ...
Article
Full-text available
Vehicular Ad hoc Networks (VANETs) have gained significant recognition as a prospective technology for augmenting road safety and optimizing traffic efficiency through facilitating instantaneous communication between vehicles and roadside infrastructure. However, routing in VANETs faces significant challenges due to the dynamic network topology and security threats. In this context, trust-based routing offers an effective solution by improving reliability, security, and quality of service (QoS) in vehicle-to-infrastructure communication. However, trust-based routing in IOVs requires reliable trust evaluation mechanisms, privacy preservation, authentication, and access control. Challenges arise from the dynamic nature of IOVs, necessitating scalable and efficient trust computation algorithms. Moreover, ensuring the resilience of trust-based routing against malicious attacks, such as Sybil attacks or collusion among malicious vehicles, is an issue of great importance that necessitates attention and resolution. This research paper proposes a novel Graph-Based Trust-Enabled Routing (GBTR) scheme specifically designed for VANETs. The scheme incorporates direct trust, indirect trust, and contextual trust to evaluate the trustworthiness of participating nodes. Direct trust is determined based on factors such as frequency and consistency of successful communication, communication delay, and a mobility factor that incorporates punishment/reward parameters. Indirect trust is calculated using feedback trust value and link reliability, also considering the mobility factor. The contextual trust incorporates factors like location, time of day, weather conditions, and traffic density for each node pair. Routing decisions are made based on the final trust scores obtained from these trust evaluations. The route request/reply mechanism and route maintenance mechanism ensure the selection of the most reliable and trustworthy routes, thereby improving network performance. Additionally, a trust update algorithm with a concept of less reward and more penalty is employed to periodically update the trust values of participating vehicles. This approach enhances security, reliability, robustness, and efficiency of network resource usage, reducing congestion and enabling real-time trust evaluation while minimizing false positives. The simulation results substantiate that the GBTR scheme, as proposed, surpasses existing routing schemes across various performance metrics, including packet delivery ratio (PDR%), dropped packet ratio (DPR%), end-to-end delay (ms), throughput (Kbps), and normalized routing load (packets/sec). These outcomes underscore the efficacy of the proposed scheme in enhancing network performance and bolstering reliability. Overall, the graph-based trust-enabled routing scheme presented in this research contributes to enhancing the reliability and security of VANETs, thereby supporting the development of intelligent transportation systems.
... Numerous researchers have proposed various approaches to enhance the quality of network transmission services in VANETs. Existing vehicle relay routing protocols can be broadly categorized into five main types [3]: topology-based [4,5], clusters-based [6,7], Geocast-based [8,9], broadcast-based [10,11], and position-based [12][13][14][15] vehicle relay routing strategies. Among these, a position-based vehicle relay routing strategy is considered the most cost-effective solution to address vehicle routing issues, such as relay packet loss, formation of relay route loops, and excessively high routing maintenance costs [16]. ...
... In recent years, with the advancement of machine learning technology, many researchers have applied learning-based approaches to routing strategies [19], among which Reinforcement Learning (RL) is the most commonly used [20][21][22][23]. In RL, the description of the State-Action space makes it suitable for dynamic decision-making processes, overcoming the limitation of traditional non-learning routing methods, which are only applicable in specific vehicular scenarios [8]. However, the most widely used RL method, Q-learning, has a critical issue: its state space is limited by the size of the Q-table, restricting the vehicular routing strategy to smaller vehicular spaces and exhibiting good performance only in smaller area spaces [9][10][11]. ...
Article
Full-text available
In Vehicular Ad Hoc Networks, reliable information transmission relies on an effective routing strategy. Most existing reinforcement learning-based routing methods are ineffective in dynamic network environments and cannot prevent inefficient network routing. Efficient network routing can be controlled by network traffic management, so this paper proposes an intelligent routing strategy based on Deep Reinforcement Learning to enhance routing performance. By integrating intersection forwarding and traffic awareness capabilities, this paper addresses the problem of local optimality and utilizes the Deep Q Network to make intersection forwarding decisions. The state space of this strategy consists of intersection nodes, road information between intersections, and forwarding packet information. When a vehicle node carrying a packet approaches an intersection based on the state space, the intersection node uses a neural network to select the optimal next-hop relay intersection from past learning experiences. It generates appropriate vehicle routing decisions based on information from the current and candidate relay intersections. Finally, we use the real taxi trajectory data of Beijing City to conduct extensive simulation experiments. Simulation results and analysis demonstrate that the proposed strategy outperforms related research regarding higher average packet delivery ratio, shorter average end-to-end delay, and lower average overhead ratio in dense and sparse traffic periods under real road environments. Consequently, this strategy provides efficient and reliable message transmission services for Vehicular Ad Hoc Networks.
... The content of these communications could include entertainment apps, cautions and alerts, adaptive journey assistance, parking or gas station availability, and traffic flow conditions. These numerous VANET applications vigorously depend on VANET steering conventions as displayed in Figure 1 [3,4], which were derived before remote versatile specially appointed network (MANET) calculations yet have gone through critical adjustment to satisfy the needs and characteristics of VANETs [5,6]. Multitiered metaheuristics can solve multiple-objective multiple-solution and nonlinear formulations, which are employed to find high-quality solutions to an ever-growing number of complex real-world problems, such as combinatorial ones. ...
Article
Full-text available
In modern cities, vehicle ad hoc networks (VANETs) hold great promise for improving safety on the roads, traffic control, and communicating. The constantly changing and intricate nature of VANETs hampers adequate routing due to a variety of factors. The work examines the use of a multitiered metaheuristic algorithm that combines Bellman–Ford routing with the Fire Hawk, Gannet Optimization, and Mayfly Optimization algorithms to find optimal routing solutions for VANETs. The suggested work addresses network topological dynamics, actual time limitations, flexibility, connectivity problems, and security issues, in addition to the different quality of service (QoS) requirements in VANETs. Bellman–Ford serves as the foundational routing layer and maintains communication, whereas Fire Hawk, Gannet Optimization, and Mayfly Optimization improve and optimize routing patterns at subsequent levels. The multitier approach aims to strike a balance between the rational and probabilistic aspects of routing so as to satisfy the minimal latency needs of applications that are safety‐critical and respond quickly to the rapid changes in VANETs. The suggested work is evaluated with a traffic density ranging from 500 to 5000 with a step size of 500, and it has been observed that for the highest traffic density of 5000, the proposed work obtains a latency of 3.88 ms, data delivery rate of 0.944, a throughput of 2.94 Mbps, and energy efficiency of 97.14%. The proposed work remains robust compared to integrating state‐of‐the‐art metaheuristic algorithms such as ECRA, HOPRP, and CM. Overall, the proposed routing techniques increase routing efficiency in VANETs and make it possible to create vehicle communication networks that are more trustworthy and safe.
... ACO possesses the advantageous characteristics of self-organization and mistake resilience when employed in the pursuit of nearoptimal solutions. Geocast protocols, which involve the dissemination of messages to a subset of cars within a predetermined geographic region, may benefit from the utilization of PSO for the purpose of identifying surrounding vehicles and localizing them inside a certain area or zone [150]. In PSO method, the motion of individual particles is not only impacted by their local neighbors, but also guided towards the most optimal regions of the search space. ...
... The implementation of these protocols in vehicular networks is deemed to be problematic due to the high mobility of nodes [105]. However, the employment of the particle swarm optimization algorithm may alleviate some hindrances, as demonstrated in [96]. The discussed protocol employs the particle swarm optimization in the selection of a next-hop vehicle, which is a crucial task in geocast routing because of frequent changes in topology, interference, and the high speed of nodes. ...
Article
Full-text available
The Internet of Vehicles (IoV) and the Internet of Flying Vehicles (IoFV) are integral components of intelligent transportation systems with the potential to revolutionize the way we move people and goods. Although both the IoV and IoFV share a common goal of improving transportation efficiency, safety, and sustainability, they possess distinct characteristics and face unique challenges. To date, the existing literature has predominantly focused on specific aspects of either the IoV or IoFV, but a comprehensive review comparing and contrasting the two domains is still lacking. This review paper aims to address this gap by providing an in-depth analysis of the key differences between the IoV and IoFV systems. The review will examine the technological components, network infrastructure, communication protocols, data management, objectives, applications, challenges, and future trends associated with both domains. Additionally, this paper will explore the potential impact of technologies such as artificial intelligence, machine learning, and blockchain. Ultimately, the paper aims to contribute to a deeper understanding of the implications and potential of these technologies, both in the context of transportation systems and beyond.
Article
Full-text available
Vehicular ad-hoc networks (VANETs) stand at the forefront of advancing vehicular and infrastructural communication, ushering in a new era of connectivity on the move. As VANETs become increasingly saturated with varied applications, the demand for multicast routing protocols that ensure reliable and scalable communication to designated groups of vehicles intensifies. Multicast communication emerges as the preferred method in vast vehicular networks, optimizing computational resources and achieving desired quality of service levels. Yet, the dynamic nature of VANETs, characterized by high mobility and swift changes in network topology, presents significant hurdles in group management, path creation, and maintenance for multicast routing. This paper offers an in-depth examination of multicast routing methodologies developed expressly for VANETs, starting with an analysis of VANET-specific attributes and challenges. It proceeds to critique the latest multicast routing protocols, evaluating their advantages and drawbacks, and spotlighting progressive trends and prospective avenues for research. Through a meticulous review of the extant literature, this survey aspires to furnish critical insights into the formulation, execution, and refinement of multicast routing protocols within the VANET landscape.
Article
Full-text available
With the advent of new technologies, such as software-defined networks (SDN) and fog computing, and the development of communication technology and the vehicular industry, there has been a remarkable growth in intelligent transportation systems (ITS) in recent years. As a main component of ITS, vehicular ad hoc networks (VANETs) suffer from a host of problems, including architectural inflexibility, wireless communication instability, limited range of communications, and frequent topological changes due to the rapid mobility of vehicles. One of the challenges in vehicular ad hoc networks is the lack of efficient and reliable communication between vehicles. Also, given the huge amounts of data production and big data, the communication capabilities of vehicles can be utilized to effectively transmit and communicate data, thus reducing excessive bandwidth usage in internet networks and their infrastructure. The current paper’s aim is to present a method for improving the transmission of data packets in inter-vehicle communications. In this regard, software-defined networks and fog-based computing offer substantial benefits. The proposed routing method includes the switching of data packet transmission through the VANET infrastructure and internet transmission. SDN- and Fog computing-based Switchable Routing (SFSR) provides the best path for the inter-vehicle transmission of data packets. When data packet transmission via VANETs is not possible, transmission may be performed via internet. The results of the simulation indicate improved performance of SFSR in terms of the packet delivery ratio, packet loss ratio, end-to-end delay, routing overhead, and routing failure rate.
Article
Full-text available
Efficient routing algorithms are essential to guarantee reliable communication in Vehicular Adhoc Networks (VANETs). In this paper, we present a twofold approach entailing the design of a new route metric for VANET communication, which considers important parameters such as the received signal strength; transmit power, frequency and the path loss. We further present an improved genetic algorithm-based route optimization technique (IGAROT) that guarantees better routing in VANETs. We used IGAROT to determine optimal routes required to communicate road anomalies effectively between vehicles in VANETs. The performance of our proposed algorithm was compared with the well-known conventional Genetic Algorithm (GA) route optimization technique under same simulation conditions. Based on the average route results obtained, our findings indicate that IGAROT provided 4.24%, 75.7% and 420% increment over the conventional GA in the low, medium and high car density scenarios, respectively. Our findings suggest that IGAROT improves road anomaly communication among vehicles thus enabling drivers to better navigate anomalous roads with the aim to reduce road-anomaly induced accidents. Further benefits of our system may include the prompt notification of road maintenance agencies concerning persisting road conditions via vehicle to infrastructure communication
Conference Paper
Full-text available
Optimization Link State Routing Protocol (OLSR) is initially designed for ad hoc networks (MANETs). This protocol collects information to build and maintain the route between the source and the destination with minimum cost by periodically exchange Hello and control messages. The aggregate function of communication cost for all nodes computed based on the required performance metrics. The standard configuration of OLSR is insufficient with vehicular ad hoc networks (VANETs) due to its limited Wi-Fi coverage and high mobility that cause rapid changes in its topology. The limitation of the ordinary OLSR could produce the greatest amount of the generated routing overhead which in turn leads to a high degradation in the overall VANETs performance. In this paper, Particle Swarm Optimization is used to find optimal parameters to tune OLSR by aggregating the response performance metrics generated in a realistic VANETs simulation. The simulation results show that OLSR with optimum parameters achieved better performance in urban environment as compared to the ordinary OLSR.
Article
Full-text available
The performance of routing protocol in Vehicular ad-hoc network (VANET) depends on value of parameters used in. Being very large combination of these values, it is difficult to find an optimal combination for better QoS in VANET. Therefore, we have proposed an algorithm based on Particle Swarm Optimization (PSO) to find an optimal combination in Ad-hoc on demand multipath distance vector routing (AOMDV) in real scenario. The experimental results show 80.65% drop in Average End-to-End delay (AE2ED), 37.07% drop in Network Routing Load (NRL) and slight drop (1.96%) in Packet Delivery Ratio (PDR) using optimal combination of value of parameters.
Article
Full-text available
In the conventional mobile ad hoc network (MANET) systems' route rediscovery methods, there exists route failure in all route discovery methods resulting in data loss and communication overheads. Hence, the routing has to be done in accordance with mobility character of the network. In this manuscript, a particle swarm optimization (PSO)-based lifetime prediction algorithm for route recovery in MANET has been proposed. This technique predicts the lifetime of link and node in the available bandwidth based on the parameters like relative mobility of nodes and energy drain rate, etc. Using predictions, the parameters are fuzzified and fuzzy rules have been formed to decide on the node status. This information is made to exchange among all the nodes. Thus, the status of every node is verified before data transmission. Even for a weak node, the performance of a route recovery mechanism is made in such a way that corresponding routes are diverted to the strong nodes. With the aid of the simulated results, the minimization of data loss and communication overhead using PSO prediction has been discussed in detail.
Article
Full-text available
A multiobjective dynamic vehicle routing problem (M-DVRP) has been identified and a time seed based solution using particle swarm optimization (TS-PSO) for M-DVRP has been proposed. M-DVRP considers five objectives, namely, geographical ranking of the request, customer ranking, service time, expected reachability time, and satisfaction level of the customers. The multiobjective function of M-DVRP has four components, namely, number of vehicles, expected reachability time, and profit and satisfaction level. Three constraints of the objective function are vehicle, capacity, and reachability. In TS-PSO, first of all, the problem is partitioned into smaller size DVRPs. Secondly, the time horizon of each smaller size DVRP is divided into time seeds and the problem is solved in each time seed using particle swarm optimization. The proposed solution has been simulated in ns-2 considering real road network of New Delhi, India, and results are compared with those obtained from genetic algorithm (GA) simulations. The comparison confirms that TS-PSO optimizes the multiobjective function of the identified problem better than what is offered by GA solution.
Article
Vehicular Ad hoc NETworks (VANETs) play a key role in the design and development of Intelligent Transportation Systems (ITS) that aim to improve road safety and transportation productivity. VANETs cover vehicle-to-vehicle and vehicle-to-roadside communications. One of the most important challenges of this type of network is the timely and reliable dissemination of messages among vehicular nodes that enable drivers to take appropriate decisions to improve road safety. In the past decade, many routing protocols for VANETs that can support reliability and safety requirements have been proposed. These protocols suffer from several limitations, including complexity, lack of scalability to large scale networks, routing overheads, etc. To address these limitations, various bio-inspired approaches have been proposed to route packets among vehicular nodes in an optimized manner. We survey recent proposed bio-inspired routing algorithms for the VANET environment. In particular, we identify the key features, strengths, and weaknesses of these algorithms and compare them by using various criteria. Moreover, we propose a unified formal model of the bio-inspired multimodular approaches applied to VANET routing. We highlight main future research directions in this area.