Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Energy-Efficient Transmission Schedule for Delay-Limited Bursty Data Arrivals under Non-Ideal Circuit Power Consumption (1403.4597v2)

Published 18 Mar 2014 in cs.IT and math.IT

Abstract: This paper develops a novel approach to obtaining energy-efficient transmission schedules for delay-limited bursty data arrivals under non-ideal circuit power consumption. Assuming a-prior knowledge of packet arrivals, deadlines and channel realizations, we show that the problem can be formulated as a convex program. For both time-invariant and time-varying fading channels, it is revealed that the optimal transmission between any two consecutive channel or data state changing instants, termed epoch, can only take one of the three strategies: (i) no transmission, (ii) transmission with an energy-efficiency (EE) maximizing rate over part of the epoch, or (iii) transmission with a rate greater than the EE-maximizing rate over the whole epoch. Based on this specific structure, efficient algorithms are then developed to find the optimal policies that minimize the total energy consumption with a low computational complexity. The proposed approach can provide the optimal benchmarks for practical schemes designed for transmissions of delay-limited data arrivals, and can be employed to develop efficient online scheduling schemes which require only causal knowledge of data arrivals and deadline requirements.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Zheng Nan (5 papers)
  2. Tianyi Chen (139 papers)
  3. Xin Wang (1307 papers)
  4. Wei Ni (115 papers)
Citations (23)

Summary

We haven't generated a summary for this paper yet.