This paper presents a new protocol for atomic broadcast in an asynchronous network with a maximal number of Byzantine failures. It guarantees both safety and liveness without making any timing assumptions or using any type of “failure detector.” Under normal circumstances, the protocol runs in an “optimistic mode,” with extremely low message and computational complexity — essentially, just perf...

The Optimised Link State Routing (OLSR) is a proactive routing protocol which relies on periodical broadcast of routing packets. However, due to the one-to-many relationship of broadcast traffic, the delivery of these packets can not be guaranteed by underlying MAC protocol, particularly in a congested condition. In this paper, the possible routing pathologies and failures of OLSR in a congeste...

Mobile wireless ad-hoc networks lack some basic abilities taken for granted in wired networks, such as the ability to know adjacent nodes. We present a neighbor discovery protocol, with particular application to broadcast flooding. The Neighbor Exchange Protocol (NXP) has two main improvements over simple periodic broadcast schemes: (1) it only sends Hello packets when necessary to maintain top...

This paper discusses how to provide selective group communication for multiple entities in a distributed system by using less-reliable broadcast communication services. In the group communication, a protocol data unit (PDU) sent by each entity has to be delivered atomically to all the destinations in the group. In distributed applications, each entity sends a PDU only to a subset rather than al...

An important question in multi-radio multi-channel and multi-hop networks is how to perform efficient network-wide broadcast. Currently almost all broadcasting protocols assume a single-radio single-channel network model. Simply using them in multi-channel environment without careful enhancement will result in unnecessary redundancy. In this paper, we focus on reducing the amount of redundant t...

Because network-level reliable group communication protocols rely on IP multicast and have lack of reliability, this motivates the demand on application-level group communication. Epidemic-style protocols among these application-level approaches guarantee reasonably high reliability, provide good scalability and are easy to deploy. But, earlier versions of these protocols often rely on the assu...

Vehicular ad hoc networks have been attracting the interest of both academic and industrial communities on account of their potential role in Intelligent Transportation Systems (ITS). However, due to vehicle movement and fading in wireless communications, providing a reliable and efficient multi-hop broadcast service in vehicular ad hoc networks is still an open research topic. In this paper, w...

We present three voting protocols with unconditional privacy and correctness, without assuming any bound on the number of corrupt participants. All protocols have polynomial complexity and require private channels and a simultaneous broadcast channel. Unlike previously proposed protocols in this model, the protocols that we present deterministically output the exact tally. Our first protocol is...

Title of dissertation: STUDIES ON FAULT-TOLERANT BROADCAST AND SECURE COMPUTATION Chiu Yuen Koo Doctor of Philosophy, 2007 Dissertation directed by: Professor Jonathan Katz Department of Computer Science In this dissertation, we consider the design of broadcast and secure multi-party computation (MPC) protocols in the presence of adversarial faults. Secure multi-party computation is the most ge...

Title of dissertation: STUDIES ON FAULT-TOLERANT BROADCAST AND SECURE COMPUTATION Chiu Yuen Koo Doctor of Philosophy, 2007 Dissertation directed by: Professor Jonathan Katz Department of Computer Science In this dissertation, we consider the design of broadcast and secure multi-party computation (MPC) protocols in the presence of adversarial faults. Secure multi-party computation is the most ge...