Many-to-many communication in radio networks
type: Item
instance of: scholarly article
title: Many-to-many communication in radio networks
zbMATH Open document ID: 1188.68016
author: Bogdan S. Chlebus
author: Dariusz R. Kowalski
author: Tomasz Radzik
published in: Algorithmica
publication date: 2009-06-16T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68M12
zbMATH DE Number: 5565303
zbMATH Keywords: radio network
zbMATH Keywords: many-to-many communication
zbMATH Keywords: broadcast
zbMATH Keywords: Gossiping
zbMATH Keywords: centralized protocol
zbMATH Keywords: distributed protocol
zbMATH Keywords: randomization
MaRDI profile type: Publication
full work available at URL: s00453-007-9123-5
OpenAlex ID: W2059156304
cites work: A lower bound for radio broadcast
cites work: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
cites work: Multiple Communication in Multihop Radio Networks
cites work: On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
cites work: Centralized asynchronous broadcast in radio networks
cites work: Q2754190
cites work: Q4952711
cites work: Automata, Languages and Programming
cites work: Average-Time Complexity of Gossiping in Radio Networks
cites work: Q4785466
cites work: Distributed broadcast in radio networks of unknown topology.
cites work: Broadcasting algorithms in radio networks with unknown topology
cites work: Logarithmic inapproximability of the radio broadcast problem
cites work: Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem
cites work: Improved schedule for radio broadcast
cites work: Centralized broadcast in multihop radio networks
cites work: The wakeup problem in synchronous broadcast systems
cites work: Q4411387
cites work: Structural Information and Communication Complexity
cites work: Algorithm Theory - SWAT 2004
cites work: Faster communication in known topology radio networks
cites work: Deterministic M2M multicast in radio networks
cites work: A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels
cites work: Q4829004
cites work: Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
cites work: An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
DOI: 10.1007/S00453-007-9123-5
description: scientific article; zbMATH DE number 5565303