MétaCan
Menu
Back to cohort
Record W2056211689 · doi:10.1109/icuwb.2015.7324447

Energy-Efficient Robust Resource Provisioning in Virtualized Wireless Networks

2015· article· en· W2056211689 on OpenAlexaff
Vikas Jumba, Saeedeh Parsaeefard, Mahsa Derakhshani, Tho Le‐Ngoc

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced MIMO Systems Optimization
Canadian institutionsUniversity of TorontoMcGill University
Fundersnot available
KeywordsComputer scienceQuality of serviceMathematical optimizationBase stationResource allocationChannel state informationProvisioningWirelessEfficient energy useWireless networkRobustness (evolution)Computational complexity theoryDistributed computingComputer networkAlgorithmTelecommunicationsEngineeringMathematics

Abstract

fetched live from OpenAlex

This paper proposes a robust resource allocation approach in virtualized wireless networks (VWNs) to address the uncertainty in channel state information (CSI) at the base station (BS) due to estimation error and mobility of users. In this set-up, the resources of an OFDMA-based wireless network are shared among different slices where the minimum reserved rate is considered as the quality-of-service (QoS) requirement of each slice. We formulate the robust resource allocation problem against the worst-case CSI uncertainty, aiming to maximize the overall energy efficiency (EE) of VWN in terms of a newly defined slice utility function. Uncertain CSI is modeled as the sum of its true estimated value and an error assumed to be bounded in a specific uncertainty region. The formulated problem suffers from two major issues: computational complexity and energy-efficiency degradation due to the considered error in the maximum extent. To deal with these issues, we consider a specific form of uncertainty region to solve the robust resource allocation problem via an iterative algorithm. The simulation results demonstrate the effectiveness of the proposed algorithms.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.983
Threshold uncertainty score0.503

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.014
GPT teacher head0.208
Teacher spread0.194 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations11
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced MIMO Systems OptimizationFrench-language works237,207