### Skapa referens, olika format (klipp och klistra)

**Harvard**

Asl, N. (2017) *On the Design and Analysis of Consensus Protocols for Vehicular Ad Hoc Networks*. Gothenburg : Chalmers University of Technology (Doktorsavhandlingar vid Chalmers tekniska högskola. Ny serie, nr: 4300).

** BibTeX **

@book{

Asl2017,

author={Asl, Negin Fathollah Nejad},

title={On the Design and Analysis of Consensus Protocols for Vehicular Ad Hoc Networks},

isbn={978-91-7597-619-8},

abstract={Vehicle-to-vehicle communication technologies support diverse cooperative applications for intelligent transportation systems to increase safety and fuel efficiency of road vehicles. Vehicles participating in a cooperative pplication are expected to make coordinated and mutually consistent decisions. To ensure consistency, it is often essential that the participating vehicles reach agreement on the data they use as a basis for these decisions. This thesis deals with the fundamental problem of reaching agreement on a value, or a set of values, in a distributed system<br />in the presence of unrestricted communication failures. It is known from the literature that this problem is impossible to solve perfectly, i.e., no matter what algorithm we use there is always a non-zero probability of disagreement. Hence, our aim is to design algorithms that minimize the probability of disagreement. We propose and analyse several agreement algorithms to solve three fundamental consensus problems. These algorithms are distinguished by their decision criterion, which determine whether a computer should decide on a value or decide to abort. Our analyses show that the probability of disagreement depends strongly on the number of computers in the system, the number of rounds of message exchange, the choice of decision criterion, as well as the probability of message loss. We identify two types of disagreement, safe and unsafe disagreement, and show that unsafe disagreement can be avoided if all computers know the number of computers in the system.},

publisher={Institutionen för data- och informationsteknik, Datorteknik (Chalmers), Chalmers tekniska högskola,},

place={Gothenburg},

year={2017},

series={Doktorsavhandlingar vid Chalmers tekniska högskola. Ny serie, no: 4300},

keywords={Intelligent Transportation Systems, Consensus, Agreement Algorithms, Probabilistic Analysis, Communication Failure, Vehicular Ad-Hoc Networks},

}

** RefWorks **

RT Dissertation/Thesis

SR Electronic

ID 251334

A1 Asl, Negin Fathollah Nejad

T1 On the Design and Analysis of Consensus Protocols for Vehicular Ad Hoc Networks

YR 2017

SN 978-91-7597-619-8

AB Vehicle-to-vehicle communication technologies support diverse cooperative applications for intelligent transportation systems to increase safety and fuel efficiency of road vehicles. Vehicles participating in a cooperative pplication are expected to make coordinated and mutually consistent decisions. To ensure consistency, it is often essential that the participating vehicles reach agreement on the data they use as a basis for these decisions. This thesis deals with the fundamental problem of reaching agreement on a value, or a set of values, in a distributed system<br />in the presence of unrestricted communication failures. It is known from the literature that this problem is impossible to solve perfectly, i.e., no matter what algorithm we use there is always a non-zero probability of disagreement. Hence, our aim is to design algorithms that minimize the probability of disagreement. We propose and analyse several agreement algorithms to solve three fundamental consensus problems. These algorithms are distinguished by their decision criterion, which determine whether a computer should decide on a value or decide to abort. Our analyses show that the probability of disagreement depends strongly on the number of computers in the system, the number of rounds of message exchange, the choice of decision criterion, as well as the probability of message loss. We identify two types of disagreement, safe and unsafe disagreement, and show that unsafe disagreement can be avoided if all computers know the number of computers in the system.

PB Institutionen för data- och informationsteknik, Datorteknik (Chalmers), Chalmers tekniska högskola,

T3 Doktorsavhandlingar vid Chalmers tekniska högskola. Ny serie, no: 4300

LA eng

LK http://publications.lib.chalmers.se/records/fulltext/251334/251334.pdf

OL 30