Collecting information by power-aware mobile agents

DOI10.1007/978-3-642-33651-5_4zbMATH Open1331.68150OpenAlexW1935259400MaRDI QIDQ4909401FDOQ4909401

Authors: Julian Anaya, J. Chalopin, Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc, Yann Vaxès 

Publication date: 13 March 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33651-5_4

Recommendations

• Convergecast and broadcast by power-aware mobile agents
• Communication problems for mobile agents exchanging energy
• Gossiping by energy-constrained mobile agents in tree networks
• Broadcast with energy-exchanging mobile agents distributed on a tree
• Data delivery by energy-constrained mobile agents

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Distributed algorithms (68W15)

Cited In (11)

• Convergecast and broadcast by power-aware mobile agents
• The pony express communication problem
• Rendezvous problem
• Gossiping by energy-constrained mobile agents in tree networks
• Near-gathering of energy-constrained mobile agents
• Communication problems for mobile agents exchanging energy
• Near-gathering of energy-constrained mobile agents
• Energy-Optimal Broadcast in a Tree with Mobile Agents
• Energy-optimal broadcast and exploration in a tree using mobile agents
• Brief announcement: Energy constrained depth first search
• Asymptotic connectedness of random interval graphs in a one dimensional data delivery problem

This page was built for publication: Collecting information by power-aware mobile agents

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