Edge computing and power control in NOMA‐enabled cognitive radio networks
Bibliographic record
Abstract
Abstract Due to the limited computation resources of mobile devices in cognitive radio networks, the secondary users in the network can suffer from long executing time, which is not acceptable for latency‐sensitive and computation‐intensive tasks. To tackle this issue, this paper proposes to reduce the task computing latency for secondary networks by offloading the tasks to edge servers through leveraging mobile edge computing (MEC) that is emerging as a promising technology to augment the computation capacity of mobile devices. Specifically, under the conditions that the interference caused by secondary users is tolerable to primary user and within the available computation resources of the MEC server, the primary user and secondary users both can offload tasks to the MEC server through nonorthogonal multiple access. Thus, we jointly formulate the offloading decision and power control as an optimization problem, aiming at minimizing the overall computing latency for secondary networks. To overcome the computational complexity caused by the nonconvexity of the original problem, we transform the original problem to a solvable problem and decouple the transformed problem into the separate offloading decision and power control. An iterative algorithm is proposed based on block coordinate decent method to achieve the near‐optimal solution. Simulation results show that under the same parameters, such as the number of primary users, maximum transmit power, computational capability of the MEC server and the computational capability of the secondary users, the proposed NOMA‐enabled computation offloading scheme can effectively reduce the overall computing latency for the secondary network and improve the percentage of offloading secondary users than those of OMA‐enabled.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".