Figure 4

Numerical Example 1. A numerical example of optimal schedule for Problem 1. Top figure (a) illustrates the energy harvest and bit arrival sequences and the transmission completion time: 3, 10, 4, 7, 13, 3, 5, 8, 6, and 12 J of energy is harvested at respective times 0, 3, 5, 8, 9, 10, 11, 13, 15, and 17 s; and 8, 25, 12, 20, and 15 Kbits of the strong user data arrive at respective times 0, 2, 4, 8, and 10 s whereas 25 Kbits of the weak user data is ready at the beginning. Optimal schedule finalized at t = 12.903 s by transmitting 80 and 25 Kbits to the the strong and the weak user, respectively. Bottom figure (b) depicts the strong user power level and the total power level during transmission. Blue line represents the total transmitter power level, P _t , whereas the red line represents the power reserved for transmission to the strong user, P _s , during transmission. Total power levels and the strong user power levels are 1.000, 1.000, 2.800, and 5.710 W and 0.150, 0.708, 0.708, and 1.399 W with durations 2, 1, 5, and 4.903 s.