Dynamic Access Point and Service Selection in Backscatter-Assisted RF-Powered Cognitive Networks
Bibliographic record
Abstract
In this paper, we investigate the dynamic access point and service selection in a backscatter-assisted radio-frequency-powered cognitive network, where many secondary transmitters (STs) can choose different transmission services provided by multiple access points. To analyze the access point and service selection of the STs, we formulate the problem as an evolutionary game. The STs act as the players and adjust their selections of the access points and services based on their utilities. Specifically, we model the access point and service adaptation of the STs by the replicator dynamics, and analytically prove the existence and uniqueness, and the stability of the evolutionary equilibrium. We also consider the delay of information used by the STs to adapt their selection and perform the analysis by using delayed replicator dynamics. In particular, the stability region of the delayed replicator dynamics in a special case is derived. Furthermore, we develop a low-complexity algorithm for the access point and service selection in the network based on evolutionary game. Extensive simulations have been conducted to demonstrate the effectiveness of the proposed access point and service selection strategy in the network.
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.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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".