Round robin is optimal for fault-tolerant broadcasting on wireless networks

DOI10.1016/j.jpdc.2003.06.004zbMath1099.68504OpenAlexW1966511606MaRDI QIDQ1878699

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

Publication date: 8 September 2004

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2003.06.004

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Related Items (15)

Optimal gossiping in geometric radio networks in the presence of dynamical faults ⋮ Modeling Radio Networks ⋮ Sliding mode control design under multiple nodes round-robin-like protocol and packet length-dependent lossy network ⋮ Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony ⋮ Event-triggered \(\mathcal{L}_2\)-gain control for networked systems with time-varying delays and round-Robin communication protocol ⋮ Modeling radio networks ⋮ The abstract MAC layer ⋮ On the effect of scene motion on color constancy ⋮ Unnamed Item ⋮ On simple back-off in unreliable radio networks ⋮ Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks ⋮ Structuring unreliable radio networks ⋮ Broadcasting in dynamic radio networks ⋮ Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast ⋮ Time-Efficient Broadcast in Radio Networks

This page was built for publication: Round robin is optimal for fault-tolerant broadcasting on wireless networks