Name
Abstract | ||
|---|---|---|
The merging of two lanes is a common traffic scenario. In this paper we derive a formal model for the behavior of vehicles in this scenario. We discuss the question of how fairness of a merging process can be defined and introduce the notion of free-flow fairness. We first show how optimal fairness could be achieved if all vehicles were omniscient and willing to follow a given strategy. We then move to a more realistic setting, where only a subset of vehicles participates in our merging scheme and where wireless communication is limited and unreliable. By means of analysis and simulation we show that a simple beacon-based approach yields very good fairness even if only 1% of the vehicles participate. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.vehcom.2014.05.005 | Vehicular Communications |
Keywords | Field | DocType |
Vehicular ad hoc networks,Intelligent transportation systems,Cooperative systems,Fairness | Max-min fairness,Wireless,Traffic flow,Computer science,Computer network,Formal description,Distributed algorithm,Fairness measure,Intelligent transportation system,Merge (version control) | Journal |
Volume | Issue | ISSN |
1 | 2 | 2214-2096 |
Citations | PageRank | References |
4 | 0.50 | 19 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel Baselt | 1 | 46 | 3.63 |
| Florian Knorr | 2 | 40 | 2.37 |
| Björn Scheuermann | 3 | 849 | 71.55 |
| Michael Schreckenberg | 4 | 170 | 34.25 |
| Martin Mauve | 5 | 1840 | 153.45 |