Gossiping in one-dimensional synchronous ad hoc wireless radio networks
Avery Miller · 2012
Consider a set of n processors traveling with bounded speed along continuous trajectories on a line and suppose that each processor must share a piece of information with all other processors in the set. This is known as the gossiping task. Each processor has a radio transmitter with transmission radius R and interference radius R' ≥ R. We present a deterministic algorithm for the gossiping task, under certain network density assumptions, that is provably correct and terminates within O(n) time slots.