Queue size distribution on a new ND policy \(Geo/G/1\) queue and its computation designs (Q2244392)

Summary: This paper examines a new ND policy in the discrete-time \(Geo/G/1\) queue. Under this ND policy, the idle server restarts its service when the N and D policies are simultaneously satisfied. By two classifications of the customers, the probability-generating function and the probabilistic analysis, the steady-state queue size distributions at a departure time and an arbitrary time \(t^+\) are studied. Finally, the theoretical results are applied to the power-saving problem of a wireless sensor network. To improve model universality and numerical slowness, some computation designs are carried out. Under the N, D, and two ND policies, the numerical experiments are presented to obtain the optimal policy thresholds and the corresponding minimum power consumptions are compared.