Distributed Multi-User Wireless Charging Power Allocation
Yanju Gu

TL;DR
This paper models multi-user wireless charging as a noncooperative game, proposing a distributed algorithm that guarantees fast convergence to a unique Nash equilibrium even under asynchronous conditions, enhancing efficiency and robustness.
Contribution
It introduces a novel distributed power allocation algorithm for wireless charging networks with proven convergence to Nash equilibrium under various scheduling scenarios.
Findings
Algorithm converges exponentially to Nash equilibrium.
Robust convergence under asynchronous scheduling with delays and packet drops.
Numerical simulations confirm fast convergence and robustness.
Abstract
Wireless power charging enables portable devices to be permanently unplugged. Due to its low transmission power and low transmission efficiency, it requires much longer time slot to charge users compared with that for data transmission in wireless communication networks. Besides, each user's demand urgency needs to be taken into consideration for power allocation. Therefore, new algorithms are essential for wireless power allocation in multi-user wireless charging networks. In this paper, this problem is formulated as a static noncooperative game. It is shown that there exists a unique Nash equilibrium, which is the static state of the wireless power charging network. A distributed power allocation algorithm is proposed to compute the Nash equilibrium of the game. The main result of the paper consists of rigorous analysis of the distributed algorithm for power allocation. The algorithm…
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.
Taxonomy
TopicsEnergy Harvesting in Wireless Networks · Wireless Power Transfer Systems · Advanced MIMO Systems Optimization
