MétaCan
Menu
Back to cohort
Record W2144087372 · doi:10.1109/dcossw.2010.5593285

Interconnecting WirelessHART and legacy HART networks

2010· article· en· W2144087372 on OpenAlexfundno aff
Shahid Raza, Thiemo Voigt

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNetwork Time Synchronization Technologies
Canadian institutionsnot available
FundersFederation for the Humanities and Social Sciences
KeywordsComputer networkComputer scienceDefault gatewayWireless sensor networkEmbedded system

Abstract

fetched live from OpenAlex

WirelessHART is a novel standardized wireless sensor network protocol for industrial process automation. The WirelessHART protocol is designed with the aim to complement the HART protocol by providing wireless extension to it. However, due to the different physical and data-link layers the two protocols are not directly interoperable. WirelessHART is based on IEEE 802.15.4 mesh networks whereas HART is a 4-20mA analog wired protocol. Keeping in view the huge installations of HART networks throughout the world we feel the need to integrate HART and WirelessHART networks as the WirelessHART standard does not specify the means to securely connect the two networks. In this paper we provide different options to integrate Wire-lessHART and legacy HART networks. We start integrating the two networks using a gateway. However, gateway based integrations are sometimes not feasible and are insecure. The main contribution of this paper is that we provide a novel and comparatively secure solution to interconnect WirelessHART networks with HART networks. We specify and design a new WirelessHART Integrator that extends the capabilities of the WirelessHART adapter and provides integration at the network level rather than at the device level only. We also analyze and compare our solution with gateway and adapter based solutions.

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.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.002
Open science0.0010.002
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0020.001

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.005
GPT teacher head0.203
Teacher spread0.198 · 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 designBench or experimental
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

Citations12
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicNetwork Time Synchronization TechnologiesFrench-language works237,207