2011 | OriginalPaper | Chapter
Brief Announcement: Faster Gossiping in Bidirectional Radio Networks with Large Labels
Author : Shailesh Vaya
Published in: Stabilization, Safety, and Security of Distributed Systems
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. 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.