Multi-Antenna Covert Communication With Jamming in the Presence of a Mobile Warden
Bibliographic record
Abstract
Covert communication can hide the information transmission process from the warden to prevent adversarial eavesdropping. However, it becomes challenging when the warden can move. In this paper, we propose a covert communication scheme against a mobile warden, which maximizes the connectivity throughput between a multi-antenna transmitter and a full-duplex jamming receiver with the covert outage probability (COP) limit. First, we analyze the monotonicity of the COP to obtain the optimal location the warden can move. Then, under this worst situation, we optimize the transmission rate, the transmit power and the jamming power of covert communication to maximize the connection throughput. This problem is solved in two stages. Under this worst situation, we first maximize the connection probability over the transmit-to-jamming power ratio within the maximum allowed COP for a fixed transmission rate. Then, the Newton's method is applied to maximize the connection throughput via optimizing the transmission rate iteratively. Simulation results are presented to evaluate the effectiveness of the proposed scheme.
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 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.000 | 0.000 |
| 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.000 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".