Gossiping by energy-constrained mobile agents in tree networks

DOI10.1016/J.TCS.2021.02.009MaRDI QIDQ1998846zbMATH OpenOpenAlexFDO

Authors Dariusz Dereniowski, Robert Ostrowski, Wojciech Rytter, 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

zbMATH Keywords

energy exchangegossipingmobile agentstree network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Broadcast with energy-exchanging mobile agents distributed on a tree
• Energy-Optimal Broadcast in a Tree with Mobile Agents
• Communication problems for mobile agents exchanging energy
• Energy-optimal broadcast and exploration in a tree using mobile agents
• Convergecast and broadcast by power-aware mobile agents

Cites work

• A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
• A survey of gossiping and broadcasting in communication networks
• Broadcast with energy-exchanging mobile agents distributed on a tree
• Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots
• Collaborative exploration of trees by energy-constrained mobile robots
• Collecting information by power-aware mobile agents
• Communication problems for mobile agents exchanging energy
• Data delivery by energy-constrained mobile agents on a line
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Energy-efficient fast delivery by mobile agents
• Energy-Optimal Broadcast in a Tree with Mobile Agents
• Exploring Unknown Environments
• Fast broadcasting and gossiping in radio networks
• Fast collaborative graph exploration
• Fast distributed algorithm for convergecast in ad hoc geometric radio networks
• scientific article; zbMATH DE number 6862102 (Why is no real title available?)
• LATIN 2004: Theoretical Informatics
• Piecemeal graph exploration by a mobile robot.
• The broadcast storm problem in a mobile ad hoc network
• The theory of search games and rendezvous.
• Vehicle Routing
• Why Robots Need Maps

Cited in

(9)

• Broadcast with energy-exchanging mobile agents distributed on a tree
• Energy-optimal broadcast and exploration in a tree using mobile agents
• Move-optimal gossiping among mobile agents
• Convergecast and broadcast by power-aware mobile agents
• Collecting information by power-aware mobile agents
• Energy-Optimal Broadcast in a Tree with Mobile Agents
• Optimal Moves for Gossiping Among Mobile Agents
• On the computational power of energy-constrained mobile robots
• Quiescence of self-stabilizing gossiping among mobile agents in graphs

Describes a project that uses

Uses Software

• VRP

This page was built for publication: Gossiping by energy-constrained mobile agents in tree networks

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