TY - GEN
T1 - Safe Charging for wireless power transfer
AU - Dai, Haipeng
AU - Liu, Yunhuai
AU - Chen, Guihai
AU - Wu, Xiaobing
AU - He, Tian
PY - 2014/1/1
Y1 - 2014/1/1
N2 - As battery-powered mobile devices become more popular and energy hungry, wireless power transfer technology receives intensive interests, as it allows the power to be transferred from a charger to ambient devices wirelessly. The existing studies mainly focus on the power transfer efficiency but overlook the health impairments caused by RF exposure. In this paper, we study the Safe Charging Problem (SCP) of scheduling power chargers so that more energy can be received while no location in the field has electromagnetic radiation (EMR) exceeding a given threshold Rt. We prove that SCP is NP-hard and propose a solution which provably outperforms the optimal solution to SCP with a relaxed EMR threshold (1 - ε)Rt. Testbed results based on 8 Powercast TX91501 chargers validate our results. Extensive simulation results show that the gap between our solution and the optimal one is only 6.7% when ε = 0.1, while a naive greedy algorithm is 34.6% below our solution.
AB - As battery-powered mobile devices become more popular and energy hungry, wireless power transfer technology receives intensive interests, as it allows the power to be transferred from a charger to ambient devices wirelessly. The existing studies mainly focus on the power transfer efficiency but overlook the health impairments caused by RF exposure. In this paper, we study the Safe Charging Problem (SCP) of scheduling power chargers so that more energy can be received while no location in the field has electromagnetic radiation (EMR) exceeding a given threshold Rt. We prove that SCP is NP-hard and propose a solution which provably outperforms the optimal solution to SCP with a relaxed EMR threshold (1 - ε)Rt. Testbed results based on 8 Powercast TX91501 chargers validate our results. Extensive simulation results show that the gap between our solution and the optimal one is only 6.7% when ε = 0.1, while a naive greedy algorithm is 34.6% below our solution.
UR - http://www.scopus.com/inward/record.url?scp=84904426961&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84904426961&partnerID=8YFLogxK
U2 - 10.1109/INFOCOM.2014.6848041
DO - 10.1109/INFOCOM.2014.6848041
M3 - Conference contribution
AN - SCOPUS:84904426961
SN - 9781479933600
T3 - Proceedings - IEEE INFOCOM
SP - 1105
EP - 1113
BT - IEEE INFOCOM 2014 - IEEE Conference on Computer Communications
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 33rd IEEE Conference on Computer Communications, IEEE INFOCOM 2014
Y2 - 27 April 2014 through 2 May 2014
ER -