Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Reaching Reliable and Trustworthy Agreement in a Multiple Damage Vehicular Ad Hoc Network

Version 1 : Received: 22 January 2018 / Approved: 22 January 2018 / Online: 22 January 2018 (13:53:58 CET)

How to cite: Wang, S.; Lin, Y.; Tsai, Y.; Yan, K. Reaching Reliable and Trustworthy Agreement in a Multiple Damage Vehicular Ad Hoc Network. Preprints 2018, 2018010203. https://doi.org/10.20944/preprints201801.0203.v1 Wang, S.; Lin, Y.; Tsai, Y.; Yan, K. Reaching Reliable and Trustworthy Agreement in a Multiple Damage Vehicular Ad Hoc Network. Preprints 2018, 2018010203. https://doi.org/10.20944/preprints201801.0203.v1

Abstract

The era of Internet of Things (IoT) has begun to evolve and with this the devices around us are getting more and more connected. Vehicular Ad-hoc NETworks (VANETs) is one of the applications of IoT. VANET allow vehicles within these networks to communicate effectively with each another. VANETs can provide an extensive range of applications that support and enhance passenger safety and comfort. It is important that VANETs are applied within a safe and reliable network topology; however, the challenging nature of reaching reliable and trustworthy agreement in such distributed systems is one of the most important issues in designing a fault-tolerant system. Therefore, protocols are required so that systems can still be correctly executed, reaching agreement on the same values in a distributed system, even if certain components in the system fail. In this study, the agreement problem is revisited in a VANET with multiple damages. The proposed protocol allows all fault-free nodes (vehicles) to reach agreement with minimal rounds of message exchanges, and tolerates the maximal number of allowable faulty components in the VANET.

Keywords

Internet of Things; greement; Intelligent Transportation Systems

Subject

Engineering, Control and Systems Engineering

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.