Average-Time Complexity of Gossiping in Radio Networks

DOI10.1007/11780823_20MaRDI QIDQ3613656zbMATH OpenOpenAlexFDO

Authors Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki

Publication date 12 March 2009

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11780823_20

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Structural Information and Communication Complexity
• Time efficient centralized gossiping in radio networks
• Efficient distributed communication in ad-hoc radio networks
• An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
• Faster deterministic communication in radio networks

Cited in

(5)

• Energy efficient randomised communication in unknown AdHoc networks
• Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks
• On Efficient Gossiping in Radio Networks
• Many-to-many communication in radio networks
• Deterministic multi-channel information exchange

This page was built for publication: Average-Time Complexity of Gossiping in Radio Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3613656)