Time-efficient broadcast in radio networks

DOI10.1007/978-3-642-02250-0_12zbMATH Open1187.68047OpenAlexW2150348475MaRDI QIDQ3404475FDOQ3404475

Authors: Tomasz Radzik, David Peleg 

Publication date: 9 February 2010

Published in: Texts in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02250-0_12

Recommendations

• Time-Efficient Broadcasting in Radio Networks
• Publication:2754190
• Radio communication in random graphs
• Faster broadcasting in unknown radio networks
• Publication:4952711

zbMATH Keywords

broadcastingradio networksunit disk graphsselective familiesbroadcasting sequence

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)

Cites Work

• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Minimum broadcast graphs
• Optimal deterministic broadcasting in known topology radio networks
• Fast distributed algorithm for convergecast in ad hoc geometric radio networks
• Selective families, superimposed codes, and broadcasting on unknown radio networks. (Extended abstract)
• Multiple Communication in Multihop Radio Networks
• Distributed network protocols
• A trade-off between information and communication in broadcast protocols
• A survey of gossiping and broadcasting in communication networks
• Minimal broadcast networks
• Distributed Computing: A Locality-Sensitive Approach
• Fault-tolerant broadcasting and gossiping in communication networks
• On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
• Methods and problems of communication in usual networks
• A new distributed depth-first-search algorithm
• A lower bound for radio broadcast
• Faster communication in known topology radio networks
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Faster Centralized Communication in Radio Networks
• Broadcasting algorithms in radio networks with unknown topology
• Broadcasting in undirected ad hoc radio networks
• Title not available (Why is that?)
• Improved schedule for radio broadcast
• Energy and Time Efficient Broadcasting in Known Topology Radio Networks
• Centralized broadcast in multihop radio networks
• Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Reliable broadcast in radio networks
• The wakeup problem in synchronous broadcast systems
• Randomized broadcast in networks
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• Title not available (Why is that?)
• STACS 2004
• Distributed broadcast in radio networks of unknown topology.
• Faster broadcasting in unknown radio networks
• Title not available (Why is that?)
• Fast broadcasting and gossiping in radio networks
• Lower bounds for the broadcast problem in mobile radio networks
• Deterministic broadcasting in ad hoc radio networks
• Algorithm Theory - SWAT 2004
• Broadcasting in geometric radio networks
• The impact of information on broadcasting time in linear radio networks.
• Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
• Title not available (Why is that?)
• Automata, Languages and Programming
• Deterministic radio broadcasting at low cost
• Faster Deterministic Broadcasting in Ad Hoc Radio Networks
• Structural Information and Communication Complexity
• A better wake-up in radio networks
• Efficient communication in unknown networks
• Fault-tolerant broadcasting in radio networks
• On reliable broadcast in a radio network
• Broadcast in radio networks tolerating Byzantine adversarial behavior
• Broadcasting with locally bounded byzantine faults
• Round robin is optimal for fault-tolerant broadcasting on wireless networks
• Single round simulation on radio networks
• Fundamentals of Computation Theory
• Deterministic communication in radio networks with large labels
• Broadcasting on \([0,L]\)
• On the effect of the deployment setting on broadcasting in Euclidean radio networks
• Broadcasting in UDG radio networks with unknown topology
• Title not available (Why is that?)
• Logarithmic inapproximability of the radio broadcast problem
• Time and Cost Trade-Offs in Gossiping
• The time complexity of deterministic broadcast radio networks
• Topology broadcast algorithms
• Optimal Broadcast with Partial Knowledge

Cited In (9)

• Broadcasting in conflict-aware multi-channel networks
• Time-Efficient Broadcasting in Radio Networks
• Message and time efficient multi-broadcast schemes
• Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Broadcasting in dynamic radio networks
• Structural Information and Communication Complexity
• Network information broadcasting in narrow band self-organizing networks
• On the scalability and message count of trickle-based broadcasting schemes

This page was built for publication: Time-efficient broadcast in radio networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3404475)