Broadcast and gossiping algorithms for mobile ad hoc networks based on breadth-first traversal

Abstract

We present a deterministic broadcast algorithm for the class of mobile ad hoc networks where the mobile nodes possess collision detection capabilities. The algorithm is based on a breadth-first traversal of the network, allows multiple transmissions in the same time slot and completes broadcast in O(n log n) time in the worst case. It is mobility resilient even for networks where topology changes are very frequent. The idea of this broadcast algorithm is then extended to develop a gossiping algorithm having O((n + D)D log n) worst case run time, where D is the diameter of the network graph, which is an improvement over the existing algorithms. © Springer-Verlag Berlin Heidelberg 2004.