Answers are grounded in this paper and cite their sources.
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> This paper focuses on energy-efficient packet transmission with individual packet delay constraints. The solution presented herein is a generalization of Uysal-Biyikoglu (2002), which considered energy-efficient transmissions for a group of M packets subject to a single transmission deadline. First, the optimal offline scheduler (vis-À-vis total transmission energy) for packet transmissions with individual packet delay constraints is developed. It is shown that when packet inter-arrival times are independent and identically distributed (i.i.d.), the optimal transmission durations of packet m and packet M-m+1, m ∈ [1,...,M, M ≥ 1, are identically distributed. This symmetry property leads to a simple and exact solution of the average packet delay for any i.i.d. inter-arrival times under the optimal offline scheduling. In addition, the packet delay performance for the single transmission deadline model is analyzed and shown to grow monotonically with M and at a rate proportional to √M. A heuristic online scheduler, which assumes no future arrival information, is also studied and shown to achieve a comparable energy performance to the optimal offline scheduler in a wide range of scenarios. The flexible energy and delay tradeoff provided by the individual delay constraint model is further illustrated via simulations. </para>
No takes yet. Share an insight, caveat, or question.
Chen et al. (2008) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: