Information gathering in ad-hoc radio networks

DOI10.1016/J.IC.2021.104769MaRDI QIDQ2051793zbMATH OpenOpenAlexFDO

Authors Marek Chrobak, Kevin P. Costello, Leszek Gąsieniec

Publication date 25 November 2021

Published in Information and Computation (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1909.03636

zbMATH Keywords

algorithmsinformation disseminationradio networks

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Information gathering in ad-hoc radio networks with tree topology
• Information gathering in ad-hoc radio networks with tree topology
• Efficient distributed communication in ad-hoc radio networks

Cites work

• A lower bound for radio broadcast
• A randomized algorithm for gossiping in radio networks
• Algorithm Theory - SWAT 2004
• An \Omega(D\log (N/D)) Lower Bound for Broadcast in Radio Networks
• An \(O(n^{1.5})\) deterministic gossiping algorithm for radio networks
• Broadcasting algorithms in radio networks with unknown topology
• Contention resolution in a non-synchronized multiple access channel
• Deterministic broadcasting in ad hoc radio networks
• Distributed broadcast in radio networks of unknown topology.
• Distributed broadcast in unknown radio networks
• Fast broadcasting and gossiping in radio networks
• Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel
• Faster Deterministic Broadcasting in Ad Hoc Radio Networks
• Faster deterministic communication in radio networks
• scientific article; zbMATH DE number 5764877 (Why is no real title available?)
• scientific article; zbMATH DE number 2089989 (Why is no real title available?)
• Information gathering in ad-hoc radio networks with tree topology
• Lower bounds for the broadcast problem in mobile radio networks
• On Efficient Gossiping in Radio Networks
• Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
• Time-Efficient Broadcasting in Radio Networks
• Unbounded contention resolution in multiple-access channels

Cited in

(5)

• Information gathering in ad-hoc radio networks with tree topology
• Information gathering in ad-hoc radio networks with tree topology
• Efficient distributed communication in ad-hoc radio networks
• GATHERING RADIO MESSAGES IN THE PATH
• Gathering information in a graph

This page was built for publication: Information gathering in ad-hoc radio networks

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