scholarly journals An optimized location service for the fifth generation VANETs inspired by traffic lights

PLoS ONE ◽  
2021 ◽  
Vol 16 (11) ◽  
pp. e0259060
Author(s):  
Esraa Al-Ezaly ◽  
Ahmed Abo-Elfetoh ◽  
Sara Elhishi
Keyword(s):  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Geographic Location ◽  
Delivery Ratio ◽  
Traffic Light ◽  
Location Services ◽  
Traffic Lights ◽  
Location Service ◽  
Fifth Generation ◽  
Hoc Networks

Vehicular ad-hoc networks (VANETs) address a steadily expanding demand, particularly for public emergency applications. Real-time localization of destination vehicles is important for determining the route to deliver messages. Existing location administration services in VANETs are classified as flooding-based, flat-based, and geographic-based location services. Existing localization techniques suffer from network disconnection and overloading because of 5G VANET topology changes. 5G VANETs have low delay and support time-sensitive applications. A traffic light-inspired location service (TLILS) is proposed to manage localization inspired by traffic lights. The proposed optimized localization service uses roadside units (RSUs) as location servers. RSUs with the maximum traffic weight metrics were chosen. Traffic weight metrics are based on speed of vehicles, connection time and density of neighboring vehicles. The proposed TLILS outperforms both Name-ID Hybrid Routing (NIHR) and Zoom-Out Geographic Location Service (ZGLS) for packet delivery ratio (PDR) and delay. TLILSs guarantee the highest PDR (0.96) and the shortest end-to-end delay (0.001 s) over NIHR and ZGLS.

Reactive Location-Based Routing Algorithm with Cluster-Based Flooding

2012 ◽  
pp. 149-161
Author(s):  
Raul Aquino Santos
Keyword(s):  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Location Information ◽  
Location Services ◽  
Location Service ◽  
Wireless Routing ◽  
Predictive Algorithm ◽  
Local Decision ◽  
Hoc Networks

Location-Based Routing Algorithm with Cluster-Based Flooding (LORA-CBF) employs two location services: Simple and Reactive. A Simple Location Service has been implemented for neighbors nodes, and for faraway nodes, a Reactive Location Service is employed. In LORA-CBF, the source node includes the location of its destination in each packet. The packet moves hop by hop through the network, forwarded along via cooperating intermediates nodes. At each node, a purely local decision is made to forward the packet to the neighbor that is geographically closest to the destination. However, location information by itself does not guarantee the transmission between neighboring nodes in vehicular ad-hoc networks. Mobility and contention of wireless media may cause loss of packets being transferred, and this is very important aspect to consider in the development of wireless routing algorithms. Here, the authors have addressed this problem by including a predictive algorithm in LORA-CBF.

scholarly journals Design and Evaluation of Flooding-Based Location Service in Vehicular Ad Hoc Networks

Sensors ◽  
2020 ◽  
Vol 20 (8) ◽  
pp. 2389 ◽  
Author(s):  
Paul Mühlethaler ◽  
Éric Renault ◽  
Selma Boumerdassi
Keyword(s):  
Ad Hoc Networks ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Random Network ◽  
Location Information ◽  
Location Services ◽  
Location Service ◽  
Link State ◽  
The Mean ◽  
Hoc Networks

Location-based routing protocols for vehicular ad hoc networks (VANETs) use location information to determine routing decisions. This information is provided by a location service that is queried by nodes in order to properly forward packets to communication partners. This paper presents the semiflooding location service, a proactive flooding-based location service that drastically reduces the number of update packets sent over the network compared to traditional flooding-based location services. This goal is achieved by each node partially forwarding location information. We present both deterministic and probabilistic approaches for this algorithm, which remains very simple. A mathematical model is proposed to show the effectiveness of this solution. The cases of homogeneous 1D, 2D, and 3D networks were studied for both deterministic and probabilistic forwarding decisions. We compare our algorithm with simple flooding and with the multipoint-relay (MPR) flooding of the optimized-link-state-routing (OLSR) protocol, and we show that our algorithm, despite being very simple, has excellent scalability properties. The mean number of generated messages ranges with the mean number of the neighbors of one random network node.

