TY - GEN
T1 - SCAPE
T2 - 2014 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2014
AU - Dai, Haipeng
AU - Liu, Yunhuai
AU - Chen, Guihai
AU - Wu, Xiaobing
AU - He, Tian
PY - 2014/1/1
Y1 - 2014/1/1
N2 - Wireless power transfer technology is considered as one of the promising solutions to address the energy limitation problems for end-devices, but its incurred potential risk of electromagnetic radiation (EMR) exposure is largely overlooked by most existing works. In this paper, we consider the Safe Charging with Adjustable PowEr (SCAPE) problem, namely, how to adjust the power of chargers to maximize the charging utility of devices, while assuring that EMR intensity at any location in the field does not exceed a given threshold R t. We present novel techniques to reformulate SCAPE into a traditional linear programming problem, and then remove its redundant constraints as much as possible to reduce computational effort. Next, we propose a distributed algorithm with provable approximation ratio (1 - ε). Through extensive simulation and testbed experiments, we demonstrate that our (1 - ε)-approximation algorithm outperforms the Set-Cover algorithm by up to 23%, and has an average performance gain of 41.1% over the SCP algorithm in terms of the overall charging utility.
AB - Wireless power transfer technology is considered as one of the promising solutions to address the energy limitation problems for end-devices, but its incurred potential risk of electromagnetic radiation (EMR) exposure is largely overlooked by most existing works. In this paper, we consider the Safe Charging with Adjustable PowEr (SCAPE) problem, namely, how to adjust the power of chargers to maximize the charging utility of devices, while assuring that EMR intensity at any location in the field does not exceed a given threshold R t. We present novel techniques to reformulate SCAPE into a traditional linear programming problem, and then remove its redundant constraints as much as possible to reduce computational effort. Next, we propose a distributed algorithm with provable approximation ratio (1 - ε). Through extensive simulation and testbed experiments, we demonstrate that our (1 - ε)-approximation algorithm outperforms the Set-Cover algorithm by up to 23%, and has an average performance gain of 41.1% over the SCP algorithm in terms of the overall charging utility.
UR - http://www.scopus.com/inward/record.url?scp=84904465692&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84904465692&partnerID=8YFLogxK
U2 - 10.1109/INFCOMW.2014.6849226
DO - 10.1109/INFCOMW.2014.6849226
M3 - Conference contribution
AN - SCOPUS:84904465692
SN - 9781479930883
T3 - Proceedings - IEEE INFOCOM
SP - 203
EP - 204
BT - 2014 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2014
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 27 April 2014 through 2 May 2014
ER -