GOSSIPING ON A RING WITH RADIOS

Publisher Website
Google Scholar
Abstract
We study the problem of gossiping where n nodes equipped with radios are placed on a ring of circumference L. Each radio has a transmission range of 1 and we assume that simultaneous transmissions by neighboring nodes results in garbled messages. We present an algorithm for gossiping and show that it works in asymptotically optimal time.

This publication has 0 references indexed in Scilit: