MétaCan
Menu
Back to cohort
Record W4375928939 · doi:10.1109/jsac.2023.3273707

Uplink Multiple Access With Semi-Grant-Free Transmission in Integrated Satellite-Aerial-Terrestrial Networks

2023· article· en· W4375928939 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Journal on Selected Areas in Communications · 2023
Typearticle
Languageen
FieldEngineering
TopicSatellite Communication Systems
Canadian institutionsConcordia University
FundersNanjing University of Posts and TelecommunicationsGovernment of Jiangsu Province
KeywordsComputer scienceTelecommunications linkChannel state informationTransmission (telecommunications)Computer networkSpace-division multiple accessThroughputChannel (broadcasting)TelecommunicationsWireless

Abstract

fetched live from OpenAlex

This paper investigates a semi-grant-free (SGF) based transmission strategy to provide a flexible connectivity for various kinds of users in an integrated satellite-aerial-terrestrial network (ISATN). Herein, a high-altitude platform (HAP) termed as a grant-based user (GBU), which serves multiple mobile terminals (MTs) through space division multiple access (SDMA), wants to access a satellite network with multiple earth stations (ESs) termed as grant-free users (GFUs) simultaneously via non-orthogonal multiple access (NOMA) assisted SGF. To this end, we first propose two SGF-based uplink transmission schemes for both perfect channel state information (CSI) and imperfect CSI cases. When perfect CSI is available, a zero-forcing based beamforming (BF) scheme is used in HAP network while an adaptive transmit power allocation (ATPA) approach is adopted for SGF transmission. When only imperfect CSI is available, BF scheme employing the derived channel correlation matrix of HAP-MT link is proposed to achieve SDMA, and a novel ATPA strategy with rate probability constraint is proposed to guarantee quality-of-service of the GBU. Next, we derive the closed-form throughput expressions to evaluate the performance of the considered ISATN with the proposed two SGF-based schemes. Finally, computer simulations are conducted to validate the theoretical performance analysis and show the superiority of the proposed schemes over the related works. Moreover, our numerical results not only demonstrate a satisfactory performance of the proposed SGF-based scheme using imperfect CSI, but also reveal the impact of CSI errors on the system performance.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.077
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.005
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0040.000
Research integrity0.0000.002
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.057
GPT teacher head0.297
Teacher spread0.241 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it