Throughput optimal policy is defined as a policy that can keep the queues stable for all users in the system, providing this is at all made feasible with any of the scheduling policies.
We focus on optimal throughput scheduling policies for the cooperative relaying at the network layer level.
The same setup is studied in [4] without data arrivals, and dynamic programming is used to find throughput maximizing policies.
Note that since we consider cumulative discounted reward, the total system throughput under a policy π, in packets delivered per time slot, is (1−γ R π.
We compare the maximum throughput of our policy to various harvesting architectures in Figure 4, where each throughput point is obtained by averaging over 1,000 random harvested energy data in Rayleigh fading of unit power.
Objectives: To determine the effect on patient throughput of a policy of routine vitamin supplementation, and of early routine sipfeed supplementation in 'thin' patients (5 10% weight loss or body mass index 18 22).
In this case, we also set the energy budget of each SU is 5 J. Obviously, the throughput of our policy increases significantly with the increase number of time slot.
Therefore, in this paper, in addition to comparing the system throughput under different policies, we introduce the notion of robustness of scheduling policies.
Figure 9 The throughput under three policies with different weight factors.
