MétaCan
Menu
Back to cohort
Record W2072267094 · doi:10.1109/milcom.2013.219

Inferring Wireless Communications Links and Network Topology from Externals Using Granger Causality

2013· article· en· W2072267094 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
Languageen
FieldEngineering
TopicWireless Communication Security Techniques
Canadian institutionsLockheed Martin (Canada)
Fundersnot available
KeywordsComputer scienceRobustness (evolution)Network topologyInferenceWireless ad hoc networkComputer networkWireless networkWirelessCausality (physics)Granger causalityTopology (electrical circuits)Distributed computingData miningMachine learningArtificial intelligenceTelecommunicationsMathematics

Abstract

fetched live from OpenAlex

This paper presents Granger Causality as a method for inferring communications links among a collection of wireless transmitters from externally measurable features. The link inference method presented relies upon general assumptions that hold true for a wide variety of communications, and is therefore applicable to inferring the link topology of broad classes of wireless networks, regardless of the nature of the Medium Access Control (MAC) protocol used. This technique does not require decoding of data and can be used to infer links based upon features of communications observable from outside the network. We illustrate the use of this method on simulated NS3 data to infer the topology of ad-hoc 802.11 networks. The accuracy, convergence rate, and robustness to noise of link inference are presented for networks of different sizes, link densities, etc.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.872
Threshold uncertainty score0.680

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
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.039
GPT teacher head0.290
Teacher spread0.251 · 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