Broadcasting algorithms in radio networks with unknown topology

Document Type

Conference Proceeding

Publication Date

12-2-2003

Abstract

New randomized and deterministic algorithms for the classical problem of broadcasting in radio networks with unknown topology are presented. As such, directed n-node radio networks with specified eccentricity D are considered. In particular, the results showed that a randomized algorithm that completes broadcasting in any n-node radio network in time O(n), with high probability.

Identifier

0344981446 (Scopus)

Publication Title

Annual Symposium on Foundations of Computer Science Proceedings

ISSN

02725428

First Page

492

Last Page

501

This document is currently not available here.

Share

COinS