MétaCan
Menu
Back to cohort
Record W2042370751 · doi:10.1109/vetecf.2011.6093200

Distributed Detection in UWB Sensor Networks under Non-Orthogonal Nakagami-m Fading

2011· article· en· W2042370751 on OpenAlexaff
Abolfazl Mehbodniya, Daniel Bielefeld, Sonia Aı̈ssa, Rudolf Mathar, Fumiyuki Adachi

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed Sensor Networks and Detection Algorithms
Canadian institutionsInstitut National de la Recherche ScientifiqueUniversité du Québec à Montréal
Fundersnot available
KeywordsNakagami distributionFadingFusion centerComputer scienceWireless sensor networkTransmitterUltra-widebandWirelessComputer networkChannel state informationElectronic engineeringTransmitter power outputChannel (broadcasting)Real-time computingCognitive radioTelecommunicationsEngineering

Abstract

fetched live from OpenAlex

Several attractive features of ultra wideband (UWB) communications make it a good candidate for physical-layer of wireless sensor networks (WSN). These features include low power consumption, low complexity and low cost of implementation. In this paper, we present an opportunistic power assignment strategy for distributed detection in parallel fusion WSNs, considering a Nakagami-m fading model for the communication channel and time-hopping (TH) UWB for the transmitter circuit of the sensor nodes. In a parallel fusion WSN, local decisions are made by local sensors and transmitted through wireless channels to a fusion center. The fusion center processes the information and makes the final decision. Simulation results are provided for the global probability of detection error and relative performance gain to evaluate the efficiency of the proposed power assignment strategy in different fading environments.

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.004
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: Empirical · Consensus signal: none
Teacher disagreement score0.001
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.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.019
GPT teacher head0.216
Teacher spread0.197 · 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
GenreEmpirical

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

Citations2
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicDistributed Sensor Networks and Detection AlgorithmsFrench-language works237,207