Priority-Based Machine-To-Machine Overlay Network over LTE for a Smart City
Bibliographic record
Abstract
Long-Term Evolution (LTE) and its improvement, Long-Term Evolution-Advanced (LTE-A), are attractive choices for Machine-to-Machine (M2M) communication due to their ubiquitous coverage and high bandwidth. However, the focus of LTE design was high performance connection-based communications between human-operated devices (also known as human-to-human, or H2H traffic), which was initially established over the Physical Random Access Channel (PRACH). On the other hand, M2M traffic is mostly based on contention-based transmission of short messages and does not need connection establishment. As a result, M2M traffic transmitted over LTE PRACH has to use the inefficient four-way handshake and compete for resources with H2H traffic. When a large number of M2M devices attempts to access the PRACH, an outage condition may occur; furthermore, traffic prioritization is regulated only through age-based power ramping, which drives the network even faster towards the outage condition. In this article, we describe an overlay network that allows a massive number of M2M devices to coexist with H2H traffic and access the network without going through the full LTE handshake. The overlay network is patterned after IEEE 802.15.6 to support multiple priority classes of M2M traffic. We analyse the performance of the joint M2M and H2H system and investigate the trade-offs needed to keep satisfactory performance and reliability for M2M traffic in the presence of H2H traffic of known intensity. Our results confirm the validity of this approach for applications in crowd sensing, monitoring and others utilized in smart city development.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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".