Many-to-many communication in radio networks

DOI10.1007/S00453-007-9123-5zbMATH Open1188.68016OpenAlexW2059156304MaRDI QIDQ1024217FDOQ1024217

Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik

Publication date: 16 June 2009

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9123-5

zbMATH Keywords

randomizationbroadcastdistributed protocolGossipingradio networkcentralized protocolmany-to-many communication

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• Multiple Communication in Multihop Radio Networks
• On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
• A lower bound for radio broadcast
• Faster communication in known topology radio networks
• Broadcasting algorithms in radio networks with unknown topology
• Improved schedule for radio broadcast
• Centralized broadcast in multihop radio networks
• Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
• Structural Information and Communication Complexity
• The wakeup problem in synchronous broadcast systems
• 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
• Distributed broadcast in radio networks of unknown topology.
• Centralized asynchronous broadcast in radio networks
• Algorithm Theory - SWAT 2004
• Deterministic M2M multicast in radio networks
• Automata, Languages and Programming
• Average-Time Complexity of Gossiping in Radio Networks
• Logarithmic inapproximability of the radio broadcast problem
• Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem

Cited In (10)

• Efficient Distributed Communication in Ad-Hoc Radio Networks
• Coordination Problems in Ad Hoc Radio Networks
• Message and time efficient multi-broadcast schemes
• Almost optimal distributed M2M multicasting in wireless mesh networks
• Deterministic multi-channel information exchange
• Distributed multiple-message broadcast in wireless ad hoc networks under the SINR model
• Labeling schemes for deterministic radio multi-broadcast
• The cost of global broadcast in dynamic radio networks
• Information gathering in ad-hoc radio networks with tree topology
• Braid Chain Radio Communication

This page was built for publication: Many-to-many communication in radio networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1024217)