Topology-independent algorithms based on spanning trees

We consider a class of distributed algorithms. Algorithms in this class consist of processes that communicate using a broadcast. We show that local information suffices to implement such an algorithm on an arbitrary network. We investigate the time complexity and present some experimental results.