2013
DOI: 10.1109/twc.2013.040213.121629
|View full text |Cite
|
Sign up to set email alerts
|

Energy-Efficient Transmissions of Bursty Data Packets with Strict Deadlines over Time-Varying Wireless Channels

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
64
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 49 publications
(64 citation statements)
references
References 22 publications
0
64
0
Order By: Relevance
“…In [26], the power allocation was optimized to maximize a bits-per-Joule EE in the conventional singlehop frequency-selective channels under the assumption of nonnegligible constant circuit power. In [27], a string tautening algorithm was proposed to produce the most energy-efficient schedule for delay-limited traffic, first under the assumption of negligible circuit power, and then extended to non-negligible constant circuit powers [28] and energy-harvesting communications [29]. In [30], the rate region of a FD OFDM link was maximized under non-ideal transceivers by modelling the self-interference as an additive error vector magnitude (EVM) noise which was decomposed into the equivalent noises at the two ends of the FD link.…”
Section: Introductionmentioning
confidence: 99%
“…In [26], the power allocation was optimized to maximize a bits-per-Joule EE in the conventional singlehop frequency-selective channels under the assumption of nonnegligible constant circuit power. In [27], a string tautening algorithm was proposed to produce the most energy-efficient schedule for delay-limited traffic, first under the assumption of negligible circuit power, and then extended to non-negligible constant circuit powers [28] and energy-harvesting communications [29]. In [30], the rate region of a FD OFDM link was maximized under non-ideal transceivers by modelling the self-interference as an additive error vector magnitude (EVM) noise which was decomposed into the equivalent noises at the two ends of the FD link.…”
Section: Introductionmentioning
confidence: 99%
“…We also note that the constructed solution satisfies all the constraints in problem (10) and is thereby a feasible solution. Since the case when x * k = 0 is obviously satisfied, we only discuss the case when x * k = 1 in the following.…”
Section: Discussionmentioning
confidence: 83%
“…C5 indicates whether to serve MU k or not. Note that if x k = 0, then from C2 and C4, both b k,n and q k will be forced to be zeros at the optimal solution of problem (10), which means that the SC does not obtain additional bandwidth from MU k and does not serve MU k either. C6 and C7 are non-negativity constraints on the bandwidth and power allocation variables, respectively.…”
Section: Problem Formulation and Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…By employing the cumulative-curves methodology, a calculus approach is proposed in [18] to minimise the transmission energy consumption, which targets to obtain the optimal departure curve. Besides, the multi-user scenario is concerned in [19,20], and the energy-efficient scheduling in time-varying or fading channel is addressed in [21][22][23][24]. In addition to the packet transmission, the energy consumption from the circuit is also considered recently in [25,26].…”
Section: Introductionmentioning
confidence: 99%