Minimizing Secrecy Outage Probability in Multiuser Wireless Systems With Stochastic Traffic
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.
Bibliographic record
Abstract
We first extend the definition of the secrecy outage probability to wireless systems with adaptive transmission rates and secrecy rates. Then, we consider a scheduling problem in the aforementioned system, jointly considering the reliability, security, and stability, where the scheduler tries to allocate wireless resources to the legitimate users, stabilize the system, and minimize the secrecy outage probability. A stochastic network optimization framework is used to decompose the problem, and an online algorithm is proposed. We further consider a related problem, discuss the optimal solution, and show that the proposed algorithm cannot lead to optimal solution in some scenarios. By comparing the offline algorithm with our first algorithm, we further propose a second refined online algorithm, which is an optimal one. Extensive simulations are conducted to show the impact of the information arrival rate and the channel conditions on the system secrecy outage probability. These observations provide important insights and guidelines for the design and resource management of future wireless networks using secure communication technologies.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it