Scalable wake-up of multi-channel single-hop radio networks

DOI10.1016/j.tcs.2015.11.046zbMath1333.68028arXiv1411.4498OpenAlexW1935531700MaRDI QIDQ906382

Dariusz R. Kowalski, Gianluca De Marco, Bogdan S. Chlebus

Publication date: 21 January 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

synchronizationrandomized algorithmdistributed algorithmradio networkdeterministic algorithmmulti-channelmultiple access channelwake-up

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10) Randomized algorithms (68W20) Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05) Distributed algorithms (68W15)

Related Items (11)

Packet latency of deterministic broadcasting in adversarial multiple access channels ⋮ Contention resolution in a non-synchronized multiple access channel ⋮ Deterministic non-adaptive contention resolution on a shared channel ⋮ Counting in one-hop beeping networks ⋮ Windowed backoff algorithms for WiFi: theory and performance under batched arrivals ⋮ Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses ⋮ A new kind of selectors and their applications to conflict resolution in wireless multichannels networks ⋮ Token traversal in ad hoc wireless networks via implicit carrier sensing ⋮ Optimal channel utilization with limited feedback ⋮ Singletons for simpletons revisiting windowed backoff with Chernoff bounds ⋮ Efficient and competitive broadcast in multi-channel radio networks

Cites Work

• Unnamed Item
• Unbounded contention resolution in multiple-access channels
• Faster deterministic wakeup in multiple access channels
• Forbidding just one intersection
• A lower bound for radio broadcast
• Distributed broadcast in radio networks of unknown topology.
• Probabilistic algorithms for the wake-up problem in single-hop radio networks
• Maximum throughput of multiple access channels in adversarial environments
• The Wakeup Problem in Synchronous Broadcast Systems
• The Cost of Synchronizing Multiple-Access Channels
• Broadcasting in Ad Hoc Multiple Access Channels
• Leader election in shared spectrum radio networks
• Distributed Broadcast in Unknown Radio Networks
• Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast
• DYNAMIC SHARING OF A MULTIPLE ACCESS CHANNEL
• Fast broadcasting and gossiping in radio networks
• Adversarial Queuing on the Multiple Access Channel
• Gossiping in a Multi-channel Radio Network
• Lower Bounds for Clear Transmissions in Radio Networks
• A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
• Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness
• Efficient Symmetry Breaking in Multi-Channel Radio Networks
• Deterministic broadcasting in ad hoc radio networks
• The wireless synchronization problem
• Maximal independent sets in multichannel radio networks
• On selection problem in radio networks
• An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels
• The Wake‐Up Problem in MultiHop Radio Networks
• Broadcasting algorithms in radio networks with unknown topology
• Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel
• A better wake-up in radio networks
• Automata, Languages and Programming
• Broadcasting in undirected ad hoc radio networks

This page was built for publication: Scalable wake-up of multi-channel single-hop radio networks