We consider mobile agents of limited energy, which have to collaboratively deliver data from specified sources of a network to a central repository. Every move consumes energy that is proportional to the travelled distance. Thus, every agent is limited in the total distance it can travel. We ask whether there is a schedule of agents' movements that accomplishes the delivery. We provide hardness results, as well as exact, approximation, and resource-augmented algorithms for several variants of the problem. Among others, we show that the decision problem is NP-hard already for a single source, and we present a 2-approximation algorithm for the problem of finding the minimum energy that can be assigned to each agent such that the agents can deliver the data. © 2014 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Chalopin, J., Das, S., Mihal’ák, M., Penna, P., & Widmayer, P. (2013). Data delivery by energy-constrained mobile agents. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8243 LNCS, pp. 111–122). Springer Verlag. https://doi.org/10.1007/978-3-642-45346-5_9
Mendeley helps you to discover research relevant for your work.