Communication in dynamic radio networks

DOI10.1145/1281100.1281131zbMath1283.68052OpenAlexW2156294712WikidataQ58219165 ScholiaQ58219165MaRDI QIDQ5401413

Francesco Pasquale, Angelo Monti, Riccardo Silvestri, Andrea E. F. Clementi

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

zbMATH Keywords

randomized algorithmsradio networks

Mathematics Subject Classification ID

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

Related Items (8)

An Introduction to Temporal Graphs: An Algorithmic Perspective ⋮ Fault-tolerant aggregation: flow-updating meets mass-distribution ⋮ Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony ⋮ The impact of mobility on the geocasting problem in mobile ad-hoc networks: solvability and cost ⋮ Information Spreading in Dynamic Networks: An Analytical Approach ⋮ Upper and lower bounds for the synchronizer performance in systems with probabilistic message loss ⋮ Cover time in edge-uniform stochastically-evolving graphs ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective^*

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