Online throughput maximization in an energy harvesting multiple access channel with fading

Jing Yang, Jingxian Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

In this paper, we consider an energy harvesting multiple access channel (MAC) where the transmitters are powered by energy harvested from the ambient environment. We assume that the energy harvesting processes at the transmitters can be modeled as independent Bernoulli processes with parameters λis, and the channel states between the transmitters and the receiver are independent Bernoulli processes with parameter μis. An active transmitter always transmits with a fixed power and consumes one unit amount of energy in a time slot. Under the assumption that μi ≥ λi, Ai, our objective is to schedule the transmissions adaptively according to the instantaneous channel and battery states of transmitters, so that the long-term average sum-throughput of the MAC is maximized in expectation. We first show that for a general asymmetric scenario where λis and μis are not identical across the transmitters, the expected long-term average sum-throughput has an upper bound for any transmission scheduling policy satisfying the energy causality constraints. We then consider a special symmetric scenario where λis and μis are uniform among transmitters. We propose a randomized longest-connected-queue transmission scheduling policy and show that it achieves the upper bound almost surely as time T approaches infinity, thus it is optimal.

Original languageEnglish (US)
Title of host publicationProceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2727-2731
Number of pages5
ISBN (Electronic)9781467377041
DOIs
StatePublished - Sep 28 2015
EventIEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong
Duration: Jun 14 2015Jun 19 2015

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2015-June
ISSN (Print)2157-8095

Other

OtherIEEE International Symposium on Information Theory, ISIT 2015
CountryHong Kong
CityHong Kong
Period6/14/156/19/15

Fingerprint

Multiple Access Channel
Energy Harvesting
Energy harvesting
Fading
Transmitter
Transmitters
Throughput
Scheduling Policy
Bernoulli
Unit of energy
Scheduling
Upper bound
Scenarios
Causality
Energy
Battery
Instantaneous
Queue
Schedule
Receiver

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

Yang, J., & Wu, J. (2015). Online throughput maximization in an energy harvesting multiple access channel with fading. In Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015 (pp. 2727-2731). [7282952] (IEEE International Symposium on Information Theory - Proceedings; Vol. 2015-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2015.7282952
Yang, Jing ; Wu, Jingxian. / Online throughput maximization in an energy harvesting multiple access channel with fading. Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 2727-2731 (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{db13e1d80711407c8cdbc846b1ead343,
title = "Online throughput maximization in an energy harvesting multiple access channel with fading",
abstract = "In this paper, we consider an energy harvesting multiple access channel (MAC) where the transmitters are powered by energy harvested from the ambient environment. We assume that the energy harvesting processes at the transmitters can be modeled as independent Bernoulli processes with parameters λis, and the channel states between the transmitters and the receiver are independent Bernoulli processes with parameter μis. An active transmitter always transmits with a fixed power and consumes one unit amount of energy in a time slot. Under the assumption that μi ≥ λi, Ai, our objective is to schedule the transmissions adaptively according to the instantaneous channel and battery states of transmitters, so that the long-term average sum-throughput of the MAC is maximized in expectation. We first show that for a general asymmetric scenario where λis and μis are not identical across the transmitters, the expected long-term average sum-throughput has an upper bound for any transmission scheduling policy satisfying the energy causality constraints. We then consider a special symmetric scenario where λis and μis are uniform among transmitters. We propose a randomized longest-connected-queue transmission scheduling policy and show that it achieves the upper bound almost surely as time T approaches infinity, thus it is optimal.",
author = "Jing Yang and Jingxian Wu",
year = "2015",
month = "9",
day = "28",
doi = "10.1109/ISIT.2015.7282952",
language = "English (US)",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "2727--2731",
booktitle = "Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015",
address = "United States",

}

Yang, J & Wu, J 2015, Online throughput maximization in an energy harvesting multiple access channel with fading. in Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015., 7282952, IEEE International Symposium on Information Theory - Proceedings, vol. 2015-June, Institute of Electrical and Electronics Engineers Inc., pp. 2727-2731, IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, Hong Kong, 6/14/15. https://doi.org/10.1109/ISIT.2015.7282952

Online throughput maximization in an energy harvesting multiple access channel with fading. / Yang, Jing; Wu, Jingxian.

Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 2727-2731 7282952 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2015-June).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Online throughput maximization in an energy harvesting multiple access channel with fading

AU - Yang, Jing

AU - Wu, Jingxian

PY - 2015/9/28

Y1 - 2015/9/28

N2 - In this paper, we consider an energy harvesting multiple access channel (MAC) where the transmitters are powered by energy harvested from the ambient environment. We assume that the energy harvesting processes at the transmitters can be modeled as independent Bernoulli processes with parameters λis, and the channel states between the transmitters and the receiver are independent Bernoulli processes with parameter μis. An active transmitter always transmits with a fixed power and consumes one unit amount of energy in a time slot. Under the assumption that μi ≥ λi, Ai, our objective is to schedule the transmissions adaptively according to the instantaneous channel and battery states of transmitters, so that the long-term average sum-throughput of the MAC is maximized in expectation. We first show that for a general asymmetric scenario where λis and μis are not identical across the transmitters, the expected long-term average sum-throughput has an upper bound for any transmission scheduling policy satisfying the energy causality constraints. We then consider a special symmetric scenario where λis and μis are uniform among transmitters. We propose a randomized longest-connected-queue transmission scheduling policy and show that it achieves the upper bound almost surely as time T approaches infinity, thus it is optimal.

AB - In this paper, we consider an energy harvesting multiple access channel (MAC) where the transmitters are powered by energy harvested from the ambient environment. We assume that the energy harvesting processes at the transmitters can be modeled as independent Bernoulli processes with parameters λis, and the channel states between the transmitters and the receiver are independent Bernoulli processes with parameter μis. An active transmitter always transmits with a fixed power and consumes one unit amount of energy in a time slot. Under the assumption that μi ≥ λi, Ai, our objective is to schedule the transmissions adaptively according to the instantaneous channel and battery states of transmitters, so that the long-term average sum-throughput of the MAC is maximized in expectation. We first show that for a general asymmetric scenario where λis and μis are not identical across the transmitters, the expected long-term average sum-throughput has an upper bound for any transmission scheduling policy satisfying the energy causality constraints. We then consider a special symmetric scenario where λis and μis are uniform among transmitters. We propose a randomized longest-connected-queue transmission scheduling policy and show that it achieves the upper bound almost surely as time T approaches infinity, thus it is optimal.

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

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

U2 - 10.1109/ISIT.2015.7282952

DO - 10.1109/ISIT.2015.7282952

M3 - Conference contribution

AN - SCOPUS:84969850907

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2727

EP - 2731

BT - Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Yang J, Wu J. Online throughput maximization in an energy harvesting multiple access channel with fading. In Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 2727-2731. 7282952. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2015.7282952