scientific article
From MaRDI portal
Publication:2768369
zbMath0989.94041MaRDI QIDQ2768369
Angelo Monti, Andrea E. F. Clementi, Riccardo Silvestri
Publication date: 24 March 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
directed graphssuperimposed codesunknown radio networksdeterministic distributed broadcastmultibroadcastselective families
Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (60)
Bounded information dissemination in multi-channel wireless networks ⋮ Randomized Group Testing Both Query-Optimal and Minimal Adaptive ⋮ Generalized framework for group testing: queries, feedbacks and adversaries ⋮ Deterministic radio broadcasting at low cost ⋮ Broadcasting in UDG radio networks with missing and inaccurate information ⋮ Consensus and collision detectors in radio networks ⋮ Broadcasting in UDG radio networks with unknown topology ⋮ Pattern matching with don't cares and few errors ⋮ Upper and lower bounds for deterministic broadcast in powerline communication networks ⋮ Constraining the number of positive responses in adaptive, non-adaptive, and two-stage group testing ⋮ Unbounded contention resolution in multiple-access channels ⋮ Information dissemination in unknown radio networks with large labels ⋮ $$\epsilon $$-Almost Selectors and Their Applications ⋮ On the complexity of neighbourhood learning in radio networks ⋮ Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony ⋮ Binary subgroups of direct products ⋮ Distributed broadcast in radio networks of unknown topology. ⋮ On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design ⋮ New combinatorial structures with applications to efficient group testing with inhibitors ⋮ Fast Radio Broadcasting with Advice ⋮ Dynamic multiple-message broadcast: bounding throughput in the affectance model ⋮ Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks ⋮ Almost optimal distributed M2M multicasting in wireless mesh networks ⋮ Deterministic protocols in the SINR model without knowledge of coordinates ⋮ Optimal deterministic broadcasting in known topology radio networks ⋮ Activating anonymous ad hoc radio networks ⋮ Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. ⋮ Broadcasting in geometric radio networks ⋮ Broadcasting in UDG Radio Networks with Missing and Inaccurate Information ⋮ Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges ⋮ Round complexity of leader election and gossiping in bidirectional radio networks ⋮ Deterministic broadcasting in ad hoc radio networks ⋮ Sensor Network Gossiping or How to Break the Broadcast Lower Bound ⋮ On the communication complexity of Bar-Yehuda, Goldreich and Itai's randomized broadcasting algorithm ⋮ Faster information gathering in ad-hoc radio tree networks ⋮ Randomized mutual exclusion on a multiple access channel ⋮ Tree exploration with advice ⋮ Fast radio broadcasting with advice ⋮ Trade-offs between the size of advice and broadcasting time in trees ⋮ Communication algorithms with advice ⋮ Improved lower bound for deterministic broadcasting in radio networks ⋮ Acknowledged broadcasting in ad hoc radio networks ⋮ Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism ⋮ Radio communication in random graphs ⋮ Token traversal in ad hoc wireless networks via implicit carrier sensing ⋮ Global synchronization and consensus using beeps in a fault-prone multiple access channel ⋮ Efficient \(k\)-shot broadcasting in radio networks ⋮ Information exchange with collision detection on multiple channels ⋮ Broadcasting in undirected ad hoc radio networks ⋮ Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks ⋮ Separable collusion-secure multimedia codes ⋮ Graph searching with advice ⋮ Information gathering in ad-hoc radio networks ⋮ On the effect of the deployment setting on broadcasting in Euclidean radio networks ⋮ Unbounded Contention Resolution in Multiple-Access Channels ⋮ Energy efficient randomised communication in unknown AdHoc networks ⋮ Deterministic recurrent communication in restricted sensor networks ⋮ Time-Efficient Broadcast in Radio Networks ⋮ On Efficient Gossiping in Radio Networks ⋮ On adaptive deterministic gossiping in ad hoc radio networks.
This page was built for publication:
