We study distributed broadcasting protocols with few transmissions (‘shots’) in radio networks of 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 oblivious algorithms, that is, algorithms where each node decides whether to transmit or not with no consideration of the transmission history. Our main contributions are (a) a lower bound of Ω(n2 ) on the broadcasting time of any oblivious k-shot broadcasting algorithm and (b) an oblivious broadcasting protocol that achieves a matching upper bound, namely
O(n2 ), for every k ≤ √n and an upper bound of k√
O(n3/2) for every k > n. We also initiate the study of the behavior of general broadcasting protocols by showing an Ω(n2) lower bound for any adaptive 1-shot broadcasting protocol.
Cite as: Koutris, P. and Pagourtzis, A. (2011). Oblivious k-shot Broadcasting in Ad Hoc Radio Networks. In Proc. Computing: The Australasian Theory Symposium (CATS 2011) Perth, Australia. CRPIT, 119. Alex Potanin and Taso Viglas Eds., ACS. 161-168
(from crpit.com)
(local if available)