Brief announcement: κ-shot distributed broadcasting in radio networks

Koutris, P; Pagourtzis, A

dc.contributor.author	Koutris, P	en
dc.contributor.author	Pagourtzis, A	en
dc.date.accessioned	2014-03-01T02:46:42Z
dc.date.available	2014-03-01T02:46:42Z
dc.date.issued	2010	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/32798
dc.subject	κ-shot	en
dc.subject	Broadcasting	en
dc.subject	Distributed algorithms	en
dc.subject	Radio networks	en
dc.subject.other	Broadcasting algorithm	en
dc.subject.other	Broadcasting protocols	en
dc.subject.other	Distributed algorithm	en
dc.subject.other	Lower bounds	en
dc.subject.other	Radio networks	en
dc.subject.other	Algorithms	en
dc.subject.other	Network protocols	en
dc.subject.other	Radio	en
dc.subject.other	Radio broadcasting	en
dc.title	Brief announcement: κ-shot distributed broadcasting in radio networks	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/1835698.1835717	en
heal.identifier.secondary	http://dx.doi.org/10.1145/1835698.1835717	en
heal.publicationDate	2010	en
heal.abstract	We study distributed broadcasting protocols with few trans- missions ('shots') in radio networks with unknown topology. In particular, we examine the case in which a bound κ is given and a node may transmit at most κ times during the broadcasting protocol. We focus on almost oblivious algo- rithms for κ-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/ κ) on the broadcasting time of any almost oblivious κ-shot broadcasting algorithm. We also present an almost oblivious protocol that matches the above lower bound for every κ ≤ √n.	en
heal.journalName	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing	en
dc.identifier.doi	10.1145/1835698.1835717	en
dc.identifier.spage	77	en
dc.identifier.epage	78	en