Worst-case bounds for blind broadcasting in small-degree networks

Paper in proceeding, 2001

Blind broadcasting is the task of delivering a message from a source to all the n nodes in a network, where nodes are not aware of the network topology. We derive upper and lower bounds for the worst-case broadcast time, in terms of size n and depth d of the network (i.e. eccentricity of the source). Provided that the degree of nodes is bounded by a small constant, these results improve upon the general upper bound of 2n-d. For degree up to 5 we get tight bounds.