Generalizable Deep Reinforcement Learning-Based Intelligent Handover in Indoor WiGig Networks
Bibliographic record
Abstract
The dynamic nature of user mobility and density in indoor WiGig networks poses a significant challenge to seamless handover, particularly in the 60 GHz band, where small and closely clustered channel gain values hinder effective decision-making. To address this, we propose a generalizable deep reinforcement learning (DRL)-based handover that integrates a novel reward function designed to amplify channel gain differentials, thereby improving the convergence speed and decision accuracy of learning agents. We investigate the performance of state-of-the-art DRL algorithms—Deep Q-Network (DQN), Proximal Policy Optimization (PPO), and Advantage Actor-Critic (A2C)—enhanced through advanced hyperparameter-tuning techniques, including grid search, random search, optuna, and hyperopt. Among these, DQN combined with grid search yields the best overall performance, surpassing A2C by 48% in average rolling reward and achieving 32% faster convergence than PPO.To assess generalization, we evaluate the merged DQN agent trained across varying user density scenarios (1–8 users) against expert agents specialized for individual densities and a high-density-trained agent tested across all scenarios. Our results reveal that the merged agent exhibits robust and consistent performance across all densities, indicating strong generalization capability. In contrast, the high-density agent suffers performance degradation of up to 13% when exposed to unseen scenarios, underscoring its limited adaptability. While expert agents perform optimally within their specific environments, their deployment complexity renders them impractical for real-time systems. These findings highlight the importance of training DRL agents across diverse scenarios to achieve scalable and generalizable handover solutions in dense and dynamic WiGig networks.
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.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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 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".