A Centralized Repetition Selection Scheme for Dense In-X Subnetworks

Packet repetitions combined with frequency channel hopping is a promising solution for improving reliability in dense in-X subnetwork deployments. In this paper, we propose a centralized repetition selection (C-Rep) scheme where a controller selects the number of packet repetitions to be used by each subnetwork based on the interference coupling. We first derive the optimal and near optimal average failure probability of the presented scheme, and propose a low complexity empirical cost function to be minimized via a genetic algorithm. Simulation results highlight the capability of C-Rep of reducing the failure probability in the subnetwork deployment by a factor of ∼ ×10 and above with respect to benchmark methods with optimized fixed number of packet repetitions. The empirically defined cost function leads to similar performance as when the near-optimal failure probability is used as a cost function, while reducing the number of calculations by a factor of above ∼ ×40. Robustness of the proposed scheme to different radio propagation conditions has also been verified.

Authors

Institutions

Publication Details

Journal
IEEE Internet of Things Journal
Published
2025-12-08
DOI
https://doi.org/10.1109/jiot.2025.3641215
Primary Topic
Wireless Networks and Protocols
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Centralized Repetition Selection Scheme for Dense In-X Subnetworks

Gilberto Berardinelli
IEEE Internet of Things Journal
Wireless Networks and Protocols
article

A Centralized Repetition Selection Scheme for Dense In-X Subnetworks

Gilberto Berardinelli
article en

Abstract

Packet repetitions combined with frequency channel hopping is a promising solution for improving reliability in dense in-X subnetwork deployments. In this paper, we propose a centralized repetition selection (C-Rep) scheme where a controller selects the number of packet repetitions to be used by each subnetwork based on the interference coupling. We first derive the optimal and near optimal average failure probability of the presented scheme, and propose a low complexity empirical cost function to be minimized via a genetic algorithm. Simulation results highlight the capability of C-Rep of reducing the failure probability in the subnetwork deployment by a factor of ∼ ×10 and above with respect to benchmark methods with optimized fixed number of packet repetitions. The empirically defined cost function leads to similar performance as when the near-optimal failure probability is used as a cost function, while reducing the number of calculations by a factor of above ∼ ×40. Robustness of the proposed scheme to different radio propagation conditions has also been verified.

IEEE Internet of Things JournalVol. 13(3)
Aalborg University (DK)
Openalex Percentile: Top 56%
Wireless Networks and Protocols
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.