Gossiping by energy-constrained mobile agents in tree networks
From MaRDI portal
Publication:1998846
DOI10.1016/j.tcs.2021.02.009zbMath1497.68027OpenAlexW3127662629MaRDI QIDQ1998846
Dariusz Dereniowski, Wojciech Rytter, Robert Ostrowski, Jurek Czyzowicz
Publication date: 9 March 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.02.009
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Uses Software
Cites Work
- Unnamed Item
- Collaborative exploration of trees by energy-constrained mobile robots
- The theory of search games and rendezvous.
- Energy-efficient fast delivery by mobile agents
- Broadcast with energy-exchanging mobile agents distributed on a tree
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- Piecemeal graph exploration by a mobile robot.
- The broadcast storm problem in a mobile ad hoc network
- A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
- Collaborative delivery with energy-constrained mobile robots
- Fast collaborative graph exploration
- Fast distributed algorithm for convergecast in ad hoc geometric radio networks
- Communication Problems for Mobile Agents Exchanging Energy
- Vehicle Routing
- Fast broadcasting and gossiping in radio networks
- A survey of gossiping and broadcasting in communication networks
- Collecting Information by Power-Aware Mobile Agents
- Exploring Unknown Environments
- Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots
- Energy-Optimal Broadcast in a Tree with Mobile Agents
- Data Delivery by Energy-Constrained Mobile Agents on a Line
- Why Robots Need Maps
- LATIN 2004: Theoretical Informatics
This page was built for publication: Gossiping by energy-constrained mobile agents in tree networks
