A Resource-Efficient Coexistence Scheme for Massive Machine-Type and Human-to-Human Communications
Bibliographic record
Abstract
The fifth-generation (5G) and beyond networks are expected to accommodate both the original human-to-human (H2H) communication and the emerging massive machine-type communication (mMTC). To enable a harmonious coexistence between the two different types of services, we propose a resource-efficient mMTC/H2H coexistence scheme by jointly considering the random access (RA) and data transmission, where the entire uplink resources are divided for the proposed RA and data transmission procedures. Based on the proposed scheme, we derive the average achievable throughput of the bursty mMTC service and develop a time-nonhomogeneous Markov chain model to characterize the joint state transition of H2H user equipments (HUEs). To tackle the cumbersome Markov model, we approximately decompose the constructed time-nonhomogeneous Markov model into multiple independent Markov chains, where each decomposed Markov chain characterizes one single HUE’s state transition. Then, the decomposed Markov model is transformed into a semi-Markov process and the corresponding steady-state condition is obtained based on the queueing network analysis for H2H service. By approximating the evolution of number of HUEs in different states as M/M/1 queues, we derive the stationary probabilities for the embedded Markov chain of the semi-Markov process and obtain the data transmission success probability of each HUE. Based on the abovementioned analytical framework, we formulate a constrained nonlinear integer programming (NLIP) problem to maximize the mMTC throughput under the constraints of H2H quality-of-service (QoS) stabilization and resource allocation. By adopting the modified particle swarm optimization (PSO) algorithm, we solve the formulated problem and obtain the efficient resource allocation strategy for the mMTC/H2H coexistence. Simulation results demonstrate that the developed analytical framework and modified PSO algorithm achieve close to the optimal mMTC/H2H coexisting performance and can be adapted to various network settings.
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.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".