Brief Announcement: K-Shot Distributed Broadcasting In Radio Networks
PODC(2010)
摘要
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 Omega(n(2)/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 <= root n.
更多查看译文
关键词
radio networks,broadcasting,k-shot,distributed algorithms
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要