Learning MAC Protocols in HetNets: A Cooperative Multi-Agent Deep Reinforcement Learning Approach
Bibliographic record
Abstract
Traditional human-designed medium access control (MAC) protocols cannot tackle the heterogeneous requirements of the future 6G wireless networks. Reinforcement learning (RL) algorithms have been proposed, in which base stations (BSs) and user equipment's (UEs) act as agents to automatically learn the MAC protocols to satisfy the stringent quality of service (QoS) requirements of 6G networks. However, existing RL techniques result in a generalization issue where agents fail to identify and explore useful information in a sparse wireless environment. To tackle this challenge, we propose a cooperative multi-agent exploration (CMAE) framework in which the network state space is projected into a low-dimensional space instead of learning a policy in a high-dimensional space. Consequently, the agents start exploring from low-dimensional state space to high-dimensional space to learn the abstracted information from the wireless environment. In the proposed framework, the nodes and BSs collaborate to explore the under-explored wireless network states to jointly learn the channel access and signalling policy. Simulation results show that the proposed CMAE framework outperforms traditional baseline schemes in terms of good put and collision rate and has better generalization capabilities.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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 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".