TY - JOUR
T1 - Optimal Packet Scheduling in a Multiple Access Channel with Energy Harvesting Transmitters
AU - Yang, Jing
AU - Ulukus, Sennur
N1 - Funding Information:
This work was supported by NSF Grants CCF 04-47613, CCF 05-14846, CNS 07-16311, CCF 07-29127, CNS 09-64632 and presented in part in [7] at the IEEE International Conference on Communications, Kyoto, Japan, June 2011.
PY - 2012/4/12
Y1 - 2012/4/12
N2 - 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 sequence of maximum departure regions at energy arrival instants, we decompose the transmission completion time minimization problem into convex optimization problems and solve the overall problem efficiently.
AB - 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 sequence of maximum departure regions at energy arrival instants, we decompose the transmission completion time minimization problem into convex optimization problems and solve the overall problem efficiently.
UR - http://www.scopus.com/inward/record.url?scp=85008548585&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85008548585&partnerID=8YFLogxK
U2 - 10.1109/JCN.2012.6253062
DO - 10.1109/JCN.2012.6253062
M3 - Article
AN - SCOPUS:85008548585
SN - 1229-2370
VL - 14
SP - 140
EP - 150
JO - Journal of Communications and Networks
JF - Journal of Communications and Networks
IS - 2
ER -