MétaCan
Menu
Back to cohort
Record W1500765646 · doi:10.1002/sec.877

Mechanisms to locate noncooperative transmitters in wireless networks based on residual signal strengths

2013· article· en· W1500765646 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

VenueSecurity and Communication Networks · 2013
Typearticle
Languageen
FieldEngineering
TopicIndoor and Outdoor Localization Technologies
Canadian institutionsÉcole de Technologie Supérieure
Fundersnot available
KeywordsTransmitterComputer scienceResidualBounding overwatchPosition (finance)AlgorithmSIGNAL (programming language)Transmitter power outputSet (abstract data type)Wireless sensor networkTelecommunicationsMathematical optimizationArtificial intelligenceComputer networkMathematics

Abstract

fetched live from OpenAlex

Abstract This paper proposes new mechanisms for locating or tracking a noncooperative and immobile transmitter in wireless communication networks. They rely on a set of trusted cooperative receivers that are able to measure the residual strengths of the received signals from the transmitter. These mechanisms cannot rely on the information provided by the transmitter because the latter can be malicious. The best solution presented in the literature to solve this problem is the hyperbolic position bounding algorithm. Unfortunately, it uses an inaccurate approximation of the difference of two log‐normal random variables. When the uncertainty on the effective isotropic radiated power used by the transmitter is high, the hyperbolic position bounding algorithm gives erroneous results. Thus, we propose new algorithms that rely either on better approximations or a geometric interpretation of the problem. We also evaluate the impacts of using multiple independent signals to detect the transmitter. Copyright © 2013 John Wiley & Sons, Ltd.

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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.857
Threshold uncertainty score0.771

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.0000.000
Research integrity0.0000.001
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.006
GPT teacher head0.197
Teacher spread0.191 · 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