Secrecy-Based Energy-Efficient Data Offloading via Dual Connectivity Over Unlicensed Spectrums
Bibliographic record
Abstract
Offloading cellular mobile users' (MUs') data traffic to small-cell networks is a cost-effective approach to relieve congestion in macrocell cellular networks. However, as many small-cell networks operate in the unlicensed bands, the data offloading might suffer from a security issue, i.e., some eavesdropper could overhear the offloaded data over unlicensed spectrums. This motivates us to investigate a secrecy-based energy-efficient uplink data offloading scheme. Specifically, we consider the recent paradigm of traffic offloading via dual connectivity, which enables an MU to simultaneously deliver traffic to a macro base station (mBS) over the licensed channel and a small-cell access point (sAP) over the unlicensed channel. We formulate an MU's joint optimization of traffic scheduling and power allocation problem, with the objective of minimizing the total power consumption while meeting both the MU's traffic demand and secrecy requirement. Despite the non-convex nature of the joint optimization problem, we propose an efficient algorithm to compute the optimal offloading solution. By evaluating the impact of the MU's secrecy requirement and the eavesdropper's channel condition, we quantify the conditions under which the optimal offloading solution corresponds to the full-offloading and zero-offloading, respectively. Numerical results validate the optimal performance of our proposed algorithm, and show that the optimal offloading can significantly reduce the total power consumption compared with some fixed offloading schemes. Based on the optimal offloading solution for each MU, we further analyze the scenario of multiple MUs and sAPs, and investigate how to optimally exploit the sAPs' total offloading capacity to serve the MUs while accounting for the MUs' corresponding power consumptions for offloading data. To this end, we formulate a total network-benefit maximization problem that accounts for the reward for serving the MUs successfully, the mBS's bandwidth usage, and the MUs' power consumptions. Numerical results show that the optimal solution can improve the total network benefit compared with some heuristic sAP-selection scheme.
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.001 |
| Science and technology studies | 0.000 | 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".