The Optimal Packets Scheduling for Buffer-Aid Energy Harvesting RSUs in Cooperative Vehicle Infrastructure System

Table 1

The one-step transition probabilities .

q[n-1]	q[n]		q[n-1]	q[n]
(i, j)	(i-1, (j+ke)∨Qe-1)		(i, j)	(i, j+ke)
(i, j)	(i-1, j-1)		(i, j)	(i, j)
(i, j)	(i+kd -1, j-1)		(i, j)	(i+kd, j)
(i, j)	(i+kd -1, (j+ke)∨Qe-1)		(i, j)	(i+kd, j+ke)
(i, 0)	(i+kd -1, 0)		(i, 0)	(i+kd, 0)
(i, 0)	(i-1, 0)		(i, 0)	(i, 0)
(0, j)	(0, (j+ke)∨Qe)		(0, j)	(0, j)
(i, Qe)	(i-1, Qe-1)		(i, Qe)	(i+kd-1, Qe-1)
(i, Qe)	(i, Qe)		(i, Qe)	(i+kd, Qe)
(i, Qe-1)	(i, Qe)		(0, Qe)	(0, Qe)
(0, Qe-1)	(0, Qe)		(0, 0)	(0, 0)