Access Point Association in Uplink Two-Hop Cellular IoT Networks With Data Aggregators
Bibliographic record
Abstract
Node clustering and data aggregation help extend the coverage of cellular networks and increase the number of supported devices, while meeting the various service quality requirements and reducing energy consumption, making them suitable for enabling the future massive cellular Internet-of-Things (IoT) applications. Consequently, we propose to overlay the cellular network with a layer of data aggregators (DAs) to act as relays. DAs use cellular backhauling, and thus, the network provides both single- and two-hop routes; however, DAs share radio resources with single-hop devices, creating a dependency between the two routes. Thus, the proper design of the DA-enabled network becomes critical for cost effectiveness and efficient radio resource utilization. In this article, we formulate a joint access point association, resources utilization, and energy-efficient communication optimization problem that takes into account various networking factors, such as the number of devices, the number of DAs, the number of available resource units, interference, the transmission power limitation of the devices, DA transmission performance, and channel conditions. The objective is to show the usefulness of data aggregation and shed light on the importance of network design when the number of devices is massive. We propose a coalition game theory-based algorithm PAUSE to transform the optimization problem into a simpler form that can be successfully solved in polynomial time. Different network scenarios are simulated to showcase the effectiveness of PAUSE and to draw observations on cost-effective network design with DAs.
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.001 |
| Bibliometrics | 0.000 | 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".