Brief announcement: k-shot distributed broadcasting in radio networks

We study distributed broadcasting protocols with few transmissions ('shots') in radio networks with unknown topology. In particular, we examine the case in which a bound k is given and a node may transmit at most k times during the broadcasting protocol. We focus on almost oblivious algorithms for k-shot broadcasting, that is, algorithms where the nodes decide whether to transmit or not with very little consideration of the transmission history. In this context, we show a lower bound of Ω(n2/k) on the broadcasting time of any almost oblivious k-shot broadcasting algorithm. We also present an almost oblivious protocol that matches the above lower bound for every k≤√n.