Deterministic broadcasting time with partial knowledge of the network

  • Authors:

  • Gianluca De Marco;Andrzej Pelc

  • Affiliations:

  • Istituto per le Applicazioni Telematiche, Consiglio Nazionale delle Ricerche, 56124 Pisa, Italy;Départment d'Informatique, Université du Québec à Hull, C.P. 1250, Succ. B, Hull, Qué, Canada J8X 3X7

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2003

Quantified Score

Hi-index 5.23

Visualization

Abstract

We consider the time of deterministic broadcasting in networks whose nodes have limited knowledge of network topology. Each node υ knows only the part of the network within knowledge radius r from it, i.e., it knows the graph induced by all nodes at distance at most r from υ. Apart from that, each node knows the maximum degree Δ of the network. One node of the network, called the source, has a message which has to reach all other nodes. We adopt the widely studied communication model called the one-way model in which, in every round, each node can communicate with at most one neighbor, and in each pair of nodes communicating in a given round, one can only send a message while the other can only receive it. This is the weakest of all store-and-forward models for point-to-point networks, and hence our algorithms work for other models as well, in at most the same time.We show trade-offs between knowledge radius and time of deterministic broadcasting, when the knowledge radius is small, i.e., when nodes are only aware of their close vicinity. While for knowledge radius 0, minimum broadcasting time is Θ(e), where e is the number of edges in the network, broadcasting can be usually completed faster for positive knowledge radius. Our main results concern knowledge radius 1. We develop fast broadcasting algorithms and analyze their execution time. We also prove lower bounds on broadcasting time, showing that our algorithms are close to optimal.