Charge me if you Can: Charging path optimization and scheduling in mobile networks

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Volumn 05-08-July-2016, Issue , 2016, Pages 101-110

  Chen, Lin ^a   Lin, Shan ^b   Huang, Hua ^b  

^a Laboratoire Interdisciplinaire des Sciences du Numérique   (France)

^b STONY BROOK UNIVERSITY   (United States)

Author keywords

Approximation algorithm; Mobile charger scheduling; Mobile wireless networks

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; BUDGET CONTROL; MOBILE AGENTS; MOBILE TELECOMMUNICATION SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; SCHEDULING; TELECOMMUNICATION NETWORKS; WIRELESS NETWORKS;

GENERIC OPTIMIZATION; LOGARITHMIC APPROXIMATION; MOBILE WIRELESS NETWORK; MOBILITY PATTERN; NETWORKING APPLICATIONS; PATH OPTIMIZATIONS; QUASI-POLYNOMIAL TIME; SCHEDULING PROBLEM;

MOBILE AD HOC NETWORKS;

EID: 84979284394     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2942358.2942364     Document Type: Conference Paper

References (37)

1. L. Xie, Y. Shi, Y. T. Hou, W. Lou, H. D. Sherali, H. Zhou, and S. F. Midkiff, "A mobile platform for wireless charging and data collection in sensor networks," IEEE J. Sel. Areas Commun., Vol. 33, no. 8, pp. 1521-1533, 2015.
2. N. Atanasov, J. Le Ny, and G. J. Pappas, "Distributed Algorithms for Stochastic Source Seeking with Mobile Robot Networks," ASME J. Dynamic Syst., Measurement, Control, 2014.
3. L. Di Puglia Pugliese, F. Guerriero, D. Zorbas, and T. M. Razafindralambo, "Modelling the mobile target covering problem using flying drones," Optimization Lett., Aug. 2015.
4. H. Qin and W. Zhang, "Charging scheduling with minimal waiting in a network of electric vehicles and charging stations," in Proc. ACM VANET 2011.
5. B. Coltin and M. Veloso, "Mobile robot task allocation in hybrid wireless sensor networks," in Proc. IEEE/RSJ Intl. Conf. Intelligent Robots Syst. (IROS), 2010.
6. P. Toth and D. Vigo, eds., The Vehicle Routing Problem. MOS/SIAM Series on Optimization, 2001.
7. A. Haghani and S. Jung, "A dynamic vehicle routing problem with time-dependent travel times," Comput. Oper. Res., 2005.
8. P. Ni, H. T. Vo, D. Dahlmeier, W. Cai, J. Ivanchev, and H. Aydt, "DEPART: Dynamic route planning in stochastic time-dependent public transit networks," in Proc. IEEE Conf. Intelligent Transportation Syst. (ITSC), 2015.
9. F. Miao, S. Han, S. Lin, and G. J. Pappas, "Taxi dispatch under model uncertainties.," in Proc. IEEE CDC, 2015.
10. J. Yang, P. Jaillet, and H. Mahmassani, "Real-time multivehicle truckload pickup and delivery problems," Transportation Sci., Vol. 38, pp. 135-148, 2004.
11. D. Zhang, T. He, S. Lin, S. Munir, and J. Stankovic, "Online cruising mile reduction in large-scale taxicab networks," IEEE Trans. Parallel Distrib. Syst., Vol. 26, no. 11, pp. 3122-3135, 2015.
12. R. Sugihara and R. K. Gupta, "Speed control and scheduling of data mules in sensor networks," ACM Trans. Sen. Netw., Vol. 7, Aug. 2010.
13. D. Ciullo, G. Celik, and E. Modiano, "Minimizing transmission energy in sensor networks via trajectory control," in Proc. IEEE WiOpt, 2010.
14. G. Xing, T. Wang, W. Jia, and M. Li, "Rendezvous design algorithms for wireless sensor networks with a mobile base station," in Proc. ACM MobiHoc, 2008.
15. L. Chen, W. Wang, H. Huang, and S. Lin in Proc. IEEE INFOCOM, title=Time-constrained Data Harvesting in WSNs: Theoretical Foundation and Algorithm Design, year=2015.
16. E. Ekici, Y. Gu, and D. Bozdag, "Mobility-based communication in wireless sensor networks," IEEE Comm. Mag., Vol. 44, pp. 56-62, July 2006.
17. J. Reich, V. Misra, D. Rubenstein, and G. Zussman, "Connectivity maintenance in mobile wireless networks via constrained mobility," IEEE J. Sel. Areas Commun., Vol. 30, no. 5, pp. 935-950, 2012.
18. Y. Hu, X. Wang, and X. Gan, "Critical sensing range for mobile heterogeneous camera sensor networks," in Proc. IEEE INFOCOM, pp. 970-978, 2014.
19. H. Huang, S. Lin, L. Chen, J. Gao, A. Mamat, and J. Wu, "Dynamic mobile charger scheduling in heterogeneous wireless sensor networks," in Proc. IEEE MASS, 2015.
20. S. Zhang, J. Wu, and S. Lu, "Collaborative mobile charging," IEEE Trans. Computers, Vol. 64, no. 3, pp. 654-667, 2015.
21. Y. Peng, Z. Li, W. Zhang, and D. Qiao, "Prolonging sensor network lifetime through wireless charging," in Proc. IEEE RTSS, 2010.
22. L. Xie, Y. Shi, Y. T. Hou, W. Lou, and H. D. Sherali, "On traveling path and related problems for a mobile station in a rechargeable sensor network," in Proc. ACM MobiHoc, 2013.
23. L. He, L. Fu, L. Zheng, Y. Gu, P. Cheng, J. Chen, and J. Pan, "Esync: An energy synchronized charging protocol for rechargeable wireless sensor networks," in Proc. ACM MobiHoc, ACM, 2014.
24. H. Dai, G. Chen, C. Wang, S. Wang, X. Wu, and F. Wu, "Quality of energy provisioning for wireless power transfer," IEEE Trans. Parallel Distrib. Syst., Vol. 26, no. 2, pp. 527-537, 2015.
25. G. Laporte, "The traveling salesman problem: An overview of exact and approximate algorithms," European J. Oper. Res., 1992.
26. D. L. Applegate, R. E. Bixby, V. Chvatal, and W. J. Cook, The Traveling Salesman Problem: A Computational Study: A Computational Study. Princeton Univ. Press, 2011.
27. R. Bar-Yehuda, G. Even, and S. M. Shahar, "On approximating a geometric prize-collecting traveling salesman problem with time windows," J. Algorithms, Vol. 55, no. 1, pp. 76-92, 2005.
28. A. Blum, S. Chawla, D. R. Karger, T. Lane, A. Meyerson, and M. Minkoff, "Approximation algorithms for orienteering and discounted-reward tsp," SIAM J. Comp., Vol. 37, no. 2, pp. 653-670, 2007.
29. C. Chekuri, N. Korula, and M. Pál, "Improved algorithms for orienteering and related problems," ACM Trans. Algorithms, Vol. 8, no. 3, p. 23, 2012.
30. N. Bansal, A. Blum, S. Chawla, and A. Meyerson, "Approximation algorithms for deadline-tsp and vehicle routing with time-windows," in Proc. ACM STOC, pp. 166-174, 2004.
31. A. Blum, S. Chawla, D. Karger, T. Lane, A. Meyerson, and M. Minkoff, "Approximation algorithms for orienteering and discounted-reward tsp," SIAM J. Comp., Vol. 37, no. 2, pp. 653-670, 2007.
32. C. Chekuri, N. Korula, and M. Pál, "Improved algorithms for orienteering and related problems," ACM Trans. Algorithms, Vol. 8, pp. 1-27, July 2012.
33. C. Helvig, G. Robins, and A. Zelikovsky, "The moving-target traveling salesman problem," J. Algorithms, Vol. 49, no. 1, pp. 153-174, 2003.
34. C. Chekuri and M. Pal, "A recursive greedy algorithm for walks in directed graphs," in Proc. IEEE FOCS, 2005.
35. "A greedy approximation algorithm for the group steiner problem," Discrete Applied Mathematics, Vol. 154, no. 1, pp. 15-34, 2006.
36. D. Linden and T.B. Reddy, Handbook of Batteries. McGraw-Hill, 2002.
37. W. Whitt, "The efficiency of one long run versus independent replications in steady-state simulation," Management Sci., Vol. 37, no. 6, pp. 645-666, 1991.