Abstract
This chapter discusses important recharge scheduling problems in WRSNs. Our primary objective is to reduce energy cost on the charging vehicle while maintaining the perpetual operation of the network. We first discuss the emergency recharge scheduling problem and provide an efficient algorithm to solve it. Then we discuss the normal recharge problem by formulating it into an optimization problem, which is NP-hard. We present two algorithms for this problem. The first algorithm leverages a weighted sum of node lifetime and charging vehicle’s traveling time to make recharge decisions. The second algorithm consists of three steps: network partition, capture charging vehicle’s capacity and improve recharge routes based on node’s lifetime.
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
References
P. Vansteenwegen, W. Souffriau and D. Van Oudheusden, “The orienteering problem: a survey,” European Journal of Operation Research, vol. 209, no. 1, 2011.
C. Miller, A. Tucker and R. Zemlin,“Integer programming formulations and travelling salesman problems,” Journal of the ACM, pp. 326–329, 1960.
D. Feillet, P. Dejax and M. Gendreau, “Traveling salesman problems with profits,” Transportation Science, vol. 39, no. 2, 2005.
T. Tsiligirides, “Heuristic methods applied to orienteering,” Journal of the Operation Research Society, vol. 35, no. 9, pp. 797–809, 1984.
B. Golden, A. Assad and R. Dahl, “The orienteering problem,” Naval Research Logistics 34, pp. 307–318, 1987.
I. Chao, B. Golden and E. Wasil, “A fast and effective heuristic for the orienteering problem,” European Journal of Operation Research, vol. 88, no. 3, 1996.
M. Fischetti, J. S. Gonzalez and P. Toth, “Solving the orienteering problem through branch-and-cut,” INFORMS Journal on Computing, vol. 10, no. 2, pp. 133–148, 1998.
R. Karp. “Reducibility Among Combinatorial Problems,” Complexity of Computer Computations, pp. 85–103, 1972.
B. Gavish, “A note on the formulation of the m-salesman traveling salesman problem,” Management Science, 1976.
P. Toth and V. Daniele, “The vehicle routing problem,” Society for Industrial and Applied Mathematics, 2001.
M. Zhao, J. Li and Y. Yang, “Joint mobile energy replenishment and data gathering in wireless rechargeable sensor networks,” IEEE Transactions on Mobile Computing, vol. 13, no. 12, pp. 2689–2705, 2014.
C. Wang, J. Li, F. Ye and Y. Yang, “NETWRAP: An NDN based real-time wireless recharging framework for wireless sensor networks,” IEEE Transactions on Mobile Computing, vol. 13, no. 6, pp. 1283–2852, 2014.
T. Ralph, “On the capacitated vehicle routing problem,” Mathematical programming, vol. 94 no. 2–3, pp. 343–359, 2003.
B. Chandran and S. Raghavan, “Modeling and solving the capacitated vehicle routing problem on trees,” The Vehicle Routing Problem: Latest Advances and New Challenges, pp 239–261, 2008.
R. Fukasawa, “Robust branch-and-cut-and-price for the capacitated vehicle routing problem,” Mathematical programming, vol. 106, no. 3, pp. 491–511, May, 2006.
M.W.P. Savelsbergh, “Local search in routing problems with time windows,” Annals of Operation Research, pp. 285–305, 1985.
N. Bansal, A. Blum, S. Chawla and A. Meyerson, “Approximation algorithms for Deadline-TSP and Vehicle Routing with Time Windows,” ACM Symposium on Theory of Computing (STOC), 2004.
H.C. Lau, M. Sim and K. M. Teo,“Vehicle routing problem with time windows and a limited number of vehicles”,European Journal of Operation Research, 148, pp. 559–569, 2003.
E. Taillard, P. Badeau, M. Gendreau, F. Geurtin and J.Y. Potvin, “A tabu search heuristic for the vehicle routing problem with soft time windows,”Transportation Science, vol. 31, pp. 170–186, 1997.
J. MacQueen, “Some methods for classification and analysis of multivariate observations,” Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, no. 14, 1967.
L.R. Esau and K.C. Williams, “On teleprocessing system design: part II-a method for approximating the optimal network,” IBM System Journal, vol. 5, pp. 142–147, 1966.
P. Jaillet, “Probabilistic traveling salesman problem,” Ph.D. Dissertation, MIT, 1985.
T.H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, MIT Press, 2001.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 The Author(s)
About this chapter
Cite this chapter
Yang, Y., Wang, C. (2015). Recharge Scheduling. In: Wireless Rechargeable Sensor Networks. SpringerBriefs in Electrical and Computer Engineering. Springer, Cham. https://doi.org/10.1007/978-3-319-17656-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-17656-7_4
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-17655-0
Online ISBN: 978-3-319-17656-7
eBook Packages: Computer ScienceComputer Science (R0)