MétaCan
Menu
Back to cohort

Secrecy-Driven Robust Beamforming Under Age of Information Constraints for Satellite-Terrestrial Integrated Networks

2025· article· W7125893818 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

Venuenot available
Typearticle
Language
FieldComputer Science
TopicAge of Information Optimization
Canadian institutionsWestern University
Fundersnot available
KeywordsEavesdroppingProbabilistic logicBeamformingArtificial noisePhysical layerRobustness (evolution)Channel state informationChannel (broadcasting)Secrecy

Abstract

fetched live from OpenAlex

This paper presents a robust secure beamforming (BF) strategy that incorporates information freshness into the physical layer security (PLS) design of satellite-terrestrial integrated network (STIN). In the considered framework, satellite networks serve earth stations in the presence of multiple eavesdroppers, while terrestrial networks, operating over the same spectrum, provide multicast services to ground users. To capture the dynamics of status update timeliness, we model the evolution of the Age of Information (AoI) using a discrete-time Markov chain, taking into account both the activation thresholds and access probabilities of users. Based on this model, we derive a closed-form expression for the secrecy margin of the wiretap channel, thereby jointly quantifying data freshness and communication security. Assuming imperfect channel state information, we formulate an optimization problem to maximize the average secrecy margin, subject to constraints on average AoI, quality of service (QoS), eavesdropping probability, and total transmit power. To tackle the inherent non-convexity caused by probabilistic constraints, we adopt Bernstein-type inequalities to transform them into tractable deterministic equivalents. An efficient solution algorithm is then developed by integrating successive convex approximation with difference-of-convex programming, enabling effective computation of the optimal BF vectors. Extensive simulation results confirm that the proposed approach achieves notable improvements over existing methods in both secrecy performance and information freshness, offering a unified and practical solution for secure and timely communication in future 6 G integrated networks.

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: Methods · Consensus signal: none
Teacher disagreement score0.546
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.0010.000
Bibliometrics0.0010.002
Science and technology studies0.0000.000
Scholarly communication0.0010.006
Open science0.0010.000
Research integrity0.0000.000
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.019
GPT teacher head0.246
Teacher spread0.227 · 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

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicAge of Information OptimizationFrench-language works237,207