Safe Charging for Wireless Power Transfer

被引：107

作者：

Dai, Haipeng ^{[1
]}

Liu, Yunhuai ^{[2
]}

Chen, Guihai ^{[1
]}

Wu, Xiaobing ^{[3
]}

He, Tian ^{[4
]}

Liu, Alex X. ^{[1
,5
]}

Ma, Huizhen ^{[1
]}

机构：

[1] Nanjing Univ, State Key Lab Novel Software Technol, Nanjing 210023, Jiangsu, Peoples R China

[2] Peking Univ, Beijing 100080, Peoples R China

[3] Univ Canterbury, Wireless Res Ctr, Christchurch 8041, New Zealand

[4] Univ Minnesota, Comp Sci & Engn Dept, Minneapolis, MN 55455 USA

[5] Michigan State Univ, Dept Comp Sci, E Lansing, MI 48824 USA

来源：

IEEE-ACM TRANSACTIONS ON NETWORKING | 2017年 / 25卷 / 06期

基金：

中国国家自然科学基金; 美国国家科学基金会;

关键词：

Electromagnetic radiation; wireless power transfer; optimization; OPTIMIZATION;

D O I：

10.1109/TNET.2017.2750323

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

As battery-powered mobile devices become more popular and energy hungry, wireless power transfer technology, which allows the power to be transferred from a charger to ambient devices wirelessly, receives intensive interests. Existing schemes 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 R-t. We show that SCP is NP-hard and propose a solution, which provably outperforms the optimal solution to SCP with a relaxed EMR threshold (1-is an element of)R-t. 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 is an element of = 0.1, while a naive greedy algorithm is 34.6% below our solution.

引用

页码：3531 / 3544

页数：14

共 42 条

[1]

Ahlbom A, 1998, HEALTH PHYS, V74, P494

[2]

[Anonymous], P 7 ACM WORKSH HOT T

[3]

[Anonymous], [No title captured]

[4]

[Anonymous], 2017, IEEE INFOCOM

[5]

[Anonymous], 2012, ACTA ELECTROTEHNICA

[6]

[Anonymous], 2017, ACM MOBIHOC

[7]

[Anonymous], 1979, COMPUTERS INTRACTABI

[8] THE ALGEBRAIC DEGREE OF GEOMETRIC OPTIMIZATION PROBLEMS [J].

BAJAJ, C .

DISCRETE & COMPUTATIONAL GEOMETRY, 1988, 3 (02) :177-191

[9]

Bespamyatnikh S, 1999, LECT NOTES COMPUT SC, V1663, P318

[10] Fast approximations for sums of distances, clustering and the Fermat-Weber problem [J].

Bose, P ;

Maheshwari, A ;

Morin, P .

COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2003, 24 (03) :135-146

← 1 2 3 4 5 →