scholarly journals VANET Simulator: Full Design Architecture

2020 ◽  
Vol 9 (3) ◽  
pp. 2024-2034
Keyword(s):  
Autonomous Vehicles ◽  
High Speed ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Autonomous Driving ◽  
Architecture Design ◽  
Network Simulator ◽  
Daily Lives ◽  
Hoc Networks

Vehicular ad-hoc networks VANETs are now greatly affecting our daily lives. Autonomous driving vehicles becomes a hot research topic in automotive industry. Deploying autonomous vehicles scenarios requires realistic network through which all vehicles can communicate safely and efficiently. Network simulation prior direct implementation saves a lot of time and money, due to the high implementation cost of the vehicular ad-hoc networks.VANET simulators are not as same as mobile ad-hoc network MANET simulators; they have different characteristics and different architecture design, where VANET simulators are rapidly changing network topology in a frequent basis with high-speed moving nodes.In this paper, we will discuss the full architecture design of VANET simulator, which consists of three main parts: mobility generator, network simulator, and a middleware framework that combine both mobility and network simulator together, followed by a comparative study of the different parts of VANET simulator.

scholarly journals Cooperation Promotion from the Perspective of Behavioral Economics: An Incentive Mechanism Based on Loss Aversion in Vehicular Ad-Hoc Networks

Electronics ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 225 ◽  
Author(s):  
Jiaqi Liu ◽  
Shiyue Huang ◽  
Hucheng Xu ◽  
Deng Li ◽  
Nan Zhong ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Loss Aversion ◽  
High Speed ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Incentive Mechanism ◽  
Final Decision ◽  
The Incentive Mechanism ◽  
Hoc Networks

As a special mobile ad-hoc network, Vehicular Ad-hoc Networks (VANETs) have the characteristics of high-speed movement, frequent topology changes, multi-hop routing, a lack of energy, storage space limitations, and the possible selfishness of the nodes. These characteristics bring challenges to the design of the incentive mechanism in VANETs. In the current research on the incentive mechanism of VANETs, the mainstream is the reward-based incentive mechanism. Most of these mechanisms are designed based on the expected utility theory of traditional economics and assume that the positive and negative effects produced by an equal amount of gain and loss are equal in absolute value. However, the theory of loss aversion points out that the above effects are not equal. Moreover, this will lead to a deviation between the final decision-making behavior of nodes and the actual optimal situation. Therefore, this paper proposed a Loss-Aversion-based Incentive Mechanism (LAIM) to promote the comprehensive perception and sharing of information in the VANETs. This paper designs the incentive threshold and the threshold factor to motivate vehicle nodes to cooperate. Furthermore, based on the number of messages that the nodes face, the utility function of nodes is redesigned to correct the assumption that a gain and a loss of an equal amount could offset each other in traditional economics. The simulation results show that compared with the traditional incentive mechanism, the LAIM can increase the average utility of nodes by more than 34.35%, which promotes the cooperation of nodes.

scholarly journals A TDMA-Based MAC Protocol for Mitigating Mobility-Caused Packet Collisions in Vehicular Ad Hoc Networks

Sensors ◽  
2022 ◽  
Vol 22 (2) ◽  
pp. 643
Author(s):  
Muhammad Bilal Latif ◽  
Feng Liu ◽  
Kai Liu
Keyword(s):  
Ad Hoc Networks ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Time Slot ◽  
Mac Protocol ◽  
Autonomous Driving ◽  
Message Delivery ◽  
Average Delay ◽  
Stringent Requirement ◽  
Hoc Networks

An autonomous driving environment poses a very stringent requirement for the timely delivery of safety messages in vehicular ad hoc networks (VANETs). Time division multiple access (TDMA)-based medium access control (MAC) protocols are considered a promising solution because of their time-bound message delivery. However, in the event of mobility-caused packet collisions, they may experience an unpredicted and extended delay in delivering messages, which can cause catastrophic accidents. To solve this problem, a distributed TDMA-based MAC protocol with mobility-caused collision mitigation (MCCM-MAC) is presented in this paper. The protocol uses a novel mechanism to detect merging collisions and mitigates them by avoiding subsequent access collisions. One vehicle in the merging collisions retains the time slot, and the others release the slot. The common neighboring vehicles can timely suggest a suitable new time slot for the vacating vehicles, which can avoid access collisions between their packet transmissions. A tie-breakup mechanism is employed to avoid further access collisions. Simulation results show that the proposed protocol reduces packet loss more than the existing methods. Consequently, the average delay between the successfully delivered periodic messages is also reduced.

