Broadcast protocols play a vital role in building services and applications for multihop, mobile, wireless ad hoc networks (MANET). This paper describes the design, implementation and evaluation of a new broadcast protocol for a multihop, mobile wireless ad hoc network that provides significantly better performance than the currently existing protocols. In particular, this protocol provides low...

This paper presents a low overhead, high performance cache coherence protocol designed to exploit high bandwidth point-to-point and broadcast features of optics. SPEED integrates the virtues of snoopy-based schemes and directory-based schemes into one eecient protocol. Directory-assist is used exclusively for read traac to eliminate unnecessary broadcasts while snoopy-assist is used exclusively...

A new deterministic broadcast protocol for an ad hoc network is proposed in this paper which avoids re-computation of the transmission schedule, even when the topology of the network changes due to the mobility of the nodes. The basic idea is to use a successive partitioning scheme by representing the identifier of each node (an integer) in an arbitrarily chosen radix system; the protocol then ...

The classical results in unconditional multi-party computation among a set of n players state that less than n=2 passive or less than n=3 active adversaries can be tolerated; assuming a broadcast channel the threshold for active adversaries is n=2. Strictly generalizing these results we specify the set of potentially misbehaving players as an arbitrary set of subsets of the player set. We prove...

We consider a system with n processes where some of them can show a byzantine behavior. A byzantine process can deviate arbitrarily from the protocol, e.g., dropping messages, changing the content of a message (different recipients may receive different content of the same broadcast message), delivering messages not sent by any process or creating fake messages. This paper introduces a new broa...

Given a public-key infrastructure (PKI) and digital signatures, it is possible to construct broadcast protocols tolerating any number of corrupted parties. Almost all existing protocols, however, do not distinguish between corrupted parties (who do not follow the protocol), and honest parties whose secret (signing) keys have been compromised (but who continue to behave honestly). We explore con...

Self-organized collaborative applications in terrains with no infrastructure support for untethered communication are long known to be feasible only with the mobile ad-hoc networking (MANET) technology. Supporting collaboration however requires a solution to the consensus problem, using which collaborating users with different initial opinions can decide identically. Efficient consensus solutio...

The coherence protocol is a first-order design concern in multicore designs. Directory protocols are naturally scalable, as they place no restrictions on the interconnect and have minimal bandwidth requirements; however, this scalability comes at the cost of increased sharing latency due to indirection. In contrast, broadcast-based systems such as snooping protocols and token coherence reduce l...

Atomic Broadcast is a fundamental problem of distributed systems: It states that messages must be delivered in the same order to their destination processes. This paper describes a solution to this problem in asynchronous distributed systems in which processes can crash and recover. A Consensus-based solution to Atomic Broadcast problem has been designed by Chandra and Toueg for asynchronous di...

The time-complexity of deterministic and randomized protocols for achieving broadcast (distributing a message from a source to all other nodes) in arbitrary multi-hop radio networks is investigated. In many such networks, communication takes place in synchronous time-slots. A processor receives a message at a certain time-slot if exactly one if its neighbors transmits at that time-slot. We assu...