We establish an O (nlog2n) upper bound on the time for deterministic distributed
broadcasting in multi-hop radio networks with unknown topology. This nearly matches the …

We consider the problem of distributed deterministic broadcasting in radio networks of
unknown topology and size. The network is synchronous. If a node u can be reached from …

In this paper we present new randomized and deterministic algorithms for the classical
problem of broadcasting in radio networks with unknown topology. We consider directed n …

Selective families, a weaker variant of superimposed codes [KS64, F92, 197, CR96], have
been recently used to design Deterministic Distributed Broadcast (DDB) protocols for …

We consider distributed broadcasting in radio networks, modeled as undirected graphs,
whose nodes have no information on the topology of the network, nor even on their …

Broadcasting is a basic network communication task, where a message initially held by a
source node has to be disseminated to all other nodes in the network. Fast algorithms for …

A multi-hop synchronous radio network is said to be unknown if the nodes have no
knowledge of the topology. A basic task in radio network is that of broadcasting a message …

We show that for any radio network there exists a schedule of a broadcast whose time is O
(D+ log5n), where D is the diameter and n is the number of nodes.(This result implies an …

We study the distributed complexity of computing a maximal independent set (MIS) in radio
networks with completely unknown topology, asynchronous wake-up, and no collision …

In the long-studied problem of combinatorial group testing, one is asked to detect a set of k
defective items out of a population of size n, using m≪ n disjunctive measurements. In the …