A Probabilistic Routing Protocol in VANET

2010 ◽  
Vol 2 (4) ◽  
pp. 21-37 ◽  
Author(s):  
Gongjun Yan ◽  
Stephan Olariu ◽  
Shaharuddin Salleh
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
High Speed ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Probability Model ◽  
Proposed Model ◽  
Probabilistic Routing ◽  
Hoc Networks ◽  
Manet Networks

The key attribute that distinguishes Vehicular Ad hoc Networks (VANET) from Mobile Ad hoc Networks (MANET) is scale. While MANET networks involve up to one hundred nodes and are short lived, being deployed in support of special-purpose operations, VANET networks involve millions of vehicles on thousands of kilometers of highways and city streets. Being mission-driven, MANET mobility is inherently limited by the application at hand. In most MANET applications, mobility occurs at low speed. By contrast, VANET networks involve vehicles that move at high speed, often well beyond what is reasonable or legally stipulated. Given the scale of its mobility and number of actors involved, the topology of VANET is changing constantly and, as a result, both individual links and routing paths are inherently unstable. Motivated by this latter truism, the authors propose a probability model for link duration based on realistic vehicular dynamics and radio propagation assumptions. The paper illustrates how the proposed model can be incorporated in a routing protocol, which results in paths that are easier to construct and maintain. Extensive simulation results confirm that this probabilistic routing protocol results in more easily maintainable paths.

Traffic-Centric Mesoscopic Analysis of Connectivity in VANETs

2019 ◽  
Vol 63 (2) ◽  
pp. 203-219 ◽  
Author(s):  
Mani Zarei
Keyword(s):  
Steady State ◽  
Traffic Flow ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Road Traffic ◽  
Mobility Model ◽  
Network Simulator ◽  
Expected Time ◽  
Distance Distributions ◽  
Hoc Networks

Abstract Vehicular ad hoc networks (VANETs) have emerged as an appropriate class of information propagation technology promising to link us even while moving at high speeds. In VANETs, a piece of information propagates through consecutive connections. In the most previous vehicular connectivity analysis, the provided probability density function of intervehicle distance throughout the wide variety of steady-state traffic flow conditions is surprisingly invariant. But, using a constant assumption, generates approximate communication results, prevents us from improving the performance of the current solutions and impedes designing the new applications on VANETs. Hence, in this paper, a mesoscopic vehicular mobility model in a multilane highway with a steady-state traffic flow condition is adopted. To model a traffic-centric distribution for the spatial per-hop progress and the expected spatial per-hop progress, different intervehicle distance distributions are utilized. Moreover, the expected number of hops, distribution of the number of successful multihop forwarding, the expected time delay and the expected connectivity distance are mathematically investigated. Finally, to model the distribution of the connectivity distances, a set of simplistic closed-form traffic-centric equations is proposed. The accuracy of the proposed model is confirmed using an event-based network simulator as well as a road traffic simulator.

Efficient Mechanisms and Performance Analysis of Routing Protocols in VANETs for Realistic Scenarios

2016 ◽  
Vol 8 (3) ◽  
pp. 20-49 ◽  
Author(s):  
Christos Bouras ◽  
Vaggelis Kapoulas ◽  
Enea Tsanai
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocols ◽  
High Speed ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Traffic Efficiency ◽  
Pattern Movement ◽  
Manet Routing ◽  
And Performance ◽  
Hoc Networks

