EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Distribution-Agnostic Idle-Age-Aware Joint Channel and Packet-Size Learning in Cognitive Radio Networks

Haythem A. Bany Salameh, Malik Mohamed Umar

IEEE Open Journal of the Communications Society · 2026 · 7 · 6457-6473

DOI: 10.1109/ojcoms.2026.3702166 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Open Journal of the Communications Society, 2026. Verfasst von Haythem A. Bany Salameh und 1 weiteren Autor:innen. Die Arbeit nennt 36 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Research Office at United Arab Emirates University (UAEU) for the Article Processing Charges.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Cognitive radio (CR) enables opportunistic spectrum access while protecting primary users (PUs). This opportunistic transmission is uncertain due to time-varying PU activity (unpredictable PU returns) and heterogeneous channel quality. PU idle times differ across channels, in which some have long mean availability, others only short opportunities, and PU returns vary in severity. In multi-user CR networks (CRNs), contending CR users must coordinate over a control channel to reserve an idle PU channel and select a packet size that maximizes throughput while reducing PU-return-induced forced terminations. Most existing designs optimize channel assignment or packet sizing in isolation, assume memoryless PU idle times, and often ignore control contention/reservation overhead that directly reduces the residual transmission time. This paper investigates joint channel assignment and packet-size control under unknown PU availability while explicitly accounting for realistic control overhead time. We model the Residual PU-idle Time with Idle Age using a distribution-agnostic residual-life survival function and incorporate control overhead into the packet probability of success (PoS). We formulate a maximum-profit, discounted-return problem that maximizes long-term network goodput subject to a required PoS, a received signal-to-noise (SNR) threshold, and exclusive channel occupancy. Due to the uncertainty in PU activity and the long-term nature of the optimization problem, which cannot be solved using conventional optimization methods, we model it as a constrained Markov decision process (CMDP). To solve the resulting CMDP, we propose an on-policy State-Action-Reward-State-Action (SARSA) reinforcement learning (RL) algorithm with convergence-based exploration and a quantized/pruned action-space mechanism that filters infeasible channel–packet-size pairs to reduce online search complexity. The proposed RL-based algorithm learns per-channel PU dynamics online and jointly selects the throughput-maximizing channel and packet size. Our method is a hybrid model-assisted/model-free design, in which online survival/quantile estimates are used only for PoS-based feasibility screening, while SARSA learns the long-term policy directly from interaction without requiring a parametric PU model. Simulations under heterogeneous PU availability/severity show up to 32% throughput improvement, with fewer retransmission attempts than reference schemes.

Förderung

  • Research Office at United Arab Emirates University (UAEU) for the Article Processing Charges

Zitieren

APA

Salameh, H. A. B., & Umar, M. M. (2026). Distribution-Agnostic Idle-Age-Aware Joint Channel and Packet-Size Learning in Cognitive Radio Networks. IEEE Open Journal of the Communications Society, 7, 6457-6473. https://doi.org/10.1109/ojcoms.2026.3702166

Vancouver

Salameh HAB, Umar MM. Distribution-Agnostic Idle-Age-Aware Joint Channel and Packet-Size Learning in Cognitive Radio Networks. IEEE Open Journal of the Communications Society. 2026;7:6457-6473. doi:10.1109/ojcoms.2026.3702166

BibTeX
@article{Salameh2026,
  author = {Salameh, Haythem A. Bany and Umar, Malik Mohamed},
  title = {Distribution-Agnostic Idle-Age-Aware Joint Channel and Packet-Size Learning in Cognitive Radio Networks},
  journal = {IEEE Open Journal of the Communications Society},
  year = {2026},
  volume = {7},
  pages = {6457--6473},
  doi = {10.1109/ojcoms.2026.3702166}
}
Kostenlos starten →