Data Delivery by Energy-Constrained Mobile Agents on a Line

  • Jérémie Chalopin
  • Riko Jacob
  • Matúš Mihalák
  • Peter Widmayer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8573)


We consider n mobile agents of limited energy that are placed on a straight line and that need to collectively deliver a single piece of data from a given source point s to a given target point t on the line. Agents can move only as far as their batteries allow. They can hand over the data when they meet. In this paper we show that deciding whether the agents can deliver the data is (weakly) NP-complete, and for instances where all input values are integers, we present a quasi-, pseudo-polynomial time algorithm that runs in time O2 ·n1 + 4logΔ), where Δ is the distance between s and t. This answers an open problem stated by Anaya et al.(DISC 2012).


Mobile agents and robots data aggregation and delivery power-awareness algorithms complexity 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM Journal on Computing 29(4), 1164–1188 (2000)CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    Alpern, S., Gal, S.: The theory of search games and rendezvous, vol. 55. Kluwer Academic Pub. (2002)Google Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    Blum, A., Raghavan, P., Schieber, B.: Navigating in unfamiliar geometric terrain. SIAM Journal on Computing 26(1), 110–137 (1997)CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Chalopin, J., Das, S., Mihalák, M., Penna, P., Widmayer, P.: Data delivery by energy-constrained mobile agents. In: Proc. 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS), pp. 111–122 (2013)Google Scholar
  6. 6.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)Google Scholar
  7. 7.
    Heo, N., Varshney, P.K.: Energy-efficient deployment of intelligent mobile sensor networks. IEEE Transactions on Systems, Man, and CyberNetics (Part A) 35(1), 78–92 (2005)CrossRefGoogle Scholar
  8. 8.
    Rajagopalan, R., Varshney, P.K.: Data-aggregation techniques in sensor networks: a survey. IEEE Communications Surveys & Tutorials 8(4), 48–63 (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Jérémie Chalopin
    • 1
  • Riko Jacob
    • 2
  • Matúš Mihalák
    • 2
  • Peter Widmayer
    • 2
  1. 1.LIF, Aix-Marseille University & CNRSMarseilleFrance
  2. 2.Institute of Theoretical Computer ScienceETH ZurichZürichSwitzerland

Personalised recommendations