Vehicular Ad Hoc Networks (VANETs) are considered as a special case of mobile Ad Hoc Networks (MANETs) and are recently gaining a great attention from the research community. The need for improved road safety, traffic efficiency and direct communication along with the great complexity in routing, makes VANETs a highly challenging field. Routing in VANETs has to adapt to special characteristics such as high speed and road pattern movement as well as high linkage break probability. In this work, the authors show that traditional MANET routing protocols cannot efficiently handle the challenges in a VANET environment and thus need further modifications. For this reason, they propose and implement an enhancement mechanism, applied to the GPSR routing protocol that adapts to the needs of a VANET. The proposed mechanism's performance is evaluated through simulation sets for urban and highway scenarios and compared to the performance of the most common MANET routing protocols adopted in VANETs. The proposed enhancement is shown to be considerably beneficial and it significantly outperforms the rest of the tested routing protocols for almost every topology setting.

scholarly journals A Semi-Deterministic Channel Model for VANETs Simulations

2012 ◽  
Vol 2012 ◽  
pp. 1-8 ◽  
Author(s):  
Jonathan Ledy ◽  
Hervé Boeglen ◽  
Anne-Marie Poussard ◽  
Benoît Hilt ◽  
Rodolphe Vauzelle
Keyword(s):  
Hybrid Model ◽  
Urban Areas ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Channel Model ◽  
Propagation Model ◽  
Network Simulator ◽  
Physical Layers ◽  
Hoc Networks ◽  
Simulation Time

Today's advanced simulators facilitate thorough studies on Vehicular Ad hoc NETworks (VANETs). However the choice of the physical layer model in such simulators is a crucial issue that impacts the results. A solution to this challenge might be found with a hybrid model. In this paper, we propose a semi-deterministic channel propagation model for VANETs called UM-CRT. It is based on CRT (Communication Ray Tracer) and SCME—UM (Spatial Channel Model Extended—Urban Micro) which are, respectively, a deterministic channel simulator and a statistical channel model. It uses a process which adjusts the statistical model using relevant parameters obtained from the deterministic simulator. To evaluate realistic VANET transmissions, we have integrated our hybrid model in fully compliant 802.11 p and 802.11 n physical layers. This framework is then used with the NS-2 network simulator. Our simulation results show that UM-CRT is adapted for VANETs simulations in urban areas as it gives a good approximation of realistic channel propagation mechanisms while improving significantly simulation time.

scholarly journals Transmission Power Based Intelligent Model in VANET

2020 ◽  
pp. 768-775
Author(s):  
Pushpender Sarao ◽  
Keyword(s):  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Research Work ◽  
Network Simulator ◽  
Transmission Power ◽  
Neuro Fuzzy ◽  
Proposed Model ◽  
Hoc Networks ◽  
Intelligent Model ◽  
Research Domain

Vehicular ad-hoc networks is very popular research domain in which research work is going on at various aspects like routing the data without loss end-to-end. Routing in such networks is very tedious task due to frequently changing the position of vehicles location-wise. In this paper an intelligent model has been developed on the basis of adaptive neuro fuzzy system for OLSR routing protocol in VANET. The proposed model is designed based on input parameters average goodput and mac/phy-overhead. Based on these parameters, transmission power can be predicted. Triangular and Gaussian membership functions have been applied for designing the decision model. A comparison work also has been carried out for Gaussian, triangular functions and NS-3 based results. At the same time, the model is investigated by simulation work carried out on network simulator-3 (NS-3) platform.

scholarly journals Threats and Alert Analytics in Autonomous Vehicles

10.29007/j6h1 ◽  
2020 ◽  
Author(s):  
Aakanksha Rastogi ◽  
Kendall Nygard
Keyword(s):  
Traffic Congestion ◽  
Autonomous Vehicles ◽  
Traffic Accidents ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Driver Assistance ◽  
Driving Experience ◽  
Vehicle To Vehicle ◽  
Hoc Networks ◽  
Self Driving Cars

