Broadcasting with an energy harvesting rechargeable transmitter

Jing Yang, Omur Ozel, Sennur Ulukus

Research output: Contribution to journalArticle

227 Citations (Scopus)

Abstract

In this paper, we investigate the transmission completion time minimization problem in an additive white Gaussian noise (AWGN) broadcast channel, where the transmitter is able to harvest energy from the nature, using a rechargeable battery. The harvested energy is modeled to arrive at the transmitter during the course of transmissions. The transmitter has a fixed number of packets to be delivered to each receiver. The objective is to minimize the time by which all of the packets are delivered to their respective destinations. To this end, we optimize the transmit powers and transmission rates in a deterministic setting. We first analyze the structural properties of the optimal transmission policy in a two-user broadcast channel via the dual problem of maximizing the departure region by a fixed time T. We prove that the optimal total transmit power sequence has the same structure as the optimal single-user transmit power sequence in. In addition, the total power is split optimally based on a cut-off power level; if the total transmit power is lower than this cut-off level, all transmit power is allocated to the stronger user; otherwise, all transmit power above this level is allocated to the weaker user. We then extend our analysis to an M-user broadcast channel. We show that the optimal total power sequence has the same structure as the two-user case and optimally splitting the total power among M users involves M-1 cut-off power levels. Using this structure, we propose an algorithm that finds the globally optimal policy. Our algorithm is based on reducing the broadcast channel problem to a single-user problem as much as possible. Finally, we illustrate the optimal policy and compare its performance with several suboptimal policies under different settings.

Original languageEnglish (US)
Article number6108309
Pages (from-to)571-583
Number of pages13
JournalIEEE Transactions on Wireless Communications
Volume11
Issue number2
DOIs
StatePublished - Feb 1 2012

Fingerprint

Energy Harvesting
Energy harvesting
Broadcasting
Transmitter
Transmitters
Broadcast Channel
Secondary batteries
Optimal Policy
Structural properties
Gaussian White Noise
Dual Problem
Completion Time
Energy
Battery
Structural Properties
Minimization Problem
Receiver
Optimise
Minimise

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

@article{f2eacd6b848e4e819cdf0aedf742d9ea,
title = "Broadcasting with an energy harvesting rechargeable transmitter",
abstract = "In this paper, we investigate the transmission completion time minimization problem in an additive white Gaussian noise (AWGN) broadcast channel, where the transmitter is able to harvest energy from the nature, using a rechargeable battery. The harvested energy is modeled to arrive at the transmitter during the course of transmissions. The transmitter has a fixed number of packets to be delivered to each receiver. The objective is to minimize the time by which all of the packets are delivered to their respective destinations. To this end, we optimize the transmit powers and transmission rates in a deterministic setting. We first analyze the structural properties of the optimal transmission policy in a two-user broadcast channel via the dual problem of maximizing the departure region by a fixed time T. We prove that the optimal total transmit power sequence has the same structure as the optimal single-user transmit power sequence in. In addition, the total power is split optimally based on a cut-off power level; if the total transmit power is lower than this cut-off level, all transmit power is allocated to the stronger user; otherwise, all transmit power above this level is allocated to the weaker user. We then extend our analysis to an M-user broadcast channel. We show that the optimal total power sequence has the same structure as the two-user case and optimally splitting the total power among M users involves M-1 cut-off power levels. Using this structure, we propose an algorithm that finds the globally optimal policy. Our algorithm is based on reducing the broadcast channel problem to a single-user problem as much as possible. Finally, we illustrate the optimal policy and compare its performance with several suboptimal policies under different settings.",
author = "Jing Yang and Omur Ozel and Sennur Ulukus",
year = "2012",
month = "2",
day = "1",
doi = "10.1109/TWC.2011.120911.101813",
language = "English (US)",
volume = "11",
pages = "571--583",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

Broadcasting with an energy harvesting rechargeable transmitter. / Yang, Jing; Ozel, Omur; Ulukus, Sennur.

In: IEEE Transactions on Wireless Communications, Vol. 11, No. 2, 6108309, 01.02.2012, p. 571-583.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Broadcasting with an energy harvesting rechargeable transmitter

AU - Yang, Jing

AU - Ozel, Omur

AU - Ulukus, Sennur

PY - 2012/2/1

Y1 - 2012/2/1

N2 - In this paper, we investigate the transmission completion time minimization problem in an additive white Gaussian noise (AWGN) broadcast channel, where the transmitter is able to harvest energy from the nature, using a rechargeable battery. The harvested energy is modeled to arrive at the transmitter during the course of transmissions. The transmitter has a fixed number of packets to be delivered to each receiver. The objective is to minimize the time by which all of the packets are delivered to their respective destinations. To this end, we optimize the transmit powers and transmission rates in a deterministic setting. We first analyze the structural properties of the optimal transmission policy in a two-user broadcast channel via the dual problem of maximizing the departure region by a fixed time T. We prove that the optimal total transmit power sequence has the same structure as the optimal single-user transmit power sequence in. In addition, the total power is split optimally based on a cut-off power level; if the total transmit power is lower than this cut-off level, all transmit power is allocated to the stronger user; otherwise, all transmit power above this level is allocated to the weaker user. We then extend our analysis to an M-user broadcast channel. We show that the optimal total power sequence has the same structure as the two-user case and optimally splitting the total power among M users involves M-1 cut-off power levels. Using this structure, we propose an algorithm that finds the globally optimal policy. Our algorithm is based on reducing the broadcast channel problem to a single-user problem as much as possible. Finally, we illustrate the optimal policy and compare its performance with several suboptimal policies under different settings.

AB - In this paper, we investigate the transmission completion time minimization problem in an additive white Gaussian noise (AWGN) broadcast channel, where the transmitter is able to harvest energy from the nature, using a rechargeable battery. The harvested energy is modeled to arrive at the transmitter during the course of transmissions. The transmitter has a fixed number of packets to be delivered to each receiver. The objective is to minimize the time by which all of the packets are delivered to their respective destinations. To this end, we optimize the transmit powers and transmission rates in a deterministic setting. We first analyze the structural properties of the optimal transmission policy in a two-user broadcast channel via the dual problem of maximizing the departure region by a fixed time T. We prove that the optimal total transmit power sequence has the same structure as the optimal single-user transmit power sequence in. In addition, the total power is split optimally based on a cut-off power level; if the total transmit power is lower than this cut-off level, all transmit power is allocated to the stronger user; otherwise, all transmit power above this level is allocated to the weaker user. We then extend our analysis to an M-user broadcast channel. We show that the optimal total power sequence has the same structure as the two-user case and optimally splitting the total power among M users involves M-1 cut-off power levels. Using this structure, we propose an algorithm that finds the globally optimal policy. Our algorithm is based on reducing the broadcast channel problem to a single-user problem as much as possible. Finally, we illustrate the optimal policy and compare its performance with several suboptimal policies under different settings.

UR - http://www.scopus.com/inward/record.url?scp=84857359471&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84857359471&partnerID=8YFLogxK

U2 - 10.1109/TWC.2011.120911.101813

DO - 10.1109/TWC.2011.120911.101813

M3 - Article

AN - SCOPUS:84857359471

VL - 11

SP - 571

EP - 583

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 2

M1 - 6108309

ER -