scholarly journals Performance Evaluation of VeMAC Supporting Safety Applications in Vehicular Networks

2013 ◽  
Vol 1 (1) ◽  
pp. 69-83 ◽  
Author(s):  
Hassan Aboubakr Omar ◽  
Weihua Zhuang ◽  
Atef Abdrabou ◽  
Li Li
IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 103244-103257
Author(s):  
Dustin Carrion-Ojeda ◽  
Cristhian Iza ◽  
Monica Aguilar Igartua

Transport ◽  
2008 ◽  
Vol 23 (4) ◽  
pp. 291-298 ◽  
Author(s):  
Saleh Yousefi ◽  
Mahmood Fathy

In the recent years, direct message exchange between vehicles in order to improve the safety of road traffic has been attracting lots of interest in both networking and road safety communities. While travelling on a road, vehicles form an ad hoc network called Vehicular Ad hoc NETwork (VANET) and deploy life safety applications. Evaluating the performance of these applications is primordial for realizing VANETs in real life. Current literature lacks efficient ways to evaluate the performance of safety applications and mostly leverages on classical networking metrics like delay, delivery rate etc. In this paper, we consider both networking and safety concerns simultaneously to come up with more efficient methods. In particular, we first point out the significance of fairness and coverage from safety viewpoint. Then, we introduce two new metrics called beaconing rate and effective range aiming at providing more facilities for safety performance evaluation in VANET s research. Furthermore, realizing special characteristics of safety applications while disseminating beacon messages, we study the way that beacon dissemination protocols affect the performance of safety applications. We then conduct extensive simulation study to show the usefulness of the introduced metrics and derive some insights on the feasibility of driver‐assistant safety applications. Our evaluation also shows that sending the aggregated status of neighbouring vehicles in addition to vehicle's own status, and instead, increasing beacon transmission interval may be invoked in order to assist safety applications in providing satisfactory services to drivers.


2011 ◽  
Vol 64 (3) ◽  
pp. 401-416 ◽  
Author(s):  
Mahmoud Efatmaneshnik ◽  
Allison Kealy ◽  
Asghar Tabatabei Balaei ◽  
Andrew G. Dempster

Cooperative positioning (CP) is a localization technique originally developed for use across wireless sensor networks. With the emergence of Dedicated Short Range Communications (DSRC) infrastructure for use in Intelligent Transportation Systems (ITS), CP techniques can now be adapted for use in location determination across vehicular networks. In vehicular networks, the technique of CP fuses GPS positions with additional sensed information such as inter-vehicle distances between the moving vehicles to determine their location within a neighbourhood. This paper presents the results obtained from a research study undertaken to demonstrate the capabilities of DSRC for meeting the positioning accuracies of road safety applications. The results show that a CP algorithm that fully integrates both measured/sensed data as well as navigation information such as map data can meet the positioning requirements of safety related applications of DSRC (<0·5 m). This paper presents the results of a Cramer Rao Lower Bound analysis which is used to benchmark the performance of the CP algorithm developed. The Kalman Filter (KF) models used in the CP algorithm are detailed and results obtained from integrating GPS positions, inter-vehicular ranges and information derived from in-vehicle maps are then discussed along with typical results as determined through a variety of network simulation studies.


Information ◽  
2020 ◽  
Vol 11 (3) ◽  
pp. 163 ◽  
Author(s):  
Gonçalo Pessoa ◽  
Lucas Guardalben ◽  
Miguel Luís ◽  
Carlos Senna ◽  
Susana Sargento

The main drivers for the continuous development of Vehicular ad-hoc Networks (VANETs) are safety applications and services. However, in recent years, new interests have emerged regarding the introduction of new applications and services for non-urgent content (e.g., videos, ads, sensing and touristic information) dissemination. However, there is a lack of real studies considering content dissemination strategies to understand when and to whom the content should be disseminated using real vehicular traces gathered from real vehicular networks. This work presents a realistic study of strategies for dissemination of non-urgent content with the main goal of improving content delivery as well as minimizing network congestion and resource usage. First, we perform an exhaustive network characterization. Then, several content strategies are specified and evaluated in different scenarios (city center and parking lot). All the obtained results show that there are two content distribution strategies that clearly set themselves apart due to their superior performance: Local Rarest Bundle First and Local Rarest Generation First.


Sign in / Sign up

Export Citation Format

Share Document