Gossiping with bounded size messages in ad hoc radio networks (Extended abstract)
We study deterministic algorithms for the gossiping problem in ad hoc radio networks under the assumption that each combined message contains at most b(n) single messages or bits of auxiliary information, where b is an integer function and n is the number of nodes in the network. We term such a restricted gossiping problem b(n) -gossiping. We show that rootn-gossiping in an ad hoc radio network on