2022
DOI: 10.1109/tccn.2022.3164928
|View full text |Cite
|
Sign up to set email alerts
|

Cooperative Hybrid Nonorthogonal Multiple Access-Based Mobile-Edge Computing in Cognitive Radio Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
15
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 41 publications
(15 citation statements)
references
References 49 publications
0
15
0
Order By: Relevance
“…In this work, q is initialized randomly, and p is initially set to the maximum nominal value. The following steps are then Algorithm 1 Centralized Resource Management 1: Initialize q and p to feasible values Repeat: until convergence 2: Update weights β using ( 24), (35) 3: Update q, r, z, and p using the previous solution 4: Update auxiliary variables a using ( 46)-( 49) 5: Solve convex optimization problem (50) 6: End repeated until convergence, i.e., until the sum-logarithmic rate increase between iterations falls below a certain threshold ω. The CRM updates the weights β…”
Section: Centralized Resource Management (Crm) Protocolmentioning
confidence: 99%
See 2 more Smart Citations
“…In this work, q is initialized randomly, and p is initially set to the maximum nominal value. The following steps are then Algorithm 1 Centralized Resource Management 1: Initialize q and p to feasible values Repeat: until convergence 2: Update weights β using ( 24), (35) 3: Update q, r, z, and p using the previous solution 4: Update auxiliary variables a using ( 46)-( 49) 5: Solve convex optimization problem (50) 6: End repeated until convergence, i.e., until the sum-logarithmic rate increase between iterations falls below a certain threshold ω. The CRM updates the weights β…”
Section: Centralized Resource Management (Crm) Protocolmentioning
confidence: 99%
“…Algorithm 2 Distributed Resource Management 1: Initialize q and p to feasible values Repeat: until convergence 2: Update weights β using ( 24), (35) 3: Update q, r, z, and p using the previous solution 4: Update auxiliary variables a using ( 46)-( 49 variables at each EC e. The DRM's upper-bound computational complexities for the CC and for each EC e become, therefore, O(Ω max (η c ) 3.5 ) and O(Ω max (η e ) 3.5 ), respectively. For completeness, the complexities of CRM and DRM are compared in Table II.…”
Section: E Distributed Resource Management (Drm) Protocolmentioning
confidence: 99%
See 1 more Smart Citation
“…Recently, Yuo et al [11] studied the EE and SE tradeoff in RIS-aided MIMO network, where an iterative mean-square error minimization approach was developed to optimize the phase shifter. On the other hand, in [12], Wang et al studied the cooperative hybrid NOMA-based mobile-edge computing networks. In [13], Wang et al studied the delay-sensitive secure NOMA transmission for Internet-of-Things (IoT) networks.…”
Section: Introductionmentioning
confidence: 99%
“…As a powerful supplement to the upper layer encryption techniques, the physical layer security (PLS) technology uses the physical layer characteristics of the channel itself to improve the secrecy performance. While ensuring the secure and reliable communication of the legitimate receiver, it tries to avoid the effective eavesdropping of eavesdroppers [ 1 , 2 , 3 , 4 ]. PLS technology in UAV communication networks can achieve secure transmission with low energy consumption through the differentiated design of wireless channels.…”
Section: Introductionmentioning
confidence: 99%