Distributed broadcast in radio networks of unknown topology

Abstract

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 (created by a fixed source node) to all nodes of the network. Typical operations in real-life radio networks is the multi-broadcast that consists in performing a set of r independent broadcasts. The study of broadcast operations on unknown radio network is started by the seminal paper of Bar-Yehuda et al. [J. Comput. System Sci. 45 (1992) 104] and has been the subject of several recent works. In this paper, we study the completion and the termination time of distributed protocols for both the (single) broadcast and the multi-broadcast operations on unknown networks as functions of the number of nodes n, the maximum eccentricity D, the maximum in-degree Delta, and the congestion c of the networks. We establish new connections between these operations and some combinatorial concepts, such as selective families, strongly selective families (also known as superimposed codes), and pairwise r-different families. Such connections, combined with a set of new lower and upper bounds on the size of the above families, allow us to derive new lower bounds and new distributed protocols for the broadcast and multi-broadcast operations. In particular, our upper bounds are almost tight and strongly improve over the previous bounds for a large class of networks. (C) 2002 Elsevier Science B.V. All rights reserved

Faster Information Gathering in Ad-Hoc Radio Tree Networks

“…Following a sequence of papers [6,18,2,3,21,11] where this naïve bound was gradually improved, it is now known that broadcasting can be solved in time O(n log D log log(D∆/n)) [10], where D is the diameter of G and ∆ is its maximum in-degree. This nearly matches the lower bound of Ω(n log D) from [9]. Randomized algorithms for broadcasting have also been well studied [1,19,11].…”

Grouping of RFID Tags via Strongly Selective Families

“…PROPOSED SCHEME This section first presents the background of SSFs [5], and then applies SSFs to the design of grouping of RFID tags. In what follows, let [n] be the universe.…”

Group Testing and Batch Verification

“…Cover-free families are also studied under the terms disjunct matrices [16], binary superimposed codes [23], and strongly selective families [12]. Stinson et al [37] discusses relations between these structures.…”

“…A recent paper of Porat and Rothschild [31] explicitly constructs (n, d)-strongly selective families from error correcting codes. This structure is equivalent to a (d − 1)-CFF(t, n) (see [12]), and hence it gives a nonadaptive ISF.…”