2021
DOI: 10.1109/jiot.2020.3010533
|View full text |Cite
|
Sign up to set email alerts
|

Survivable Task Allocation in Cloud Radio Access Networks With Mobile-Edge Computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
8
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(8 citation statements)
references
References 48 publications
0
8
0
Order By: Relevance
“…For given R dl k , the downlink edge latency τ dl E,k of UE k is given as (20). For the non-orthogonal multiple access scheme as described above, we aim at jointly optimizing the variables p, Q, c, F and C F with the goal of minimizing the total latency τ T in (22). The problem can be written as…”
Section: B Non-orthogonal Multiple Accessmentioning
confidence: 99%
See 2 more Smart Citations
“…For given R dl k , the downlink edge latency τ dl E,k of UE k is given as (20). For the non-orthogonal multiple access scheme as described above, we aim at jointly optimizing the variables p, Q, c, F and C F with the goal of minimizing the total latency τ T in (22). The problem can be written as…”
Section: B Non-orthogonal Multiple Accessmentioning
confidence: 99%
“…However, it was assumed in [21] that the physical-layer (PHY) functionalities, which include channel encoding and decoding, are located only at ENs. In [22], the authors addressed the task allocation and traffic path planning problem for a C-RAN system under the assumption that the service latency consists of task processing delay and path delay only on fronthaul links.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…For given R dl k , the downlink edge latency τ dl E,k of UE k is given as (20). For the non-orthogonal multiple access scheme as described above, we aim at jointly optimizing the variables p, Q, c, F and C F with the goal of minimizing the total latency τ T in (22). The problem can be written as…”
Section: B Non-orthogonal Multiple Accessmentioning
confidence: 99%
“…However, it was assumed in [21] that the physicallayer (PHY) functionalities, which include channel encoding and decoding, are located only at ENs. In [22], the authors addressed the task allocation and traffic path planning problem for a C-RAN system under the assumption that the service latency consists of task processing delay and path delay only on fronthaul links.…”
mentioning
confidence: 99%