ACO–IBR: a modified intersection‐based routing approach for the VANET

Trade-off between accuracy, cost, and QoS using a beacon-on-demand strategy and Kalman filtering over a VANET

An adaptive and multi-path greedy perimeter stateless routing protocol in flying ad hoc networks

Background/Objectives: Routing protocols play an important role in the performances of Vehicular Ad Hoc networks (VANET). Routing protocols procedures are controlled with a set of parameters from being dragged to undesired situations such as flooding the network with unnecessary overhead. These parameters have a direct impact on the efficiency of a routing protocol and the overall network performances. The impacts of these parameters on the network performances are less considered in the literature. Methods: This paper proposed the Taguchi delta analysis to measure the impact of Greedy Perimeter Stateless Routing (GPSR) protocols parameters on the performances of VANET. Then, the obtained results are investigated with iterative method to validate the Taguchi observations. Further, an offline optimization of the GPSR parameters is evaluated by performing Taguchi SNR method for fine-tuning the GPSR routing parameters. Application/ Improvements: GPSR with Taguchi tuned is compared with GPSR configuration in a realistic VANET scenario. The obtained results showed that, GPSR with Taguchi configuration outperformed the GPSR in terms of delay and PDR on the simulated scenarios. Keywords: GPSR, Optimization, Routing Parameters, Taguchi Method, VANET

VANET is a new technology used for vehicular communication which aims to provide safe and secure traffic system. There are various challenges/ difficulties in VANET such as dynamic network topology, highly mobile nodes, infrastructure less network etc. which deteriorates the performance of it. Routing is a main task in any communication. Thus, numerous routing protocols have been developed which helps to improve the performance of VANET. Among these all, the position based routing protocols are reliable for many applications. Also, nowadays optimization techniques are widely used to increase the efficiency of routing protocols. In this paper implementation of a position based routing protocols like Greedy Perimeter Stateless Routing (GPSR) and Connectivity Aware Routing (CAR) is discussed. Swarm intelligence based technique which is used for optimization is ACO i.e. Ant Colony optimization. The simulation of CAR and GPSR protocols has been done with and without optimization. The performances of CAR and GPSR are evaluated and compared in terms of average packet delivery ratio, end to end delay, throughput, routing overhead, packet loss etc.. All the simulation has been done in Network Simulator 2. Results shows that ACO technique improves the performance of GPSR and CAR protocols in VANET. Also, CAR protocol shows promising results as compared to GPSR protocol.

Ad-hoc networks generally comprise of mobile wireless nodes having limited communication and computation resources. These nodes execute special routing protocols, which help to establish multi-hop communication despite a dynamic topology. The greedy perimeter stateless routing (GPSR) protocol is one such routing protocol that is frequently used to establish routes in an ad-hoc or sensor network. However, for its precise execution, it is imperative that all nodes depict sustained benevolent behaviour. However, such an altruistic setting would never work in a wireless environment, which is intrinsically physically insecure. Consequently, participating malicious nodes may launch an array of attacks against the routing protocol leading to route severing, elongation or loop creation. In this paper, we present an improved variant of the GPSR protocol that uses the inherent characteristics of the routing process to assess the trust in the network nodes. These trust levels are then used to influence the routing decisions so as to circumvent malevolent nodes in the network. Extensive simulations indicate that the packet delivery ratio of the trusted GPSR protocol surpasses that of the standard GPSR by as much as 30% when as many as 50% of the nodes are acting maliciously in the network.

HyBR: A Hybrid Bio-inspired Bee swarm Routing protocol for safety applications in Vehicular Ad hoc NETworks (VANETs)

Wireless ad-hoc networks have many different characteristics from previous centralized networks. While the infrastructure based networks usually employ the simple routing protocol because every node can reach the coordinator in a single hop, some specific situations, i.e., unplanned dynamic links and multi hop environment, were required in ad-hoc networks. In mobile ad-hoc network, all nodes engaging in communication under the ad-hoc networks should be operated as a router. For this, two routing approaches are previously designed for ad-hoc networks; proactive and reactive routing, and they differently have pros and cons from each other. Moreover, to integrate their advantages in case by case, hybrid approach is consistently researched, and Zone Routing Protocol (ZRP) was motivating many recent hybrid protocols. In ZRP, a node uses proactive routing if it is located within the zone defined by the specific number of hops, but it uses reactive routing in otherwise case. However, ZRP always forms the proactive zone considering only the number of hops, regardless of whether real data communication occurred frequently or not. In this paper, we propose a new routing scheme called Traffic Aware Dynamic Zone Routing (TA-DZR) protocol which employs the zone method but forms customized zone using traffic load, by a new decision method named Dynamic Zone Decision (DZD). The DZD selects nodes that are good to use proactive routing based on the traffic load and forms the proactive zone with them. By considering traffic awareness, TA-DZR can decrease the number of transmissions and can reduce the total energy consumption. After the description of TA-DZR, the performance is demonstrated with simulation results which show that the number of transmissions decreases in overall network, and that the energy consumption is also reduced. Additionally, we validate that the end-to-end delivery delay is reduced and that the packet delivery ratio is improved. These enhancements are caused by reducing overall network congestion.

