2011 | OriginalPaper | Buchkapitel
Brief Announcement: Faster Gossiping in Bidirectional Radio Networks with Large Labels
verfasst von : Shailesh Vaya
Erschienen in: Stabilization, Safety, and Security of Distributed Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We study the problem of deterministic gossiping in unknown ad-hoc bidirectional radio networks, when nodes can have polynomially large labels. We present a deterministic protocol which takes
$O(n \lg^2 n \lg \lg n)$
rounds, improving upon the previous best result for the problem by Gasienec, Potapov, Pagourtizis [
Deterministic Gossiping in Radio Networks with Large labels
, Algorithmica 47(1) (2007), pp 97-117], by a
$O(\lg n)$
factor.