Asynchronous Broadcasting with Bivalent Beeps

DOI10.1007/978-3-319-48314-6_19zbMath1482.68175arXiv1611.08938OpenAlexW2547966610MaRDI QIDQ2835032

Andrzej Pelc, Kokouvi Hounkanli

Publication date: 1 December 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.08938

zbMATH Keywords

networkgraphwireless communicationdeterministic algorithmbeepasynchronous broadcasting

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Communication theory (94A05)

Related Items (1)

Exactly optimal deterministic radio broadcasting with collision detection

Cites Work

• Methods and problems of communication in usual networks
• The computational power of beeps
• Activating anonymous ad hoc radio networks
• Centralized asynchronous broadcast in radio networks
• Beeping a maximal independent set
• Fast broadcasting and gossiping in radio networks
• Randomized broadcast in networks
• A trade-off between information and communication in broadcast protocols
• Deploying Wireless Networks with Beeps
• A survey of gossiping and broadcasting in communication networks
• Information Dissemination in Trees
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
• Fault-tolerant broadcasting and gossiping in communication networks

This page was built for publication: Asynchronous Broadcasting with Bivalent Beeps