Efficient Probabilistic Information Broadcast Algorithm over Random Geometric Topologies

This paper studies reliability of probabilistic gossip algorithms over the random geometric topologies which model ad hoc networks. We propose an efficient algorithm that ensures higher reliability at lower message complexity than the three families of gossip algorithms. Such an improvement is reasonably estimated by our reliability model. The results obtained by OMNET++ simulator confirm the prediction that our algorithm is the best choice for random geometric networks.