2020
DOI: 10.1109/tcomm.2020.3002584
|View full text |Cite
|
Sign up to set email alerts
|

Efficient, Fair, and QoS-Aware Policies for Wirelessly Powered Communication Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
3
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 26 publications
0
3
0
Order By: Relevance
“…Then, letting L → ∞ (46) is simplified to (6) for the cases with asymptotically long codewords. Note that replacing (6) with the modified rate function (46), the results in Theorem 1 are still applicable and our data admission policy remains optimal. However, Algorithm 1 is an approximate solution for data link scheduling Problem (19) with the modified rate function (46).…”
Section: A Finite Blocklength Analysis Of the Proposed Schemementioning
confidence: 95%
See 2 more Smart Citations
“…Then, letting L → ∞ (46) is simplified to (6) for the cases with asymptotically long codewords. Note that replacing (6) with the modified rate function (46), the results in Theorem 1 are still applicable and our data admission policy remains optimal. However, Algorithm 1 is an approximate solution for data link scheduling Problem (19) with the modified rate function (46).…”
Section: A Finite Blocklength Analysis Of the Proposed Schemementioning
confidence: 95%
“…Note that replacing (6) with the modified rate function (46), the results in Theorem 1 are still applicable and our data admission policy remains optimal. However, Algorithm 1 is an approximate solution for data link scheduling Problem (19) with the modified rate function (46). the sensitivity to the error probability decreases.…”
Section: A Finite Blocklength Analysis Of the Proposed Schemementioning
confidence: 95%
See 1 more Smart Citation