A reliable membership service for vehicular safety applications

Slot, Marco; Cahill, Vinny

doi:10.1109/ivs.2011.5940487

Cited by 6 publications

(9 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are several other approaches for group membership in vehicular environments including the proposal by Slot and Cahill [21]. They take a hardware-based approach in which laser-scanners provide the vehicle with information about empty areas around it.…”

Section: Related Workmentioning

confidence: 99%

Specification, Implementation and Verification of Dynamic Group Membership for Vehicle Coordination

Asplund

Lövhall

Villani

2017

2017 IEEE 22nd Pacific Rim International Symposium on Dependable Computing (PRDC)

View full text Add to dashboard Cite

Abstract-New advanced traffic management solutions with fully or semi-autonomous vehicles that communicate over a wireless interface to coordinate their driving decisions create new challenges in distributed computing. In this paper we address the problem of dynamic group membership in three stages. First, we propose three criteria to specify correctness and performance of the group views created by such algorithms in terms of soundness, completeness and freshness. Second, we develop a group membership protocol tailored for vehicular coordination. Finally, we show through simulation and model-based verification that the protocol does indeed meet the criteria and provide at least 95% perfect group membership views under as adverse conditions as 70% packet loss or very high churn rate.

show abstract

Section: Related Workmentioning

confidence: 99%

Specification, Implementation and Verification of Dynamic Group Membership for Vehicle Coordination

Asplund

Lövhall

Villani

2017

2017 IEEE 22nd Pacific Rim International Symposium on Dependable Computing (PRDC)

View full text Add to dashboard Cite

show abstract

“…A description of the implementation details of the distributed approach are beyond the scope of this paper. See [19] and [20] for details on vehicular group communication and vehicular coordination respectively.…”

Section: B Inter-vehicle Cooperationmentioning

confidence: 99%

On-ramp traffic merging using cooperative intelligent vehicles: A slot-based approach

Marinescu

Čurn

Bouroche

et al. 2012

2012 15th International IEEE Conference on Intelligent Transportation Systems

Self Cite

103

View full text Add to dashboard Cite

The merging of main road and on-ramp traffic is known to lead to congestion under heavy traffic conditions. This is mainly due to the underutilization of the road infrastructure and the lack of efficiency in the way the in which the merging manoeuvre is performed by human drivers. We propose a merging algorithm based on our previous work on slot-based driving which employs cooperation between vehicles within the main motorway as well as between motorway and onramp vehicles to achieve a highly efficient merging. The results of the evaluation show that our algorithm achieves a very high throughput and low delay on the on-ramp and clearly outperforms the merging performed by VISSIM's human driver model.

show abstract

“…The membership information allows an entity to decide whether a message it has sent has reached all other entities in the area. While solving the membership problem using purely communication is recognised as a difficult problem [6], it can be solved in the vehicular domain with the aid of ranging sensors as shown by Slot and Cahill [23].…”

Section: Communicationmentioning

confidence: 99%

A Formal Approach to Autonomous Vehicle Coordination

Asplund

Manzoor

Bouroche

et al. 2012

FM 2012: Formal Methods

Self Cite

View full text Add to dashboard Cite

Abstract. Increasing demands on safety and energy efficiency will require higher levels of automation in transportation systems. This involves dealing with safety-critical distributed coordination. In this paper we demonstrate how a Satisfiability Modulo Theories (SMT) solver can be used to prove correctness of a vehicular coordination problem. We formalise a recent distributed coordination protocol and validate our approach using an intersection collision avoidance (ICA) case study. The system model captures continuous time and space, and an unbounded number of vehicles and messages. The safety of the case study is automatically verified using the Z3 theorem prover.

show abstract

A reliable membership service for vehicular safety applications

Cited by 6 publications

References 26 publications

Specification, Implementation and Verification of Dynamic Group Membership for Vehicle Coordination

Specification, Implementation and Verification of Dynamic Group Membership for Vehicle Coordination

On-ramp traffic merging using cooperative intelligent vehicles: A slot-based approach

A Formal Approach to Autonomous Vehicle Coordination

Contact Info

Product

Resources

About