In much of the theoretical literature on wireless algorithms, issues of message dissemination
are considered together with issues of contention management. This combination leads to …

A diversity of possible communication assumptions complicates the study of algorithms and
lower bounds for radio networks. We address this problem by defining an abstract MAC …

In a multiple-message broadcast, an arbitrary number of messages originate at arbitrary
nodes in the network at arbitrary times. The problem is to disseminate all these messages to …

We study the multi-message broadcast problem using abstract MAC layer models of
wireless networks. These models capture the key guarantees of existing MAC layers while …

This paper revisits the classical problem of multi-message broadcast: given an undirected
network G, the objective is to deliver k messages, initially placed arbitrarily in G, to all nodes …

Multiple-message broadcast is a generalization of the traditional broadcast problem. It is to
disseminate k distinct (1≤ k≤ n) messages stored at k arbitrary nodes to the entire network …

The local broadcast problem assumes that processes in a wireless network are provided
messages, one by one, that must be delivered to their neighbors. In this paper, we prove …

In this paper, we study the atomic broadcast and multicast problems, two fundamental
abstractions for building fault-tolerant systems. As opposed to atomic broadcast, atomic …

We give a lower bound of $\Omega (n) $ rounds for broadcasting in a mobile ad hoc
network, where $ n $ is the number of nodes in the network. A round is the time taken by a …

Multiple-message broadcast, or k-broadcast, is one of the fundamental problems in network
communication. In short, there are k packets distributed across the network, each of them …