A modified gossip algorithm for clustered ad hoc networks

Abstract

Gossip based algorithms, which constitute an important group among many other techniques for broadcasting in ad hoc networks, are inefficient on clustered networks. There is a trade off between the total load on the network and guaranteed delivery on the cluster connecting nodes. This paper introduces a modified gossip algorithm for broadcasting in clustered ad hoc networks. Additionally, a novel graph generation method for creating clustered networks is proposed for the simulations.