Optimal and Near-Optimal Policies for Wireless Power Transfer Considering Fairness

被引:0
|
作者
Rezaei, Roohollah [1 ]
Movahednasab, Mohammad [1 ]
Omidvar, Naeimeh [1 ]
Pakravan, Mohammad Reza [1 ]
机构
[1] Sharif Univ Technol, Dept Elect Engn, Tehran, Iran
关键词
Wireless power transfer; optimal policy; fairness; stochastic optimization; non-convex; MDPP;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Radio frequency wireless power transfer (RF-WPT) is an emerging technology that enables transferring energy from a power source to wireless devices over the air. In this paper, we aim at finding the optimal policy for wireless power transfer (WPT) from an energy access point (E-AP) to multiple energy receivers (E-Rs) that maximizes the wireless power transfer efficiency. For this purpose, in the first part of the paper, we formulate the problem of maximizing the total average received power of the E-Rs subject to the average and peak power constraints of the E-AP. The formulated problem is a non-convex stochastic optimization problem, and is highly non-trivial. Using some stochastic optimization techniques, we tackle the aforementioned challenges to solve the problem and derive a closed-form expression for the optimal solution, which requires the CSI distribution. In addition, we propose a heuristic algorithm that does not require any explicit information on the CSI distribution. We prove that the proposed algorithm attains a near-optimal solution within a guaranteed gap to the optimal solution. In the second part of the paper, we focus on the problem of considering fairness among the E-Rs and propose two fair policies, namely Max-MM Fair (MMF) policy and Quality-of-service-aware Proportional Fair (QPF) policy. MMF policy maximizes the minimum received power among the E-Rs. Moreover, QPF policy balances the received power levels of different E-Rs as much as possible, while guaranteeing the required minimum QoS for each of them. Various numerical results demonstrate the significant performance of the proposed solutions.
引用
收藏
页数:7
相关论文
共 50 条
  • [41] Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models
    Wang, Yining
    Chen, Xi
    Zhou, Yuan
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), 2018, 31
  • [42] Barriers to Near-Optimal Equilibria
    Roughgarden, Tim
    [J]. 2014 55TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2014), 2014, : 71 - 80
  • [43] Universal Near-Optimal Feedbacks
    S. Nobakhtian
    R. J. Stern
    [J]. Journal of Optimization Theory and Applications, 2000, 107 : 89 - 122
  • [44] Universal near-optimal feedbacks
    Nobakhtian, S
    Stern, RJ
    [J]. JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2000, 107 (01) : 89 - 122
  • [45] Distributed near-optimal matching
    Deng, XT
    [J]. COMBINATORICA, 1996, 16 (04) : 453 - 464
  • [46] THE NEAR-OPTIMAL INSTRUCTION SET
    SMITH, T
    [J]. IEEE MICRO, 1982, 2 (03) : 5 - 6
  • [47] NEAR-OPTIMAL DECODING ALGORITHM
    KOROGODI.AM
    [J]. TELECOMMUNICATIONS AND RADIO ENGINEERING, 1972, 26 (09) : 130 - 132
  • [48] Near-Optimal Online Auctions
    Blum, Avrim
    Hartline, Jason D.
    [J]. PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 1156 - 1163
  • [49] Near-optimal terrain collision
    Malaek, S. M.
    Abbasi, A.
    [J]. 2006 IEEE AEROSPACE CONFERENCE, VOLS 1-9, 2006, : 2990 - +
  • [50] Near-Optimal Light Spanners
    Chechik, Shiri
    Wulff-Nilsen, Christian
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2018, 14 (03)