Modified fuzzy-based greedy routing protocol for VANETs

2020 ◽  
Vol 39 (6) ◽  
pp. 8357-8364
Author(s):  
Thompson Stephan ◽  
Ananthnarayan Rajappa ◽  
K.S. Sendhil Kumar ◽  
Shivang Gupta ◽  
Achyut Shankar ◽  
...  
Keyword(s):  
Fuzzy Logic ◽  
Routing Protocol ◽  
Intelligent Transportation Systems ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Research Area ◽  
Transportation Systems ◽  
Delivery Ratio ◽  
Greedy Routing ◽  
Hoc Networks

Vehicular Ad Hoc Networks (VANETs) is the most growing research area in wireless communication and has been gaining significant attention over recent years due to its role in designing intelligent transportation systems. Wireless multi-hop forwarding in VANETs is challenging since the data has to be relayed as soon as possible through the intermediate vehicles from the source to destination. This paper proposes a modified fuzzy-based greedy routing protocol (MFGR) which is an enhanced version of fuzzy logic-based greedy routing protocol (FLGR). Our proposed protocol applies fuzzy logic for the selection of the next greedy forwarder to forward the data reliably towards the destination. Five parameters, namely distance, direction, speed, position, and trust have been used to evaluate the node’s stability using fuzzy logic. The simulation results demonstrate that the proposed MFGR scheme can achieve the best performance in terms of the highest packet delivery ratio (PDR) and minimizes the average number of hops among all protocols.

Artificial Intelligence Based Intrusion Detection System to Detect Flooding Attack in VANETs

2018 ◽  
pp. 87-100 ◽  
Author(s):  
Mannat Jot Singh Aneja ◽  
Tarunpreet Bhatia ◽  
Gaurav Sharma ◽  
Gulshan Shrivastava
Keyword(s):  
Intrusion Detection ◽  
Ad Hoc Networks ◽  
Intrusion Detection System ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Performance Metrics ◽  
Detection System ◽  
Delivery Ratio ◽  
Flooding Attack ◽  
Hoc Networks

This chapter describes how Vehicular Ad hoc Networks (VANETs) are classes of ad hoc networks that provides communication among various vehicles and roadside units. VANETs being decentralized are susceptible to many security attacks. A flooding attack is one of the major security threats to the VANET environment. This chapter proposes a hybrid Intrusion Detection System which improves accuracy and other performance metrics using Artificial Neural Networks as a classification engine and a genetic algorithm as an optimization engine for feature subset selection. These performance metrics have been calculated in two scenarios, namely misuse and anomaly. Various performance metrics are calculated and compared with other researchers' work. The results obtained indicate a high accuracy and precision and negligible false alarm rate. These performance metrics are used to evaluate the intrusion system and compare with other existing algorithms. The classifier works well for multiple malicious nodes. Apart from machine learning techniques, the effect of the network parameters like throughput and packet delivery ratio is observed.

scholarly journals Position Certainty Propagation: A Localization Service for Ad-Hoc Networks

Computers ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 6 ◽  
Author(s):  
Abdallah Sobehy ◽  
Eric Renault ◽  
Paul Muhlethaler
Keyword(s):  
Ad Hoc Networks ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Resource Constraints ◽  
Sensor Nodes ◽  
Energy Aware ◽  
Efficient Manner ◽  
Location Services ◽  
Wide Range ◽  
Hoc Networks

Location services for ad-hoc networks are of indispensable value for a wide range of applications, such as the Internet of Things (IoT) and vehicular ad-hoc networks (VANETs). Each context requires a solution that addresses the specific needs of the application. For instance, IoT sensor nodes have resource constraints (i.e., computational capabilities), and so a localization service should be highly efficient to conserve the lifespan of these nodes. We propose an optimized energy-aware and low computational solution, requiring 3-GPS equipped nodes (anchor nodes) in the network. Moreover, the computations are lightweight and can be implemented distributively among nodes. Knowing the maximum range of communication for all nodes and distances between 1-hop neighbors, each node localizes itself and shares its location with the network in an efficient manner. We simulate our proposed algorithm in a NS-3 simulator, and compare our solution with state-of-the-art methods. Our method is capable of localizing more nodes (≈90% of nodes in a network with an average degree ≈10).

