Abstract

A simultaneous wireless information and power transfer system in interference channels of multi-users is considered. In this system, each transmitter sends one data stream to its targeted receiver, which causes interference to other receivers. Since all transmitter-receiver links want to maximize their own average transmission rate, a power allocation problem under the transmit power constraints and the energy-harvesting constraints is developed. To solve this problem, we propose a game theory framework. Then, we convert the game into a variational inequalities problem by establishing the connection between game theory and variational inequalities and solve the variational inequalities problem. Through theoretical analysis, the existence and uniqueness of Nash equilibrium are both guaranteed by the theory of variational inequalities. A distributed iterative alternating optimization water-filling algorithm is derived, which is proved to converge. Numerical results show that the proposed algorithm reaches fast convergence and achieves a higher sum rate than the unaided scheme.

Highlights

  • Simultaneous wireless information and power transfer (SWIPT), which transports both information and energy simultaneously by the same radio-frequency (RF) signal, has caused great concern in both academic and industrial fields and offers great convenience to wireless terminals [1,2,3]

  • As a power splitting (PS) receiver plays a significant role in SWIPT, it divides the received signal into two signal flows, one for energy harvesting (EH) and the other for information decoding (ID) [4, 5]

  • 4 Conclusions In this paper, a power allocation problem was solved for a SWIPT system in K-user interference channels using the framework of game theory

Read more

Summary

Introduction

Simultaneous wireless information and power transfer (SWIPT), which transports both information and energy simultaneously by the same radio-frequency (RF) signal, has caused great concern in both academic and industrial fields and offers great convenience to wireless terminals [1,2,3]. The. Wen et al EURASIP Journal on Advances in Signal Processing (2018) 2018:27 proposed a joint beamforming and power splitting algorithm based on second-order cone programming (SOCP) relaxation in a K-user IFC network. Based on PS scheme, the work [16] considered a multi-user SWIPT interference system and studied joint transceiver design to minimize the total transmit power. To the best of our knowledge, an iterative water-filling algorithm based on a game theory to solve the power allocation problem in IFC SWIPT systems with K direct links to maximize its sum rate has not yet been studied. We devise an iterative water-filling algorithm based on game theory to solve the formulated power allocation problem for the IFC SWIPT systems. 4. To deal with the formulated sub-problem, a distributed iterative water-filling algorithm (IWFA) is devised to optimize the power allocation problem

Problem formulation
VI problem formulation
Optimal α with variable-step projection scheme
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call