Efficient, Fair and QoS-Aware Policies for Wirelessly Powered Communication Networks
Roohollah Rezaei, Naeimeh Omidvar, Mohammad Movahednasab, Mohammad, Reza Pakravan, Sumei Sun, and Yong Liang Guan

TL;DR
This paper develops optimal and near-optimal policies for wireless power transfer in communication networks, ensuring efficiency, fairness, and QoS, with practical algorithms that do not require full channel information.
Contribution
It introduces a stochastic optimization framework for maximizing WPT efficiency, derives a closed-form optimal solution, and proposes a near-optimal algorithm that handles unknown CSI distributions.
Findings
Proposed policies outperform existing baselines in simulations.
Derived a closed-form expression for optimal WPT policy.
Designed a QoS-aware fair policy balancing energy transfer and communication.
Abstract
Wireless power transfer (WPT) is a viable source of energy for wirelessly powered communication networks (WPCNs). In this paper, we first consider WPT from an energy access point (E-AP) to multiple energy receivers (E-Rs) to obtain the optimal policy that maximizes the WPT efficiency. For this purpose, we formulate the problem of maximizing the total average received power of the E-Rs subject to the average and peak power level constraints of the E-AP. The formulated problem is a non-convex stochastic optimization problem. Using some stochastic optimization techniques, we tackle the challenges of this problem and derive a closed-form expression for the optimal solution, which requires the explicit knowledge of the distribution of channel state information (CSI) in the network. We then propose a near-optimal algorithm that does not require any explicit knowledge of the CSI distribution…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
