Broadcasting algorithms in radio networks with unknown topology

Document Type

Conference Proceeding

Publication Date

1-1-2003

Abstract

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-node radio networks with specified eccentricity D (maximum distance from the source node to any other node). Our first main result closes the gap between the lower and upper bound: we describe an optimal randomized broadcasting algorithm whose running time complexity is O(D log(n/D) + log2 n), with high probability. In particular, we obtain a randomized algorithm that completes broadcasting in any n-node radio network in time O(n), with high probability. The main source of our improvement is a better "selecting sequence" used by the algorithm that brings some stronger property and improves the broadcasting time. Next, we demonstrate how to apply our approach to deterministic broadcasting, and describe a deterministic oblivious algorithm that completes broadcasting in almost optimal time O(n log2 D). Finally, we show how our randomized broadcasting algorithm can be used to improve the randomized complexity of the gossiping problem.

Identifier

74549168274 (Scopus)

ISBN

[0769520405]

Publication Title

Proceedings Annual IEEE Symposium on Foundations of Computer Science Focs

External Full Text Location

https://doi.org/10.1109/SFCS.2003.1238222

ISSN

02725428

First Page

492

Last Page

501

Volume

2003-January

Grant

CCR-0105701

This document is currently not available here.

Share

COinS