Optimal On-Off Transmission Schemes for Full Duplex Wireless Powered Communication Networks
Muhammad Shahid Iqbal, Yalcin Sadi, Sinem Coleri

TL;DR
This paper develops optimal and heuristic on-off transmission schemes for full duplex wireless powered networks, maximizing throughput and minimizing scheduling length with polynomial-time algorithms.
Contribution
It introduces the first polynomial-time optimal scheduling algorithm and a near-optimal heuristic for sum throughput maximization in full duplex wireless powered networks.
Findings
Optimal scheduling algorithm is polynomial-time.
Heuristic algorithm achieves near-optimal throughput.
Proposed methods outperform baseline schemes.
Abstract
In this paper, we consider a full duplex wireless powered communication network where multiple users with radio frequency energy harvesting capability communicate to an energy broadcasting hybrid access point. We investigate the minimum length scheduling and sum throughput maximization problems considering on-off transmission scheme in which users either transmit at a constant power or remain silent. For minimum length scheduling problem, we propose a polynomial-time optimal scheduling algorithm. For sum throughput maximization, we first derive the characteristics of an optimal schedule and then to avoid intractable complexity, we propose a polynomial-time heuristic algorithm which is illustrated to perform nearly optimal through numerical analysis.
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.
