Stephen O. Ekwe

Mr. Stephen O. Ekwe


Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 November 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
SEStephen O. Ekwe
Stephen O. Ekwe
JMJoyce Mwangama
Joyce Mwangama
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.