In recent years, Vehicular Ad-Hoc Networks (VANETs) innovation has been regarded as a significant research area. This is owing to the increasing popularity of vehicle to vehicle (V2V) and vehicle to infrastructure (V2I) communications in the area of Intelligent Transportation System (ITS) to improve traffic management, safety, CO2 emission mitigation, and other applications. A variety of routing protocols for VANETs are being recently developed. More specifically, geographic-based routing algorithms such as Greedy Perimeter Stateless Routing (GPSR) have provoked the most interest in VANETs due to their compatibility with a regularly changing network structure and the highly unsteady nature of automobile nodes. This paper proposes an efficient weight based mobility method in VANET to improve the mechanism of the GPSR protocol through optimizing the greedy forwarding strategy; which is so called O-Greedy Mode. Therefore, the key goal is to achieve the optimal data forwarding paths. The next hop is determined by estimating the neighbors' mobility based on each neighbor's Greedy Link Weight Factor (GLWF). The Weighted GPSR (W-GPSR) based on Mobility Prediction is then evaluated using OMNeT++ simulator with Inet, Veins and SUMO traffic simulator. The results demonstrate the efficiency of W-GPSR in contrast with the traditional existing protocols for essential metrics of Packet Delivery Ratio (PDR), throughput, End-to-End Delay (E2ED), Normalized Routing Load (NRL) and Packet Loss Ratio (PLR).

Recent research has highlighted the potential of equipping soldiers with portable computing devices as a means to regularly report complex and important observations to mission planners at headquarters. To realise such scenarios connectivity between disparate elements in the battlefield needs to be established and appropriate supporting algorithms developed. In MANET literature several algorithms have been proposed to this effect for topologies where infrastructure is poor or non-available but not specifically for a military setting. In this work, we present a topology derived from a battalion deployment plan suitably parametrised to account for different personnel fill-up rates. In this setting we examine the performance of three position-based routing protocols, namely the Greedy Perimeter Stateless Routing (GPSR) protocol and two optimisations; the Divisional Perimeter Routing (GPSR-DP), and Buffering Zone Greedy Forwarding Strategy (GPSR-BZGFS). Our results indicate that the default GPSR approach as well as the two optimisations do not perform adequately due to frequent network disconnections, which occur as a consequence of the large deployment area. We highlight the need for more research to discover a workable solution and discuss possible approaches to the issue.

This paper presents a novel position-based routing protocol for vehicular ad hoc networks (VANETs) to enhance traffic safety and traffic organization and facilitate driving through a smart transportation system. The protocol is referred to as the traffic flow-oriented routing (TFOR) protocol for VANETs. It considers a real-time urban scenario with multi-lane and bi-directional roads. It chooses junction optimally considering vehicular traffic flows to accomplish robust routing paths and thereby forwarding the data packets. The new junction selection mechanism and routing between the junctions is based on two-hop neighbor information, which increases packet-delivery ratio and decreases end-to-end delay. We designed, implemented, and compared TFOR against existing routing protocols of VANETs (greedy-perimeter stateless routing (GPSR), geographic source routing (GSR), and enhanced greedy traffic-aware routing (E-GyTAR)). Simulation outcomes in urban scenarios show that TFOR minimizes average end-to-end delay and routing overhead by on average 15.3% and 19.5%, respectively, compared to GPSR. It reduces routing overhead up to 17% compared to GSR. TFOR maximizes packet-delivery ratio on an average of 17.5%, 10.7%, and 7.2% compared to GPSR, GSR, and E-GyTAR, respectively.

Growing use of vehicles in the city has increased the number of accidents and reduced the safety level to the passengers. Alerting drivers about the condition of road, traffic and related aspect is crucial to safety and for the regulation of vehicle flow. To achieve this in timely manner, an accurate information is needed. So an efficient, robust and scalable VANET (Vehicular Ad-hoc Network) routing protocol will play a key role to achieve this. This protocol have a potential to protect the generation by incorporating the new generation wireless network into vehicle. This paper represent a fitness based VANET routing protocol, which is operable in dynamic network conditions and compatible with both communication modes like V-I (vehicle-Infrastructure) and V-V (vehicle-vehicle) communication. It also focuses on both multi-path and single-path in the multi hop routing based on delay sensitive and delay non-sensitive data in a dense and sparse environment. It also provide a cost-efficient, intelligent routing strategy by sending a safety packet delivery assurance by optimally measuring the fitness in terms of distance, moving direction and link quality metric in V-V and V-I communication. The performance of our proposed protocol is evaluated by Ns2 simulator. The proposed protocol is compared to existing protocols like AODV (Ad-hoc On demand Distance Vector Routing), GPSR (Greedy Perimeter Stateless Routing) and prove the safety and efficiency of our protocol in term of Road Safety Assurance, and Packet Delivery Ratio.

