Optimal gossiping in geometric radio networks in the presence of dynamical faults
From MaRDI portal
Publication:2894246
DOI10.1002/net.21451zbMath1242.68011WikidataQ58219148 ScholiaQ58219148MaRDI QIDQ2894246
Angelo Monti, Francesco Pasquale, Andrea E. F. Clementi, Riccardo Silvestri
Publication date: 29 June 2012
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21451
68M10: Network design and communication in computer systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
68M12: Network protocols
Related Items
The cost of global broadcast in dynamic radio networks, Message and time efficient multi-broadcast schemes
Cites Work
- Unnamed Item
- Feasibility and complexity of broadcasting with random transmission failures
- Broadcasting in geometric radio networks
- Broadcasting in dynamic radio networks
- Unit disk graphs
- A lower bound for radio broadcast
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Distributed broadcast in radio networks of unknown topology.
- Power consumption in packet radio networks
- On adaptive deterministic gossiping in ad hoc radio networks.
- Round robin is optimal for fault-tolerant broadcasting on wireless networks
- Faster communication in known topology radio networks
- Multiple Communication in Multihop Radio Networks
- Fast broadcasting and gossiping in radio networks
- Efficient communication strategies for ad hoc wireless networks
