TY - GEN
T1 - Optimal packet scheduling in a multiple access channel with rechargeable nodes
AU - Yang, Jing
AU - Ulukus, Sennur
PY - 2011
Y1 - 2011
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 departure region at energy arrival epochs, we decompose the transmission completion time minimization problem into a convex optimization problem and solve it 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 departure region at energy arrival epochs, we decompose the transmission completion time minimization problem into a convex optimization problem and solve it efficiently.
UR - http://www.scopus.com/inward/record.url?scp=80052155420&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80052155420&partnerID=8YFLogxK
U2 - 10.1109/icc.2011.5963054
DO - 10.1109/icc.2011.5963054
M3 - Conference contribution
AN - SCOPUS:80052155420
SN - 9781612842332
T3 - IEEE International Conference on Communications
BT - 2011 IEEE International Conference on Communications, ICC 2011
T2 - 2011 IEEE International Conference on Communications, ICC 2011
Y2 - 5 June 2011 through 9 June 2011
ER -