Gossiping in one-dimensional synchronous ad hoc wireless radio networks

TADDS, pp. 32-43, 2012.

Cited by: 0|Bibtex|Views1|Links
EI
Keywords:
time slotcertain network density assumptioncontinuous trajectorydeterministic algorithmtransmission radius rMore(6+)

Abstract:

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. W...More

Code:

Data:

Your rating :
0

 

Tags
Comments