In this paper, we present an optimal charging algorithm for multiple devices in the perspective of user satisfaction fairness. The proposed algorithm can maximize the total sum of the increment of user satisfaction levels in a finite charging scheduling period. In order to develop the algorithm, we define an objective function that includes the characteristics of charging capacity behaviors for the associated devices and formulate the problem as a convex optimization problem. Therefore, the proposed algorithm can be efficiently implemented in a very low complexity. Simulation results confirm that the proposed algorithm can achieve the maximum sum of the increment of user satisfaction levels compared to existing conventional approaches (e.g., equal allocation), thereby leading to an improved performance.
|Title of host publication
|17th Asia-Pacific Network Operations and Management Symposium
|Subtitle of host publication
|Managing a Very Connected World, APNOMS 2015
|Institute of Electrical and Electronics Engineers Inc.
|Number of pages
|Published - 24 Sep 2015
|17th Asia-Pacific Network Operations and Management Symposium, APNOMS 2015 - Busan, Korea, Republic of
Duration: 19 Aug 2015 → 21 Aug 2015
|17th Asia-Pacific Network Operations and Management Symposium: Managing a Very Connected World, APNOMS 2015
|17th Asia-Pacific Network Operations and Management Symposium, APNOMS 2015
|Korea, Republic of
|19/08/15 → 21/08/15
Bibliographical notePublisher Copyright:
© 2015 IEICE.
- Charging algorithm
- convex optimization
- multiple devices
- user satisfaction fairness