Communication in dynamic radio networks

DOI10.1145/1281100.1281131zbMATH Open1283.68052OpenAlexW2156294712WikidataQ58219165 ScholiaQ58219165MaRDI QIDQ5401413FDOQ5401413

Authors: Francesco Pasquale, Angelo Monti, Andrea Clementi, Riccardo Silvestri 

Publication date: 13 March 2014

Published in: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1281100.1281131

Recommendations

• Broadcasting in dynamic radio networks
• The cost of global broadcast in dynamic radio networks
• Radio communication in random graphs
• Broadcasting in undirected ad hoc radio networks
• Broadcasting in undirected ad hoc radio networks

zbMATH Keywords

randomized algorithmsradio networks

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Network design and communication in computer systems (68M10) Network protocols (68M12)

Cited In (18)

• GATHERING RADIO MESSAGES IN THE PATH
• On selection problem in radio networks
• Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards
• Brief announcement: Data dissemination in unified dynamic wireless networks
• The cost of global broadcast in dynamic radio networks
• Cover time in edge-uniform stochastically-evolving graphs
• Upper and lower bounds for the synchronizer performance in systems with probabilistic message loss
• Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
• Fault-tolerant aggregation: flow-updating meets mass-distribution
• Information spreading in dynamic networks: an analytical approach
• Broadcasting in dynamic radio networks
• Information spreading in dynamic networks under oblivious adversaries
• An introduction to temporal graphs: an algorithmic perspective
• An introduction to temporal graphs: an algorithmic perspective
• The impact of mobility on the geocasting problem in mobile ad-hoc networks: solvability and cost
• Some lower bounds in dynamic networks with oblivious adversaries
• Braid Chain Radio Communication
• The slide mechanism with applications in dynamic networks (extended abstract)

This page was built for publication: Communication in dynamic radio networks

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