Vehicular Ad-hoc network (VANET) is a self-organized ad hoc network. VANET becomes a most challenging research area as it has several issues related to routing protocols, quality of service, security, etc. Vehicular communication is critically unsafe to several kinds of active and passive routing attacks. This paper analyzes the impact of a compromised node (vehicle) on zone routing protocol and ad-hoc on-demand distance vector, and recommends a suitable solution called secure vehicular on demand routing to find out and mitigate the black hole attack. The given study analyses the effect of vehicle density on the average throughput, packet delivery ratio, end-to-end delay, normalized routing load and average path length.

In the recent years, the study and developments of networks that do not depend on any pre-existing infrastructure have been very popular. Vehicular Ad Hoc Networks (VANETs) belong to the class of these networks, in which each vehicle participates in routing by transmitting data for other nodes (vehicles). Due to the characteristics of VANET (e.g. high dynamic topology, different communication environment, frequently link breakage…), the routing process still one of the most challenging aspects. Hence, many routing protocols have been suggested to overcome these challenges. Moreover, routing protocols based on the position of vehicles are the most popular and preferred class, thanks to its many advantages like the less control overhead and the scalability. However, this class suffer from some problems such as frequent link breakages caused by the high-mobility of vehicles, which cause a low PDR and throughput. In this investigation, we introduce a novel greedy forwarding strategy used to create a new routing protocol based on the position of vehicles, to reduce the link breakages and get a stable route that improves the PDR and throughput. The proposed Density and Velocity (Speed, Direction) Aware Greedy Perimeter Stateless Routing protocol (DVA-GPSR) is based on the suggested greedy forwarding technique that utilizes the density, the speed and the direction for selecting the most convenient relaying node candidate. The results of simulation prove that DVA-GPSR protocol outperforms the classical GPSR in all studied metrics like PDR, throughput, and the ratio of routing overhead by changing the quantity of vehicles in urban and highway scenarios.

The increase in the number of vehicles without the development of driving safety technology, tends to create adverse impacts on society, such as a rise in casualties due to road accidents. Therefore, vehicles need information on the condition of the surrounding traffic environment to provide driver with safety. One of the methods used to obtain prompt information between vehicles that move dynamically is communication technology such as Vehicular Ad hoc Network (VANET). VANET has network characteristics that change rapidly due to the highly dynamic node movement. Therefore, it is necessary to choose the right routing protocol for optimal data transmission. In this study, the DSDV (Destination Sequenced Distance Vector), AOMDV (Ad-hoc on Demand Multipath Distance Vector), and ZRP (Zone Routing Protocol) routing protocols were tested using 3 field data scenarios. The first scenario is a variation of the number of nodes 100, 250, 600, and 700 nodes. The second scenario is a variation of the transmission ranges of 250m, 500m, and 1km. The third scenario is the variation of node speeds of 10 km/hour, 20 km/hour, 30 km/hour, 40 km/hour, and 50 km/hour in Pekanbaru city of Riau province. This research was carried out using the simulation method along with the QoS (Quality of Service) performance testing parameters comprising packet delivery ratio, end to end delay, throughput, collision rate, and packet loss. Out of the three scenarios tested, AOMDV is the best routing protocol to be implemented because it outperforms the other two protocol evaluated in all designated scenarios in the paper. Meanwhile, DSDV and ZRP are superior in end to end delay and routing overhead parameters, respectively.

Fast advances in wireless technologies and the automotive industry have propelled the proliferation of vehicular ad hoc networks (VANETs). These latter aim to increase road safety and reduce traffic accidents, as well as to provide drivers and passengers with entertainment features. Although, the amalgamated VANETs applications, still face challenging requirements to achieve reliable communication between vehicles or/and vehicles and infrastructure. This is mainly due to their high mobility. Hence, the location information of the vehicles quickly becomes outdated and false. Therefore efficient mechanisms are needed to keep it up to date. The simplest solution consists of increasing the frequency of Hello messages exchanged between vehicles. Unfortunately, this will largely occupy the communication channel and, consequently, may lead to a lot of collisions. In this paper, we propose a novel Extended Kalman Filter Greedy Perimeter Stateless Routing protocol (EKF-GPSR), to address this issue. EKF-GPSR uses a stochastic prediction model based on an EKF to obtain the user information when transmitting data instead of using information from the last beacon exchanged messages which is most likely outdated. The simulation results in Omnet++ and Sumo showed that our proposed protocol EKF-GPSR outperforms the GPSR protocol in terms of packet delivery rate, delay, and throughput.