Sum-Rate Maximization for Energy Harvesting Nodes With a Generalized Power Consumption Model

This paper considers a network of energy harvesting wireless nodes transmitting simultaneously in a Gaussian interference channel and investigates a distributed power allocation algorithm that maximizes the sum-rate. The power consumption model is based on a series of step functions that allow to mo...

Descripción completa

Detalles Bibliográficos
Autores: Payaro, M, Palomar, DP
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2016
País:España
Institución:Centre Tecnològic de Telecomunicacions de Catalunya (CTTC)
Repositorio:r-CTTC. Repositorio Institucional Producción Científica del Centre Tecnològic de Telecomunicacions de Catalunya (CTTC)
OAI Identifier:oai:cttc.fundanetsuite.com:p1937
Acceso en línea:https://cttc.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=1937
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982306595&doi=10.1109%2fTWC.2016.2556658&partnerID=40&md5=2b682018ff4e88cc891b6445288e3e0b
Access Level:acceso abierto
Palabra clave:Approximation algorithms
Electric power utilization
Iterative methods
Optimization
Radio transmission
Reconfigurable hardware
Signal interference
Solar energy
Distributed Power-Allocation
Gaussian interference channels
Nonconvex optimization
Point-to-point communication
Radio frequency circuit
Step functions
Successive convex approximations
Sum-rate maximizations
Energy harvesting
Descripción
Sumario:This paper considers a network of energy harvesting wireless nodes transmitting simultaneously in a Gaussian interference channel and investigates a distributed power allocation algorithm that maximizes the sum-rate. The power consumption model is based on a series of step functions that allow to model, among others, radio frequency circuits being on/off and the startup power consumption of the transmitter. After showing that the sum-rate maximization problem is nonsmooth, nonconvex, and NP-hard, the Iterative Smooth and Convex approximation Algorithm (ISCA) is proposed, which successively approximates the step functions by proper smooth functions to obtain a sequence of smooth nonconvex problems that can be solved by means of the successive convex approximation method. It is demonstrated that the ISCA distributedly converges to a stationary solution of the sum-rate maximization problem. For the particular case of point to point communications, the numerical results show that the ISCA is able to avoid bad stationary solutions, performing close to the globally optimal solution. The performance of the ISCA is also evaluated in the interference channel and with real solar energy harvesting data. © 2016 IEEE.