Network wide broadcasting is a fundamental operation in ad hoc networks. In broadcasting,
a source node end a message to all the other nodes in the network. In this paper, we …

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 …

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 …

Given a finite set S of points (ie the stations of a radio network) on ad-dimensional Euclidean
space and a positive integer 1≤ h≤| S|− 1, the MIN DDH-RANGE ASSIGNMENT problem …

We consider the problem of computing a maximal independent set (MIS) in an extremely
harsh broadcast model that relies only on carrier sensing. The model consists of an …

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 …