Pages that link to "Item:Q1780847"
From MaRDI portal
The following pages link to Probabilistic algorithms for the wake-up problem in single-hop radio networks (Q1780847):
Displaying 20 items.
- Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
- Unbounded contention resolution in multiple-access channels (Q378254) (← links)
- Initializing sensor networks of non-uniform density in the weak sensor model (Q494934) (← links)
- A 3-valued wakeup protocol (Q672404) (← links)
- Monitoring churn in wireless networks (Q714767) (← links)
- Energy efficient alert in single-hop networks of extremely weak devices (Q714773) (← links)
- Faster deterministic wakeup in multiple access channels (Q881569) (← links)
- Scalable wake-up of multi-channel single-hop radio networks (Q906382) (← links)
- Consensus and collision detectors in radio networks (Q2377252) (← links)
- Contention resolution in a non-synchronized multiple access channel (Q2402256) (← links)
- The wakeup problem in synchronous broadcast systems (Q2719162) (← links)
- Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem (Q3624571) (← links)
- (Q4427874) (← links)
- Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards (Q4432747) (← links)
- (Q5090905) (← links)
- Approximate Neighbor Counting in Radio Networks (Q5091104) (← links)
- Automata, Languages and Programming (Q5716787) (← links)
- Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election (Q6052028) (← links)
- (Q6083382) (← links)
- Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks (Q6096038) (← links)
