scientific article; zbMATH DE number 1962806
From MaRDI portal
Publication:4418641
zbMATH Open1036.90507MaRDI QIDQ4418641FDOQ4418641
Authors: Dariusz R. Kowalski, Andrzej Pelc 
Publication date: 11 August 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2607/26070109.htm
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18)
Cited In (20)
- Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
- Faster Deterministic Broadcasting in Ad Hoc Radio Networks
- Faster communication in known topology radio networks
- A Faster Distributed Radio Broadcast Primitive
- Improved lower bound for deterministic broadcasting in radio networks
- Near-optimal radio use for wireless network synchronization
- Fast deterministic broadcast and gossiping algorithms for mobile ad hoc networks
- Distributed Computing - IWDC 2004
- On adaptive deterministic gossiping in ad hoc radio networks.
- Leveraging Indirect Signaling for Topology Inference and Fast Broadcast
- Faster deterministic communication in radio networks
- Fast distributed algorithm for convergecast in ad hoc geometric radio networks
- Broadcasting in undirected ad hoc radio networks
- Faster information gathering in ad-hoc radio tree networks
- Efficient \(k\)-shot broadcasting in radio networks
- Title not available (Why is that?)
- Modeling radio networks
- The abstract MAC layer
- Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks
- Deterministic radio broadcasting at low cost
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4418641)
