Joint Computation Offloading and Radio Resource Allocations in Wireless Cellular Networks
Bibliographic record
Abstract
Mobile computation offloading (MCO) is an emerging technology to migrate resource-intensive computations from resource-limited mobile devices to resource-rich devices (such as a cloud server) via wireless access. For applications that are time sensitive, offloading to nearby cloudlets is preferred, compared to offloading to a remote cloud server, in order to save the data transmission delay. On the other hand, the limited computing capabilities and the wireless transmission conditions to access the cloudlet servers can both affect the offloading performance, especially when multiple users are competing for offloading services. In this paper, we study joint computation offloading and radio resource allocations in small cell cellular systems, where cloudlet servers are colocated at the base stations. Our objective is to minimize the total energy consumption of the system, for both data transmissions and task executions, subject to the hard latency requirements of the applications. The problem is first formulated as a mixed integer nonlinear optimization problem, and then decomposed into multiple power allocation subproblems and an offloading decision subproblem. The power allocation subproblems are non-convex, which are reformulated and solved iteratively. Their results are fed into the offloading decision subproblem, which then becomes a linear integer (bi- nary) problem, and can be converted into a matching problem and solved using a modified Kuhn-Munkres (K-M) algorithm. Simulation results demonstrate that the joint optimization can significantly improve the offloading efficiency, compared to other resource allocation methods.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".