scholarly journals Evaluation of Content Dissemination Strategies in Urban Vehicular Networks

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.

Electronics ◽  
2021 ◽  
Vol 10 (16) ◽  
pp. 1902
Author(s):  
Xiaofeng Liu ◽  
Ben St. Amour ◽  
Arunita Jaekel

Vehicular ad Hoc networks (VANETs) support a variety of applications ranging from critical safety applications to “infotainment” or “comfort” applications. In North America, 75 MHz of the spectrum in the 5.9 GHz band has been allocated for vehicular communication. Safety applications rely on event-driven “alert” messages as well as the periodic broadcast of Basic Safety Messages (BSMs) containing critical information, e.g., position, speed, and heading from participating vehicles. The limited channel capacity and high message rates needed to ensure an adequate level of awareness make the reliable delivery of BSMs a challenging problem for VANETs. In this paper, we propose a decentralized congestion control algorithm that uses variable transmission power levels to reduce the channel busy ratio while maintaining a high level of awareness for nearby vehicles. The simulation results indicate that the proposed approach is able to achieve a suitable balance between awareness and bandwidth usage.


2020 ◽  
Vol 12 (12) ◽  
pp. 234
Author(s):  
Ricardo Chaves ◽  
Carlos Senna ◽  
Miguel Luís ◽  
Susana Sargento ◽  
André Moreira ◽  
...  

The development of protocols for mobile networks, especially for vehicular ad-hoc networks (VANETs), presents great challenges in terms of testing in real conditions. Using a production network for testing communication protocols may not be feasible, and the use of small networks does not meet the requirements for mobility and scale found in real networks. The alternative is to use simulators and emulators, but vehicular network simulators do not meet all the requirements for effective testing. Aspects closely linked to the behaviour of the network nodes (mobility, radio communication capabilities, etc.) are particularly important in mobile networks, where a delay tolerance capability is desired. This paper proposes a distributed emulator, EmuCD, where each network node is built in a container that consumes a data trace that defines the node’s mobility and connectivity in a real network (but also allowing the use of data from simulated networks). The emulated nodes interact directly with the container’s operating system, updating the network conditions at each step of the emulation. In this way, our emulator allows the development and testing of protocols, without any relation to the emulator, whose code is directly portable to any hardware without requiring changes or customizations. Using the facilities of our emulator, we tested InterPlanetary File System (IPFS), Sprinkler and BitTorrent content dissemination protocols with real mobility and connectivity data from a real vehicular network. The tests with a real VANET and with the emulator have shown that, under similar conditions, EmuCD performs closely to the real VANET, only lacking in the finer details that are extremely hard to emulate, such as varying loads in the hardware.


2015 ◽  
Vol 2015 ◽  
pp. 1-11
Author(s):  
Jinsheng Yang ◽  
Changqing Liu ◽  
Shih-Lin Wu

In vehicular ad hoc networks (VANETs), a hotspot, such as a parking lot, is an information source and will receive inquiries from many vehicles for seeking any possible free parking space. According to the routing protocols in literature, each of the vehicles needs to flood its route discovery (RD) packets to discover a route to the hotspot before sending inquiring packets to the parking lot. As a result, the VANET nearby an urban area or city center may incur the problem ofbroadcast stormdue to so many flooding RD packets during rush hours. To avoid the broadcast storm problem, this paper presents ahotspot-enabledrouting-tree based data forwarding method, called the intelligent information dissemination scheme (IID). Our method can let the hotspot automatically decide when to build the routing-tree for proactive information transmissions under the condition that the number of vehicle routing discoveries during a given period exceeds a certain threshold which is calculated through our developed analytical packet delivery model. The routing information will be dynamically maintained by vehicles located at each intersection near the hotspot if the maintaining cost is less than that of allowing vehicles to discover routes themselves. Simulation results show that this method can minimize routing delays for vehicles with lower packets delivery overheads.


2017 ◽  
Vol 2017 ◽  
pp. 1-16 ◽  
Author(s):  
Rakesh Shrestha ◽  
Seung Yeob Nam

In vehicular networks, trustworthiness of exchanged messages is very important since a fake message might incur catastrophic accidents on the road. In this paper, we propose a new scheme to disseminate trustworthy event information while mitigating message modification attack and fake message generation attack. Our scheme attempts to suppress those attacks by exchanging the trust level information of adjacent vehicles and using a two-step procedure. In the first step, each vehicle attempts to determine the trust level, which is referred to as truth-telling probability, of adjacent vehicles. The truth-telling probability is estimated based on the average of opinions of adjacent vehicles, and we apply a new clustering technique to mitigate the effect of malicious vehicles on this estimation by removing their opinions as outliers. Once the truth-telling probability is determined, the trustworthiness of a given message is determined in the second step by applying a modified threshold random walk (TRW) to the opinions of the majority group obtained in the first step. We compare our scheme with other schemes using simulation for several scenarios. The simulation results show that our proposed scheme has a low false decision probability and can efficiently disseminate trustworthy event information to neighboring vehicles in VANET.


Sensors ◽  
2018 ◽  
Vol 18 (11) ◽  
pp. 3622 ◽  
Author(s):  
Jin-Woo Kim ◽  
Jae-Wan Kim ◽  
Dong-Keun Jeon

Vehicular ad hoc networks (VANETs) provide information and entertainment to drivers for safe and enjoyable driving. Wireless Access in Vehicular Environments (WAVE) is designed for VANETs to provide services efficiently. In particular, infotainment services are crucial to leverage market penetration and deployment costs of the WAVE standard. However, a low presence of infrastructure results in a shadow zone on the road and a link disconnection. The link disconnection is an obstacle to providing safety and infotainment services and becomes an obstacle to the deployment of the WAVE standard. In this paper, we propose a cooperative communication protocol to reduce performance degradation due to frequent link disconnection in the road environment. The proposed protocol provides contention-free data delivery by the coordination of roadside units (RSUs) and can provide the network QoS. The proposed protocol is shown to enhance throughput and delay through the simulation.


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.


2018 ◽  
Vol 4 (3) ◽  
pp. 189-199 ◽  
Author(s):  
S.K. Bhoi ◽  
P.M. Khilar ◽  
M. Singh ◽  
R.R. Sahoo ◽  
R.R. Swain

Sign in / Sign up

Export Citation Format

Share Document