A graph structure approach to improving message dissemination in vehicular networks

2016 ◽  
Vol 23 (7) ◽  
pp. 2145-2163 ◽  
Author(s):  
Romeu Monteiro ◽  
Wantanee Viriyasitavat ◽  
Susana Sargento ◽  
Ozan K. Tonguz
Keyword(s):  
Vehicular Networks ◽  
Graph Structure ◽  
Structure Approach ◽  
Message Dissemination

Improving VANET Protocols using Graph Structure Approach

2018 ◽  
Vol 6 (6) ◽  
pp. 816-821
Author(s):  
Jagtar Singh ◽  
Sanjay Singla ◽  
Surender Jangra
Keyword(s):  
Graph Structure ◽  
Structure Approach

Reliable Emergency Message Dissemination Scheme for Urban Vehicular Networks

2020 ◽  
Vol 21 (3) ◽  
pp. 1154-1166 ◽  
Author(s):  
Wiem Benrhaiem ◽  
Abdelhakim Hafid ◽  
Pratap Kumar Sahu
Keyword(s):  
Vehicular Networks ◽  
Message Dissemination

Optimal RSUs placement with delay bounded message dissemination in vehicular networks

2016 ◽  
Vol 33 (4) ◽  
pp. 1276-1299 ◽  
Author(s):  
Chunyan Liu ◽  
Hejiao Huang ◽  
Hongwei Du ◽  
Xiaohua Jia
Keyword(s):  
Vehicular Networks ◽  
Message Dissemination

scholarly journals Evaluating the impact of a novel message dissemination scheme for vehicular networks using real maps

2012 ◽  
Vol 25 ◽  
pp. 61-80 ◽  
Author(s):  
Manuel Fogue ◽  
Piedad Garrido ◽  
Francisco J. Martinez ◽  
Juan-Carlos Cano ◽  
Carlos T. Calafate ◽  
...  
Keyword(s):  
Vehicular Networks ◽  
Message Dissemination ◽  
The Impact

scholarly journals Design and Analysis of a General Relay-Node Selection Mechanism on Intersection in Vehicular Networks

Sensors ◽  
2018 ◽  
Vol 18 (12) ◽  
pp. 4251 ◽  
Author(s):  
Dun Cao ◽  
Bin Zheng ◽  
Jin Wang ◽  
Baofeng Ji ◽  
Chunhai Feng
Keyword(s):  
Vehicular Networks ◽  
Prior Information ◽  
Heavy Traffic ◽  
Relay Node ◽  
Delivery Ratio ◽  
Node Selection ◽  
The Road ◽  
Message Dissemination ◽  
Relay Node Selection ◽  
Non Line Of Sight

Employment of a relay node can extend the coverage of a message in vehicular networks (VNET). In addition, the prior information regarding the road structure, which determines the structure of VNET, can benefit relay-node selection. However, the non-line-of-sight (NLOS) communication in the intersection scenarios and diverse shapes for the intersection hamper the design of a general relay-node selection on intersection. To resolve this problem, in this paper, we build a model to describe the general intersection, and propose a general relay-node selection method on intersection. Additionally, based on our mathematical description of the general intersection, the performance models for the general relay-node selection on the intersection are first explored in terms of message dissemination speed and Packet Delivery Ratio (PDR). The simulation results validate these models and indicate the improvement of our proposal, especially in heavy traffic. The improvement includes, at the high density of 3.0025 vehicles/m, the huge gain of up to 23.35% in terms of message dissemination speed than that of other compared methods and PDR of over 90%.

scholarly journals Distributed Algorithm for Constructing Efficient Tree Topology for Message Dissemination in Vehicular Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
S. Kamakshi ◽  
Sairam Natarajan
Keyword(s):  
Ad Hoc Network ◽  
Distributed Algorithm ◽  
Spanning Tree ◽  
Vehicular Networks ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Tree Topology ◽  
System Model ◽  
Traffic Information ◽  
Message Dissemination

Vehicular ad hoc network is an ad hoc network constituted among moving vehicles that have wireless dedicated short range communication (DSRC) devices in order to provide ubiquitous connectivity even if the road-side infrastructure is unavailable. Message dissemination in vehicular ad hoc networks is necessary for exchanging information about prevailing traffic information, so that the vehicles can take alternate routes to avoid traffic jam. A major challenge in broadcast protocols is that they result in flooding of messages that reduce the speed of dissemination due to collision. Dissemination of messages using tree topology reduces the number of rebroadcasts. Dynamicity Aware Graph Relabeling System model provides a framework to construct spanning tree in mobile wireless network. In this paper, we propose a new distributed algorithm for constructing an arbitrary spanning tree based on Dynamicity Aware Graph Relabeling System model, which develops a maximum leaf spanning tree in order to reduce the number of rebroadcasts and dissemination time. Our simulation results prove that the number of vehicles rebroadcasting the message is curtailed to 15% and the dissemination time required to achieve 100% reachability is curtailed by 10% under average vehicle density.

scholarly journals A Blockchain based Federated Learning for Message Dissemination in Vehicular Networks

2021 ◽  
pp. 1-1
Author(s):  
Ferheen Ayaz ◽  
Zhengguo Sheng ◽  
Daxin Tian ◽  
Yong LIANG Guan
Keyword(s):  
Vehicular Networks ◽  
Message Dissemination
Sign in / Sign up

Export Citation Format

Share Document