Skip to main content
SpringerLink
Log in

Data Delivery by Energy-Constrained Mobile Agents

  • Conference paper
  • First Online:
Algorithms for Sensor Systems (ALGOSENSORS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 8243))

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Albers, S., Fujiwara, H.: Energy-efficient algorithms for flow time minimization. ACM Trans. Algorithms 3(4), 1–17 (2007)

    MathSciNet  Google Scholar 

  2. Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM J. Comput. 29(4), 1164–1188 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous, vol. 55. Kluwer Academic, Boston (2002)

    Google Scholar 

  4. Ambühl, C.: An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 1139–1150. Springer, Heidelberg (2005)

    Google Scholar 

  5. Anaya, J., Chalopin, J., Czyzowicz, J., Labourel, A., Pelc, A., Vaxès, Y.: Collecting information by power-aware mobile agents. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 46–60. Springer, Heidelberg (2012)

    Google Scholar 

  6. Blum, A., Raghavan, P., Schieber, B.: Navigating in unfamiliar geometric terrain. SIAM J. Comput. 26(1), 110–137 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  7. Chan, H.-L., Edmonds, J., Lam, T.-W., Lee, L.-K., Marchetti-Spaccamela, A., Pruhs, K.: Nonclairvoyant speed scaling for flow and energy. Algorithmica 61(3), 507–517 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  8. Heo, N., Varshney, P.K.: Energy-efficient deployment of intelligent mobile sensor networks. IEEE Trans. Syst. Man Cybern. (Part A) 35(1), 78–92 (2005)

    Article  Google Scholar 

  9. Li, Q., Aslam, J., Rus, D.: Online power-aware routing in wireless ad-hoc networks. Proceedings of the 7th Annual International Conference on Mobile Computing and Networking, MobiCom 2001, pp. 97–107. ACM, New York (2001)

    Google Scholar 

  10. Rajagopalan, R., Varshney, P.K.: Data-aggregation techniques in sensor networks: a survey. IEEE Commun. Surv. Tutorials 8(4), 48–63 (2006)

    Article  Google Scholar 

  11. Tovey, C.A.: A simplified NP-complete satisfiability problem. Discrete Appl. Math. 8(1), 85–89 (1984)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIF, Aix-Marseille University & CNRS, Marseille, France

    Jérémie Chalopin & Shantanu Das

  2. Institute of Theoretical Computer Science, ETH Zurich, Zürich, Switzerland

    Matúš Mihal’ák, Paolo Penna & Peter Widmayer

Authors
  1. Jérémie Chalopin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shantanu Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Matúš Mihal’ák
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Paolo Penna
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Peter Widmayer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Matúš Mihal’ák .

Editor information

Editors and Affiliations

  1. University of Ottawa, Ottawa, Ontario, Canada

    Paola Flocchini

  2. Stony Brook University, Stonybrook, New York, USA

    Jie Gao

  3. School of Computer Science, Carleton University, Ottawa, Ontario, Canada

    Evangelos Kranakis

  4. University of Paderborn, Paderborn, Germany

    Friedhelm Meyer auf der Heide

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chalopin, J., Das, S., Mihal’ák, M., Penna, P., Widmayer, P. (2014). Data Delivery by Energy-Constrained Mobile Agents. In: Flocchini, P., Gao, J., Kranakis, E., Meyer auf der Heide, F. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2013. Lecture Notes in Computer Science(), vol 8243. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45346-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45346-5_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-45345-8

  • Online ISBN: 978-3-642-45346-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation