Gossiping on Interval Graphs

Abstract

We present an algorithm that produces a schedule of transmissions to achieve gossiping in a system where nodes are equipped with radio transceivers; diierent nodes have transceivers with diierent ranges. We assume that all the nodes are placed on a line and that all communication occurs in one dimension. Finally, unlike traditional system models for gossiping, we assume that all nodes within range can hear a transmission and that simultaneous transmissions may cause information loss via collisions. The gossiping algorithm we develop decomposes a system connguration into a spine tree and uses this structure to recursively produce a transmission schedule. We illustrate this process via an extensive example.

DOI: 10.1109/IPPS.1993.262902

Extracted Key Phrases

1 Figure or Table

Cite this paper

@inproceedings{Singh1993GossipingOI, title={Gossiping on Interval Graphs}, author={Suresh Singh and M. A. Sridhar}, booktitle={IPPS}, year={1993} }