MétaCan
Menu
← Back to cohort

Optimal Link Configuration for Covert Heterogeneous Wireless Networks with Power Constraints

2025· article· en· W4409156140 on OpenAlexaff
Amna Gillani, Beatriz Lorenzo, Majid Ghaderi, Fikadu T. Dagefu, Dennis Goeckel

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsUniversity of Calgary
FundersNational Science Foundation
KeywordsComputer scienceComputer networkWireless networkLink (geometry)WirelessPower (physics)CovertDistributed computingRadio networksTelecommunications

Abstract

fetched live from OpenAlex

Heterogeneous Networks (HetNets) leverage multiple communication interfaces (e.g., Wi-Fi, cellular, Bluetooth) seamlessly integrated to enhance connectivity and capacity across diverse environments. These capabilities can be advantageous for covert communication, where the objective is to ensure undetectable transmission in the presence of an adversary. This work investigates optimal power allocation strategies for covert communication within HetNets under maximum power constraints. We propose a polynomial-time (m2) algorithm for optimal link configuration by allocating power across multiple modes. Next, we address network-level covertness by allocating the end-to-end covertness constraint across links in a two-hop system that maximizes throughput. Leveraging the link configuration approach, we derive the optimal power allocation for each mode and link, ensuring the overall transmission remains undetectable. Numerical results demonstrate that the proposed method outperforms existing single-link and two-hop approaches, achieving higher efficiency and security in covert communication across HetNets.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.002
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.017
GPT teacher head0.266
Teacher spread0.249 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicCooperative Communication and Network Coding→French-language works237,207→