ROSE: Robustly Safe Charging for Wireless Power Transfer

被引:56
作者
Dai, Haipeng [1 ]
Xu, Yun [1 ]
Chen, Guihai [1 ]
Dou, Wanchun [1 ]
Tian, Chen [1 ]
Wu, Xiaobing [2 ]
He, Tian [3 ]
机构
[1] Nanjing Univ, State Key Lab Novel Software Technol, Nanjing 210023, Peoples R China
[2] Univ Canterbury, Wireless Res Ctr, Christchurch 8041, New Zealand
[3] Univ Minnesota, Comp Sci & Engn Dept, Minneapolis, MN 55455 USA
基金
中国国家自然科学基金;
关键词
Robustly safe charging; wireless power transfer; approximation algorithm; distribution algorithm; RADIATION; PLACEMENT;
D O I
10.1109/TMC.2020.3032591
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
One critical issue for wireless power transfer is to avoid human health impairments caused by electromagnetic radiation (EMR) exposure. The existing studies mainly focus on scheduling wireless chargers so that (expected) EMR at any point in the area does not exceed a threshold R-t. Nevertheless, they overlook the EMR jitter that leads to exceeding of R-t even if the expected EMR is no more than R-t. This paper studies the fundamental problem of RObustly SafE charging for wireless power transfer (ROSE), that is, scheduling the power of chargers so that the charging utility for all rechargeable devices is maximized while the probability that EMR anywhere does not exceed R, is no less than a given confidence. We first build our empirical probabilistic charging model and EMR model. Then, we present EMR approximation and area discretization techniques to formulate ROSE into a Second-Order Cone Program. After that, we propose the first redundant second-order cone constraints reduction algorithm to reduce the computational cost, and therefore obtain a (1 - epsilon)-approximation centralized algorithm. Further, we propose a (1 - epsilon)-approximation fully distributed algorithm scalable with network size for ROSE. We conduct both simulation and field experiments, and the results show that our algorithms can outperform comparison algorithms by 480.19 percent.
引用
收藏
页码:2180 / 2197
页数:18
相关论文
共 54 条
[1]  
[Anonymous], 2016, IEEE GLOB COMM C GLO
[2]  
Borror C. M., 2001, J QUAL TECHNOL, V33, P260
[3]  
Boyd S., 2004, CONVEX OPTIMIZATION
[4]  
Buettner M., 2008, P 7 ACM WORKSH HOT T, P37
[5]  
Buettner M, 2009, UBICOMP'09: PROCEEDINGS OF THE 11TH ACM INTERNATIONAL CONFERENCE ON UBIQUITOUS COMPUTING, P51
[6]  
Conway J. H, 2016, SYMM TRIES THINGS
[7]  
Dai H., 2016, P IEEE 35 ANN IEEE I, P1
[8]   Radiation Constrained Scheduling of Wireless Charging Tasks [J].
Dai, Haipeng ;
Ma, Huizhen ;
Liu, Alex X. .
MOBIHOC'17: PROCEEDINGS OF THE 18TH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, 2017,
[9]   CHASE: Charging and Scheduling Scheme for Stochastic Event Capture in Wireless Rechargeable Sensor Networks [J].
Dai, Haipeng ;
Ma, Qiufang ;
Wu, Xiaobing ;
Chen, Guihai ;
Yau, David K. Y. ;
Tang, Shaojie ;
Li, Xiang-Yang ;
Tian, Chen .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2020, 19 (01) :44-59
[10]  
Dai HP, 2018, IEEE INFOCOM SER, P378, DOI 10.1109/INFOCOM.2018.8485951