MétaCan
Menu
Back to cohort
Record W2016330401 · doi:10.1145/1815396.1815614

Proxying location update for idle mode interfaces

2010· article· en· W2016330401 on OpenAlexaff
Hicham Mahkoum, Abdelhakim Hafid, Behçet Sarikaya

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsUniversité de Montréal
Fundersnot available
KeywordsIdlePagingComputer scienceInterface (matter)Computer networkReal-time computingNode (physics)Air interfaceBase stationOperating systemEngineering

Abstract

fetched live from OpenAlex

In cellular networks it is the mobile node's responsibility to update the network about its location change, especially when this one enters idle mode. We developed a new framework [8] where the idle interface is powered-off to save energy and thus could neither detect its location change nor perform a location update. This framework uses a proxy entity at the network and at the mobile node the active radio interface for proxying the idle interface. In this paper, we present an approach that relies on the proxy entity and the active interface for proxying the location update procedure of the proxied interfaces. More specifically, we propose two algorithms. The first algorithm considers proxying periodic location update of idle interface without considering its mobility if there is any. The second algorithm is based on sending the location to the Information Server which determines the list of paging/tracking areas that serves the current location. We present the design of our architecture for 4G systems, namely WiMAX and LTE. The algorithms are analytically evaluated to evaluate the power savings compared with single-radio power management.

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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.957
Threshold uncertainty score0.284

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.001
Open science0.0020.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.026
GPT teacher head0.335
Teacher spread0.309 · 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
GenreMethods

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

Citations1
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Networks ResearchFrench-language works237,207