Autonomous vehicles or self-driving cars emerged with a promise to deliver a driving experience that is safe, secure, law-abiding, alleviates traffic congestion and reduces traffic accidents. These self-driving cars predominantly rely on wireless technology, vehicular ad-hoc networks (VANETs) and Vehicle to Vehicle (V2V) networks, Road Side Units (RSUs), Millimeter Wave radars, light detection and ranging (LiDAR), sensors and cameras, etc. Since these vehicles are so dexterous and equipped with such advanced driver assistance technological features, their dexterity invites threats, vulnerabilities and hacking attacks. This paper aims to understand and study the technology behind these self-driving cars and explore, identify and address popular threats, vulnerabilities and hacking attacks to which these cars are prone. This paper also establishes a relationship between these threats, trust and reliability. An analysis of the alert systems in self-driving cars is also presented.

Wireless Networks for Vehicular Support

2011 ◽  
pp. 4135-4140 ◽  
Author(s):  
Pietro Manzoni ◽  
Carlos T. Calafate ◽  
Juan-Carlos Cano ◽  
Antonio Skarmeta ◽  
Vittoria Gianuzzi
Keyword(s):  
Ad Hoc Networks ◽  
High Speed ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Building Blocks ◽  
The Road ◽  
V2v Communication ◽  
Safety Message ◽  
On The Road ◽  
Hoc Networks

Vehicular Ad hoc NETworks (VANETs) is an area under intensive research that promises to improve security on the road by developing an intelligent transport system (ITS). The main purpose is to create an inter-communication network among vehicles, as well as between vehicles and the supporting infrastructure. The system pretends to offer drivers data concerning other nearby vehicles, especially those within sight. The problem of information sharing among vehicles and between the vehicle and the infrastructure is another critical aspect. A general communication infrastructure is required for the notification, storage, management, and provision of context-aware information about user travel. Ideally an integrated vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication paradigm enriched with an information management system would solve the problem. The infrastructure should manage all the collected safety events garnered from vehicles and the interesting information to be provided to the user, which is adapted to the car context and driver preferences. Finally, security issues should be considered. Since the information conveyed over a vehicular network may affect critical decisions, fail-safe security is a necessity. The first directive for any V2V communication scheme is, therefore, that every safety message must be authenticated. Because of the high speed and therefore short duration within which communication between two cars is possible, communication must be non-interactive, and message overhead must be very low. The urgency of safety messages implies that authentication must be instantaneous without additional communication. Moreover, providing strong security in vehicular networks raises important privacy concerns that must also be considered. Safety messages include data that is dangerous to the personal privacy of vehicle owners. Most relevant is the danger of tracking a vehicle through positional information. A set of security basics to address these challenges should be proposed that can be used as the building blocks of secure applications. In this article we will focus on the aforementioned technologies and engineering issues related to vehicular ad-hoc networks, emphasizing the challenges that must be overcome to accomplish the desired vehicular safety infrastructure.

A Probabilistic Routing Protocol in VANET

2012 ◽  
pp. 19-34
Author(s):  
Gongjun Yan ◽  
Stephan Olariu ◽  
Shaharuddin Salleh
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
High Speed ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Probability Model ◽  
Proposed Model ◽  
Probabilistic Routing ◽  
Hoc Networks ◽  
Link Duration

The key attribute that distinguishes Vehicular Ad hoc Networks (VANET) from Mobile Ad hoc Networks (MANET) is scale. While MANET networks involve up to one hundred nodes and are short lived, being deployed in support of special-purpose operations, VANET networks involve millions of vehicles on thousands of kilometers of highways and city streets. Being mission-driven, MANET mobility is inherently limited by the application at hand. In most MANET applications, mobility occurs at low speed. By contrast, VANET networks involve vehicles that move at high speed, often well beyond what is reasonable or legally stipulated. Given the scale of its mobility and number of actors involved, the topology of VANET is changing constantly and, as a result, both individual links and routing paths are inherently unstable. Motivated by this latter truism, the authors propose a probability model for link duration based on realistic vehicular dynamics and radio propagation assumptions. The paper illustrates how the proposed model can be incorporated in a routing protocol, which results in paths that are easier to construct and maintain. Extensive simulation results confirm that this probabilistic routing protocol results in more easily maintainable paths.

Sign in / Sign up

Export Citation Format

Share Document