Convergecast and broadcast by power-aware mobile agents

DOI10.1007/s00453-014-9939-8zbMath1336.68189arXiv1603.04234OpenAlexW2058122117MaRDI QIDQ261352

Jérémie Chalopin, Andrzej Pelc, Jurek Czyzowicz, Julian Anaya, Arnaud Labourel, Yann Vaxès

Publication date: 23 March 2016

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.04234

zbMATH Keywords

graphcompetitive ratiodistributed algorithmbroadcastmobile agentcentralized algorithmconvergecastpower-aware

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)

Related Items

Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots ⋮ Collaborative Exploration by Energy-Constrained Mobile Robots ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Collaborative delivery on a fixed path with homogeneous energy-constrained agents ⋮ Collaborative exploration of trees by energy-constrained mobile robots ⋮ Collaborative delivery with energy-constrained mobile robots ⋮ Near-gathering of energy-constrained mobile agents

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gathering of asynchronous robots with limited visibility
• Searching in the plane
• Characterizing geometric patterns formable by oblivious anonymous mobile robots
• Power-aware scheduling for makespan and flow
• On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
• The theory of search games and rendezvous.
• Piecemeal graph exploration by a mobile robot.
• The power of a pebble: Exploring and mapping directed graphs
• A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
• Online graph exploration: New results on old and new algorithms
• Computation in networks of passively mobile finite-state sensors
• Fast distributed algorithm for convergecast in ad hoc geometric radio networks
• A New Approach for Analyzing Convergence Algorithms for Mobile Robots
• Design and Analysis of Distributed Algorithms
• Collective tree exploration
• A trade-off between information and communication in broadcast protocols
• Optimal Power-Down Strategies
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Navigating in Unfamiliar Geometric Terrain
• Exploring an unknown graph
• Algorithms for power savings
• On the computational power of oblivious robots
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Automata, Languages and Programming