Local Gossip and Neighbour Discovery in Mobile Ad Hoc Radio Networks

Abstract

We propose a new task called δ-local gossip, which can be viewed as a variant of both gossiping and geocasting. We motivate its study by showing how the tasks of discovering and maintaining neighbourhood information reduce to solving δ-local gossip. We then provide a deterministic algorithm that solves δ-local gossip when nodes travel on a line along arbitrary continuous trajectories with bounded speed.