The Efficient Managemnet of Renewable Energy Resources for Vanet-Cloud Communication

2020 ◽  
pp. 228-253
Author(s):  
Nitika Kapoor ◽  
Yogesh Kumar
Keyword(s):  
Cloud Computing ◽  
Renewable Energy ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Renewable Energy Resources ◽  
Mobile Nodes ◽  
Traffic Lights ◽  
Self Organized ◽  
Hoc Networks ◽  
Alternative Routes

Vehicular ad hoc networks (VANET) are networks that interconnect road and vehicles. The mobile nodes are used to connect themselves in self-organized manner. VANET is valuable that gives better performance and assures safe transportation system in prospect. Few of them are covered that helps in knowing the best protocol to be used in particular work. Initially, renewable energy is considered to be those sources that are derived either directly or indirectly from solar energy. Due to emission of harmful gases, in VANET, use of renewable resources come in existence. In another section of the chapter, various energy issues in VANET have been highlighted and added the concept of VANET-CLOUD. As cloud computing technologies have potential to improve the travelling experience and safety of roads by giving provision of various solutions like traffic lights synchronization, alternative routes, etc., VANET-CLOUD has been added at the end of the chapter.

scholarly journals BEAT: Beacon Inter-Reception Time Ensured Adaptive Transmission for Vehicle-to-Vehicle Safety Communication

Sensors ◽  
2019 ◽  
Vol 19 (14) ◽  
pp. 3061 ◽  
Author(s):  
Sunghwa Son ◽  
Kyung-Joon Park
Keyword(s):  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Adaptive Transmission ◽  
Vehicle Safety ◽  
Delivery Ratio ◽  
Safety Communication ◽  
Congestion Control Algorithm ◽  
Temporal Aspect ◽  
Varying Environments ◽  
Hoc Networks

To improve vehicle safety, vehicular ad hoc networks (VANETs) periodically broadcast safety messages known as beacons. Consequently, it becomes safety critical to guarantee the timely reception of periodic beacons under the time-varying environments of VANET. However, existing approaches typically measure the packet delivery ratio, which is a time-average metric that does not consider the temporal behavior associated with beacon reception. In this paper, to properly reflect the temporal aspect of beacon reception, we propose a congestion control algorithm, Beacon inter-reception time Ensured Adaptive Transmission (BEAT). The proposed algorithm tightly regulates the beacon inter-reception time compared to conventional techniques, which can significantly improve vehicle safety. Our simulation results demonstrate the effectiveness of the proposed scheme.

scholarly journals Inter-Vehicular Communications Using Wireless Ad Hoc Networks

2010 ◽  
pp. 120-138 ◽  
Author(s):  
Raúl Aquino-Santos ◽  
Víctor Rangel-Licea ◽  
Miguel A. García-Ruiz ◽  
Apolinar González-Potes ◽  
Omar Álvarez-Cardenas ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Large Scale ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Delivery Ratio ◽  
Test Bed ◽  
Limited Bandwidth ◽  
Hoc Networks ◽  
Large Scale Networks

This chapter proposes a new routing algorithm that allows communication in vehicular ad hoc networks. In vehicular ad hoc networks, the transmitter node cannot determine the immediate future position of the receiving node beforehand. Furthermore, rapid topological changes and limited bandwidth compound the difficulties nodes experience when attempting to exchange position information. The authors first validate their algorithm in a small-scale network with test bed results. Then, for large-scale networks, they compare their protocol with the models of two prominent reactive routing algorithms: Ad-Hoc On-Demand Distance Vector and Dynamic Source Routing on a multi-lane circular dual motorway, representative of motorway driving. Then the authors compare their algorithm with motorway vehicular mobility, a location-based routing algorithm, on a multi-lane circular motorway. This chapter then provides motorway vehicular mobility results of a microscopic traffic model developed in OPNET, which the authors use to evaluate the performance of each protocol in terms of: Route Discovery Time, End to End Delay, Routing Overhead, Overhead, Routing Load, and Delivery Ratio.

Sign in / Sign up

Export Citation Format

Share Document