Affiliation:
1. Sichuan Normal University, China
2. South China University of Technology, China
Abstract
Benefitting from the maturation of Wireless Power Transfer technology, Wireless Rechargeable Sensor Networks have become a promising solution for prolonging network lifetime. In practical charging scenarios, obstacles are ubiquitous. However, most prior arts have failed to consider the combined impacts of the material, size, and location of obstacles on the charging performance, making these schemes unsuitable for real applications. In this article, we study a fundamental issue of
W
ireless ch
A
rger placement w
I
th obs
T
acles (WAIT), that is, how to place wireless chargers by comprehensively considering these parameters of obstacles, such that the overall charging utility is maximized. To tackle the WAIT problem, we first build a practical charging model with obstacles by introducing shadow fading, and conduct experiments to verify its correctness. Then, we design a piecewise constant function to approximate the nonlinear charging power. Afterwards, we develop a Dominating Coverage Set extraction algorithm to reduce the continuous solution space to a limited number. Finally, we prove the WAIT problem is a maximizing monotone submodular function problem, and propose a 1-1/e-ε approximation algorithm to address it. Extensive simulations and field experiments show that our scheme outperforms comparison algorithms by at least 20.6% in charging utility improvement.
Funder
National Natural Science Foundation of China
Natural Science Foundation of Sichuan Province
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications
Reference50 articles.
1. Goldsmith Andrea. 2017. Wireless Communication.
2. Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles
3. J. E. Berg, Randall Bownds, and Fredrik Lotse. 1992. Path loss and fading models for microcells at 900 MHz. In Proceedings of the IEEE VTC. 666–671.
4. David Keun Cheng et al. 1989. Field and Wave Electromagnetics. Pearson Education India.
5. A Greedy Heuristic for the Set-Covering Problem
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献