Skip to main content

Efficient Mobile Charger Scheduling in Large-Scale Sensor Networks

  • Conference paper
  • First Online:
Algorithmic Aspects in Information and Management (AAIM 2020)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12290))

Included in the following conference series:

Abstract

As a promising way to replenish energy to sensor nodes, scheduling the mobile charger to travel through the network area to charge sensor nodes has attracted great attention recently. Most existing works study the mobile charger scheduling problem under the scenario that only the depot can recharge or replace the battery for the mobile charger. However, for large-scale sensor networks, this may be energy inefficient, as the mobile charger will travel for a long distance to charge each sensor node. In this paper, we consider the scenario that there are some service stations in the network area which can be used to replace the battery for the mobile charger, and we study the problem of Minimizing the number of used Batteries for a mobile chArger to charge a wireless sensor network (MBA). We first prove that the MBA problem is NP-hard, and then design an approximation algorithm to address it. We also give the theoretical analysis for the algorithm. We conduct extensive simulations to evaluate the performance of our algorithm, the simulation results show that our proposed algorithm is effective and promising.

This work is supported by National Natural Science Foundation of China (Grant NO. 11671400, 61972404, 61672524).

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

Access this chapter

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. Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, Carnegie-Mellon University Pittsburgh Pa Management Sciences Research Group (1976)

    Google Scholar 

  2. Hicks, E.: Is My E-Bike Legal? USA Ebike Law, 23 April 2013. https://www.electricbike.com/electric-bike-law/. Accessed 02 Jan 2020

  3. Jiang, G., Lam, S.K., Sun, Y., Tu, L., Wu, J.: Joint charging tour planning and depot positioning for wireless sensor networks using mobile chargers. IEEE/ACM Trans. Netw. 25(4), 2250–2266 (2017)

    Article  Google Scholar 

  4. Kurs, A., Karalis, A., Moffatt, R., Joannopoulos, J.D., Fisher, P., Soljačić, M.: Wireless power transfer via strongly coupled magnetic resonances. Science 317(5834), 83–86 (2007)

    Article  MathSciNet  Google Scholar 

  5. Liang, W., et al.: Approximation algorithms for charging reward maximization in rechargeable sensor networks via a mobile charger. IEEE/ACM Trans. Netw. (TON) 25(5), 3161–3174 (2017)

    Article  Google Scholar 

  6. Lin, C., Wang, Z., Deng, J., Wang, L., Ren, J., Wu, G.: mTs: temporal-and spatial-collaborative charging for wireless rechargeable sensor networks with multiple vehicles. In: IEEE INFOCOM 2018-IEEE Conference on Computer Communications, pp. 99–107. IEEE (2018)

    Google Scholar 

  7. Lin, C., et al.: GTCCS: a game theoretical collaborative charging scheduling for on-demand charging architecture. IEEE Trans. Veh. Technol. 67(12), 12124–12136 (2018)

    Article  Google Scholar 

  8. Lin, C., Zhou, J., Guo, C., Song, H., Wu, G., Obaidat, M.S.: TSCA: a temporal-spatial real-time charging scheduling algorithm for on-demand architecture in wireless rechargeable sensor networks. IEEE Trans. Mob. Comput. 17(1), 211–224 (2017)

    Article  Google Scholar 

  9. Lin, C., Zhou, Y., Ma, F., Deng, J., Wang, L., Wu, G.: Minimizing charging delay for directional charging in wireless rechargeable sensor networks. In: IEEE INFOCOM 2019-IEEE Conference on Computer Communications, pp. 1819–1827. IEEE (2019)

    Google Scholar 

  10. Ma, Y., Liang, W., Xu, W.: Charging utility maximization in wireless rechargeable sensor networks by charging multiple sensors simultaneously. IEEE/ACM Trans. Netw. 26(4), 1591–1604 (2018)

    Article  Google Scholar 

  11. Wu, T., Yang, P., Dai, H., Xu, W., Xu, M.: Charging oriented sensor placement and flexible scheduling in rechargeable WSNs. In: IEEE INFOCOM 2019-IEEE Conference on Computer Communications, pp. 73–81. IEEE (2019)

    Google Scholar 

  12. Xu, W., Liang, W., Jia, X., Xu, Z., Li, Z., Liu, Y.: Maximizing sensor lifetime with the minimal service cost of a mobile charger in wireless sensor networks. IEEE Trans. Mob. Comput. 17(11), 2564–2577 (2018)

    Article  Google Scholar 

  13. Xu, W., Liang, W., Lin, X., Mao, G.: Efficient scheduling of multiple mobile chargers for wireless sensor networks. IEEE Trans. Veh. Technol. 65(9), 7670–7683 (2016)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Deying Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Ding, X., Chen, W., Wang, Y., Li, D., Hong, Y. (2020). Efficient Mobile Charger Scheduling in Large-Scale Sensor Networks. In: Zhang, Z., Li, W., Du, DZ. (eds) Algorithmic Aspects in Information and Management. AAIM 2020. Lecture Notes in Computer Science(), vol 12290. Springer, Cham. https://doi.org/10.1007/978-3-030-57602-8_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-57602-8_27

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-57601-1

  • Online ISBN: 978-3-030-57602-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics