Facial reconstruction

Search LJMU Research Online

Browse Repository | Browse E-Theses

Speed control of mobile chargers serving wireless rechargeable networks

Yang, P and Chen, F and Zhao, Z and Min, G and Gao, W and Duan, H (2016) Speed control of mobile chargers serving wireless rechargeable networks. Future Generation Computer Systems. ISSN 0167-739X

[img] Text
speed-R1.pdf - Accepted Version
Restricted to Repository staff only until 14 December 2018.
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (424kB)

Abstract

Wireless rechargeable networks have attracted increasing research attention in recent years. For charging service, a mobile charger is often employed to move across the network and charge all network nodes. To reduce the charging completion time, most existing works have used the “move-then-charge” model where the charger first moves to specific spots and then starts charging nodes nearby. As a result, these works often aim to reduce the moving delay or charging delay at the spots. However, the charging opportunity on the move is largely overlooked because the charger can charge network nodes while moving, which as we analyze in this paper, has the potential to greatly reduce the charging completion time. The major challenge to exploit the charging opportunity is the setting of the moving speed of the charger. When the charger moves slow, the charging delay will be reduced (more energy will be charged during the movement) but the moving delay will increase. To deal with this challenge, we formulate the problem of delay minimization as a Traveling Salesman Problem with Speed Variations (TSP-SV) which jointly considers both charging and moving delay. We further solve the problem using linear programming to generate (1) the moving path of the charger, (2) the moving speed variations on the path and (3) the stay time at each charging spot. We also discuss possible ways to reduce the calculation complexity. Extensive simulation experiments are conducted to study the delay performance under various scenarios. The results demonstrate that our proposed method achieves much less completion time compared to the state-of-the-art work.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Computer Science
Publisher: Elsevier
Date Deposited: 09 Jan 2017 12:19
Last Modified: 07 Sep 2017 13:07
DOI or Identification number: 10.1016/j.future.2016.12.011
URI: http://researchonline.ljmu.ac.uk/id/eprint/5205

Actions (login required)

View Item View Item