Figure 5
From: Optimal offline broadcast scheduling with an energy harvesting transmitter
Numerical Example 2. A numerical example of optimal schedule for Problem 1. Top figure illustrates the energy harvest and bit arrival sequences and the transmission completion time: 1, 2, 1, 2, 2, 1, and 2 J of energy is harvested at times 0, 2, 5, 7, 8, 10, and 12 and 15, 12, and 8 Kbits of the strong user data arrives at 0, 5, and 8 s whereas 2, 6, and 12 Kbits of the weak user data arrives at 0, 2, and 5 s. Optimal schedule finalize at t = 9.531 s by transmitting 35 and 20 Kbits to the strong and the weak users, respectively. Bottom figure 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 0.254, 0.297, 1.300, 1.580, and 1.580 and 0.111, 0.051, 0.150, 0.150, and 0.364 W with durations 2, 3, 2, 1, and 1.531 s, respectively.