Optimal packet scheduling in a multiple access channel with rechargeable nodes

Jing Yang, Sennur Ulukus

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

48 Scopus citations

Abstract

In this paper, we investigate the optimal packet scheduling problem in a two-user multiple access communication system, where the transmitters are able to harvest energy from the nature. Under a deterministic system setting, we assume that the energy harvesting times and harvested energy amounts are known before the transmission starts. For the packet arrivals, we assume that packets have already arrived and are ready to be transmitted at the transmitter before the transmission starts. Our goal is to minimize the time by which all packets from both users are delivered to the destination through controlling the transmission powers and transmission rates of both users. We first develop a generalized iterative backward waterfilling algorithm to characterize the maximum departure region of the transmitters for any given deadline T. Then, based on the departure region at energy arrival epochs, we decompose the transmission completion time minimization problem into a convex optimization problem and solve it efficiently.

Original languageEnglish (US)
Title of host publication2011 IEEE International Conference on Communications, ICC 2011
DOIs
StatePublished - 2011
Event2011 IEEE International Conference on Communications, ICC 2011 - Kyoto, Japan
Duration: Jun 5 2011Jun 9 2011

Publication series

NameIEEE International Conference on Communications
ISSN (Print)0536-1486

Other

Other2011 IEEE International Conference on Communications, ICC 2011
Country/TerritoryJapan
CityKyoto
Period6/5/116/9/11

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Optimal packet scheduling in a multiple access channel with rechargeable nodes'. Together they form a unique fingerprint.

Cite this