Broadcasting in unreliable radio networks

DOI10.1145/1835698.1835779zbMath1315.68031OpenAlexW2135699088MaRDI QIDQ5176210

Rotem Oshman, Calvin Newport, Fabian Kuhn, Andréa W. Richa, Nancy A. Lynch

Publication date: 2 March 2015

Published in: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/62830

zbMATH Keywords

broadcastdual graphsunreliable networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (11)

Efficient broadcasting in radio networks with long-range interference ⋮ Some lower bounds in dynamic networks with oblivious adversaries ⋮ Broadcasting in an Unreliable SINR Model. ⋮ Network design under general wireless interference ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ The abstract MAC layer ⋮ Spanning Trees With Edge Conflicts and Wireless Connectivity ⋮ Unnamed Item ⋮ The cost of global broadcast in dynamic radio networks ⋮ On simple back-off in unreliable radio networks ⋮ Structuring unreliable radio networks

Uses Software

• CCSTM

Cites Work

• Elastic Transactions
• Toward a theory of transactional contention managers
• Software transactional memory

This page was built for publication: Broadcasting in unreliable radio networks