6G-Enabled Mobile Access Point Placement via Dynamic Federated Learning Strategies
Bibliographic record
Abstract
Advanced Indoor Positioning Systems (IPS) based on Received Signal Strength (RSS) fingerprints have been paramount in 6G network research and commercial exploitation due to their cost-effectiveness and simplicity. Despite their popularity, the advent of 6G has prompted a shift towards exploring Deep Learning algorithms to further enhance their performance and precision. Deep Learning research typically demands large datasets, leading to reliance on data augmentation and crowdsourcing techniques for data collection. However, the traditional centralization of data in crowdsourcing poses privacy risks, and here is where Federated Learning (FL) comes into play. In light of this, our study introduces FL to bridge this divide in a decentralized way, eliminating the need for servers to acquire labeled data directly from users. This approach aims to minimize localization error in RSS fingerprints, preserve user privacy, and reduce system latency, all key goals for 6G networks. Moreover, we explore the use of power transmission techniques to further decrease the latency in the FL system. Our simulation outcomes confirm the superiority of FL over traditional Stochastic Gradient Descent (SGD) methods considering critical evaluation metrics like localization error and global loss, paving the way for efficient 6G implementation.
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.001 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".