Spectrum Management for Multi-Access Edge Computing in Autonomous Vehicular Networks
Bibliographic record
Abstract
In this paper, a dynamic spectrum management framework is proposed to improve spectrum resource utilization in a multi-access edge computing (MEC) in autonomous vehicular network (AVNET). To support the increasing communication data traffic and guarantee quality-of-service (QoS), spectrum slicing, spectrum allocating, and transmit power controlling are jointly considered. Accordingly, three non-convex network utility maximization problems are formulated to slice spectrum among base stations (BSs), allocate spectrum among autonomous vehicles (AVs) associated with a BS, and control transmit powers of BSs, respectively. Through linear programming relaxation and first-order Taylor series approximation, these problems are transformed into tractable forms and then are jointly solved through an alternate concave search (ACS) algorithm. As a result, the optimal spectrum slicing ratios among BSs, optimal BS-vehicle association patterns, optimal fractions of spectrum resources allocated to AVs, and optimal transmit powers of BSs are obtained. Based on our simulation, a high aggregate network utility is achieved by the proposed spectrum management scheme compared with two existing schemes.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| 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".