The IEEE Symposium on Computers and Communications 2010
DOI: 10.1109/iscc.2010.5546806
|View full text |Cite
|
Sign up to set email alerts
|

An optimal 1D vehicular accidentwarning algorithm for realistic scenarios

Abstract: Abstract-With the development of vehicular networks, it is possible to implement accident warning systems that directly (i.e., without any external supporting infrastructure) alert approaching vehicles. In this scenario, each vehicle is provided with a sensor that, under abnormal conditions, triggers an alarm message. A vehicle that receives this information: (a) warns the driver; and (b) relays such information to following vehicles for safety purposes. We here present an optimal algorithm for one dimensional… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
16
0

Year Published

2010
2010
2016
2016

Publication Types

Select...
3
3
1

Relationship

2
5

Authors

Journals

citations
Cited by 18 publications
(16 citation statements)
references
References 6 publications
0
16
0
Order By: Relevance
“…Again, to be concise we do not provide here additional details on this subject. The interested reader can refer to the following paper [8]. Rather, it is more interesting to report here that such kind of broadcast mechanism may be very effective in spreading traffic information at a high speed.…”
Section: Efficient Information Spreading: a Broadcast Approachmentioning
confidence: 94%
See 1 more Smart Citation
“…Again, to be concise we do not provide here additional details on this subject. The interested reader can refer to the following paper [8]. Rather, it is more interesting to report here that such kind of broadcast mechanism may be very effective in spreading traffic information at a high speed.…”
Section: Efficient Information Spreading: a Broadcast Approachmentioning
confidence: 94%
“…We also need a communication protocol that efficiently distributes traffic information throughout a platoon of vehicles in a realistic wireless propagation setting. An algorithm that fits such requirements exists and works as follows [8]. Traffic congestion alerts are broadcast throughout a vehicular network asking, at each hop, to the farthest spanning relay, the relay that can reach the farthest vehicle in a given direction, to retransmit it.…”
Section: Introductionmentioning
confidence: 99%
“…Under the same realistic assumptions, an additional method that effectively minimizes the number of hops has been proposed in [8]. To achieve such result, the latter scheme chooses as a relay, among all the vehicles that receive an alert message, the vehicle whose re-transmission will span farthest away in space (i.e., the farthest spanning relay).…”
Section: Challenges In Highway Scenariosmentioning
confidence: 99%
“…The purpose of this paper is the comparison of two among the most effective V2V algorithms that work under realistic assumptions [2,8].The first one adopts the strategy of propagating alert messages through the farthest relay, while the second chooses the farthest spanning relay. To clearly understand the performance differences, in terms of propagation delay, that these two choices entail, we compared both protocols under the same experimental conditions in wide set of simulations and different propagation scenarios.…”
Section: Introductionmentioning
confidence: 99%
“…For this reasons, many researchers are looking today for innovative solutions offering a carrier independent, locationbased, and cheaper than 3G data distribution. Different types of potential networking environments are investigated, including infrastructure connected networks like cellular networks, mesh networks, vehicular networks, and even entirely disconnected networks of stand-alone mobile devices [3]- [7].…”
Section: Introductionmentioning
confidence: 99%