Two-tier distributed and open loop multi-point cooperation using SCMA
Bibliographic record
Abstract
The fifth generation of cellular wireless networks known as 5G is based on user-centric non-cellular concept where the users are surrounded by many network nodes cooperating to serve the users providing a “cell-center” experience throughout the network. Traditional multi point cooperation techniques often rely on centralized coordination and require different and often stringent requirement on the central controller, backhaul capacity and overall network synchronization. A novel two tiered, open loop and distributed cooperation technique is proposed in this paper where the lower tier with fixed or slowly changing parameters and preferably using SCMA provide a ubiquitous performance to mobile users and users exposed to multiple network nodes, while the higher tier provides service to the users close to the network nodes and maintain the overall network throughput. Users scheduled by the lower tier signaling use joint detection techniques from multiple network nodes. Other users scheduled to the higher tier jointly decode the lower tier signal from one or multiple network nodes before proceeding with the detection of their intended signal. The proposed algorithm is based on distributed scheduling and imposes limited requirements on the central controller and backhaul capacity and does not require stringent network time and frequency synchronization among network nodes. Unlike traditional cooperation techniques, the proposed method is open loop and requires very limited feedback and signaling overhead. Performance evaluations show that the proposed technique provides significant network coverage enhancement especially for high speed mobile users.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 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".