ArticleSensors (Basel, Switzerland)2026
TA-BI: A Formal Observation-to-Decision Architecture for Trust-Aware Routing Support in Wireless and Mobile Wireless Sensor Networks.
Article in Sensors (Basel, Switzerland), 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
TA-BI (trust-aware behavioral intelligence) is a conceptual-formal observation-to-decision contract for trust-aware routing support in reactive multi-hop wireless sensor networks (WSNs) and mobile wireless sensor networks (MWSNs). It specifies evidence provenance and availability, separates current Behavioral Information from historical node Trust, maps these states to route candidates, and controls when RouteScore may affect a native routing decision. In the reference AODV adapter, declared validity checks, destination-sequence freshness, and hop-count precedence are applied before RouteScore on a finite frozen candidate set. A complete common component basis prevents asymmetric missing evidence from favoring a candidate; a closed gate disables TA-BI re-ranking but retains a total routing outcome through baseline ordering or native fallback. Nine propositions establish bounded contract properties, including candidate-admissibility preservation rather than equivalence of the complete AODV transition system. A deterministic Python oracle evaluates ten groups, with explicit T3/T4 subcases for stale, version-inconsistent, missing, low-confidence, and restored evidence. The evidence is separated into formal correctness, executable conformance, historical integration reachability, and empirical network performance. The supplied formal and deterministic artifacts support only the first two levels; the bounded historical OMNeT++/INET record supports integration reachability only. Packet delivery, delay, throughput, energy, overhead, scalability, and mobility performance are not evaluated.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.