Abstract
This chapter studies the important research scheduling problem for wireless charging in wireless sensor networks. We first present a distributed protocol that can collect energy information from the network on demand. For scalability, the protocol divides the network into hierarchical levels, selects head nodes on each level and establishes routing paths to the heads. Mobile Chargers (MC) send recharge requests to reveal their current locations. Energy information messages then utilize the established routing paths to get back to the MCs. Based on the gathered energy information, our objective is to minimize energy cost for the MCs during movements and make sure no sensor depletes battery energy. We formulate the problem into an optimization problem by capturing both battery capacity from the MCs and dynamic lifetime from sensors. Since the problem is NP-hard, we present a three-step adaptive algorithm. The algorithm first partitions energy requests according to their locations. Then it constructs Capacitated Minimum Spanning Trees to capture charger’s battery capacities. Finally, the algorithm calculates recharge routes for each tree based on node’s lifetime. Simulation evaluations have demonstrated that the algorithm can successfully maintain perpetual operation of the network.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
The initial locations are usually the last node visited in the previous recharge tour. If the MC has returned to the base station for battery replacement. The initial location is the base station.
References
Angelopoulos, C.M., Nikoletseas, S., Raptis, T.P., Raptopoulos, C., Vasilakis, F.: Efficient energy management in wireless rechargeable sensor networks. In: Proceedings of the 15th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems, MSWiM ’12, pp. 309–316. ACM, New York, NY, USA (2012). doi:10.1145/2387238.2387291
He, S., Chen, J., Jiang, F., Yau, D.K.Y., Xing, G., Sun, Y.: Energy provisioning in wireless rechargeable sensor networks (2013). doi:10.1109/TMC.2012.161
Li, Z., Peng, Y., Zhang, W., Qiao, D.: J-roc: A joint routing and charging scheme to prolong sensor network lifetime (2011). doi:10.1109/ICNP.2011.6089076
Peng, Y., Li, Z., Zhang, W., Qiao, D.: Prolonging sensor network lifetime through wireless charging (2010). doi:10.1109/RTSS.2010.35
Shi, Y., Xie, L., Hou, Y.T., Sherali, H.D.: On renewable sensor networks with wireless energy transfer. In: INFOCOM, 2011 Proceedings IEEE, pp. 1350–1358 (2011). doi:10.1109/INFCOM.2011.5934919
Tong, B., Li, Z., Wang, G., Zhang, W.: How wireless power charging technology affects sensor network deployment and routing (2010). doi:10.1109/ICDCS.2010.61
Wang, C., Li, J., Ye, F., Yang, Y.: Multi-vehicle coordination for wireless energy replenishment in sensor networks. In: 2013 IEEE 27th International Symposium on Parallel Distributed Processing (IPDPS), pp. 1101–1111 (2013). doi:10.1109/IPDPS.2013.22
Wang, C., Li, J., Ye, F., Yang, Y.: Recharging schedules for wireless sensor networks with vehicle movement costs and capacity constraints. In: 2014 Eleventh Annual IEEE International Conference on Sensing, Communication, and Networking (SECON), pp. 468–476 (2014). doi:10.1109/SAHCN.2014.6990385
Zhao, M., Li, J., Yang, Y.: A framework of joint mobile energy replenishment and data gathering in wireless rechargeable sensor networks (2014). doi:10.1109/TMC.2014.2307335
Panasonic ni-mh battery handbook. http://www2.renovaar.ee/userfiles/panasonic_ni-mh_handbook.pdf
MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, Volume 1: Statistics, pp. 281–297. University of California Press, Berkeley, California (1967). http://projecteuclid.org/euclid.bsmsp/1200512992
Esau, L.R., Williams, K.C.: On teleprocessing system design, part ii: a method for approximating the optimal network. IBM Syst. J. 5(3), 142–147 (1966). doi:10.1147/sj.53.0142
Christofides, N., Mingozzi, A., Toth, P.: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Program. 20(1), 255–282 (1981). doi:10.1007/BF01589353
Gavish, B.: The formulation of the m-salesman traveling salesman problem. Manage. Sci. 22(6), 704–705 (1976). doi:10.1287/mnsc.22.6.704
Chandran, B., Raghavan, S.: Modeling and solving the capacitated vehicle routing problem on trees, pp. 239–261. Springer US, Boston, MA (2008). doi:10.1007/978-0-387-77778-811
Savelsbergh, M.W.P.: Local search in routing problems with time windows. Ann. Oper. Res. 4(1), 285–305 (1985). doi:10.1007/BF02022044
Desrochers, M., Lenstra, J.K., Savelsbergh, M.W., Soumis, F.: Vehicle routing with time windows: optimization and approximation. In: Vehicle routing: Methods and studies, vol. 16, pp. 65–84 (1988)
Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568–581 (1964)
Jaillet, P.: Probabilistic traveling salesman problems. Ph.D. thesis, Massachusetts Institute of Technology (1985)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this chapter
Cite this chapter
Wang, C., Li, J., Ye, F., Yang, Y. (2016). Recharge Scheduling with Multiple Mobile Chargers. In: Nikoletseas, S., Yang, Y., Georgiadis, A. (eds) Wireless Power Transfer Algorithms, Technologies and Applications in Ad Hoc Communication Networks. Springer, Cham. https://doi.org/10.1007/978-3-319-46810-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-46810-5_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-46809-9
Online ISBN: 978-3-319-46810-5
eBook Packages: Computer ScienceComputer Science (R0)