Trust-Feasible Relay Selection: Trust as an Admission Condition for UE-to-Network Relaying in Dense NR Sidelink IoT Networks

In dense New Radio (NR) sidelink Internet-of-Things (IoT) networks, weakly connected devices can reach the base station (gNB) through relays. However, a relay with a strong channel may still drop packets because it is selfish, low on battery, or malicious, or because its behaviour changes. Existing schemes assume that relays always forward, rank relays by trust, keep trust fixed, or require mutual trust, so they admit unreliable relays, miss behaviour changes, or exclude useful relays. We propose Trust-Feasible Relay Selection (TFRS), a closed-loop scheme in which trust decides which relays may be used. Trust starts from a ridge-regression prior on behavioural features and is updated from acknowledgements of relayed packets. Only pairs above a threshold are admitted, and a multi-objective evolutionary algorithm (MOEA/D) selects relays and transmit powers. A device keeps its relay only if this saves gNB resource blocks without degrading its service, or clearly improves it. Against trust-ranking and mutual-trust coalition schemes with 100–300 devices, TFRS lowers the outage under heavy gNB load by 3–5 percentage points. Paired Wilcoxon signed-rank tests with Holm correction confirm this reduction at p < 0.001. After a quarter of the altruistic relays turn compromised, it removes 77–92% of the added unreliable relaying within four epochs while keeping 81–85% of its relayed devices, whereas 44% of the trust-ranking scheme’s relayed devices stay on unreliable relays.

Authors

Publication Details

Journal
Preprints.org
Published
2026-11-17
DOI
https://doi.org/10.20944/preprints202611.1658.v1
Primary Topic
IoT and Edge/Fog Computing
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Trust-Feasible Relay Selection: Trust as an Admission Condition for UE-to-Network Relaying in Dense NR Sidelink IoT Networks

Stephen Obono Ekwe, Joyce Mwangama
1 links
Preprints.org
IoT and Edge/Fog Computing
preprint

Trust-Feasible Relay Selection: Trust as an Admission Condition for UE-to-Network Relaying in Dense NR Sidelink IoT Networks

Stephen Obono Ekwe, Joyce Mwangama
preprint en

Abstract

In dense New Radio (NR) sidelink Internet-of-Things (IoT) networks, weakly connected devices can reach the base station (gNB) through relays. However, a relay with a strong channel may still drop packets because it is selfish, low on battery, or malicious, or because its behaviour changes. Existing schemes assume that relays always forward, rank relays by trust, keep trust fixed, or require mutual trust, so they admit unreliable relays, miss behaviour changes, or exclude useful relays. We propose Trust-Feasible Relay Selection (TFRS), a closed-loop scheme in which trust decides which relays may be used. Trust starts from a ridge-regression prior on behavioural features and is updated from acknowledgements of relayed packets. Only pairs above a threshold are admitted, and a multi-objective evolutionary algorithm (MOEA/D) selects relays and transmit powers. A device keeps its relay only if this saves gNB resource blocks without degrading its service, or clearly improves it. Against trust-ranking and mutual-trust coalition schemes with 100–300 devices, TFRS lowers the outage under heavy gNB load by 3–5 percentage points. Paired Wilcoxon signed-rank tests with Holm correction confirm this reduction at p < 0.001. After a quarter of the altruistic relays turn compromised, it removes 77–92% of the added unreliable relaying within four epochs while keeping 81–85% of its relayed devices, whereas 44% of the trust-ranking scheme’s relayed devices stay on unreliable relays.

Preprints.org
Industry, innovation and infrastructure
IoT and Edge/Fog Computing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon