Gossiping with interference in radio ring networks

DOI10.46298/DMTCS.9399MaRDI QIDQ6599790zbMATH OpenFDO

Authors Jean-Claude Bermond, T. Kodate, Joseph Yu

Publication date 6 September 2024

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Full work available at URL https://doi.org/10.46298/DMTCS.9399

zbMATH Keywords

gossipinginterferenceradio networksring networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On Efficient Gossiping in Radio Networks
• Asymptotically optimal gossiping in radio networks
• Fast gossiping by short messages
• Odd gossiping
• Fast Gossiping by Short Messages

Cites work

• Data gathering in wireless networks
• Fast Gossiping by Short Messages
• On Efficient Gossiping in Radio Networks
• On the complexity of bandwidth allocation in radio networks
• Optimal gathering protocols on paths under interference constraints

This page was built for publication: Gossiping with interference in radio ring networks

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