Probabilistic algorithms for the wake-up problem in single-hop radio networks
type: Item
instance of: scholarly article
title: Probabilistic algorithms for the wake-up problem in single-hop radio networks
zbMATH Open document ID: 1105.68115
author: Tomasz Jurdziński
author: Grzegorz Stachowiak
published in: Theory of Computing Systems
publication date: 2005-06-14T00:00:00Z
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 2175836
zbMATH Keywords: logarithmic waking algorithm
MaRDI profile type: Publication
full work available at URL: s00224-005-1144-3
OpenAlex ID: W1990661532
DOI: 10.1007/S00224-005-1144-3
Recommended article: Q4427874
Recommended article: The Wake‐Up Problem in MultiHop Radio Networks
Recommended article: Q5501363
Recommended article: Automata, Languages and Programming
Recommended article: Scalable wake-up of multi-channel single-hop radio networks
Recommended article: Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
Recommended article: Q6083382
Recommended article: Wake up and join me! An energy-efficient algorithm for maximal matching in radio networks
description: scientific article; zbMATH DE number 2175836