Oblivious gossiping in ad-hoc radio networks

Chlebus, B; Gąsieniec, L; Lingas, A; Pagourtzis, A

dc.contributor.author	Chlebus, B	en
dc.contributor.author	Gąsieniec, L	en
dc.contributor.author	Lingas, A	en
dc.contributor.author	Pagourtzis, A	en
dc.date.accessioned	2014-03-01T02:49:04Z
dc.date.available	2014-03-01T02:49:04Z
dc.date.issued	2001	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34285
dc.subject	Asymptotic Optimality	en
dc.subject	Radio Networks	en
dc.subject	Randomized Algorithm	en
dc.subject	Upper Bound	en
dc.title	Oblivious gossiping in ad-hoc radio networks	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/381448.381454	en
heal.identifier.secondary	http://dx.doi.org/10.1145/381448.381454	en
heal.publicationDate	2001	en
heal.abstract	We study oblivious deterministic and randomized algorithms for gossiping in unknown radio networks. In oblivious algorithms the fact (or probability in case of randomized algorithm) that a processor transmits or not at a given time-step depends solely on its identification number, the total number of processors and the number of the time-step. We distinguish oblivious deterministic algorithms which allow only	en
heal.journalName	Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications	en
dc.identifier.doi	10.1145/381448.381454	en