Gossiping on interval graphs (computer networks)

Abstract

The authors present an algorithm that produces a schedule of transmissions to achieve gossiping in a system where nodes are equipped with radio transceivers; different nodes have transceivers with different ranges. They 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, they assume that all nodes within range can hear a transmission and that simultaneous transmissions may cause information loss via collisions. The gossiping algorithm developed decomposes a system configuration into a spine tree and uses this structure to recursively produce a transmission schedule.<>