Optimal radio labeling of Cartesian product of rectangular mesh networks and stars

期刊论文
发表日期：

2025年6月6日

查看全文

Feng Li,
Linlin Cui,
Mohammad Javad Nadjafi-Arani

摘要

The radio label problem models frequency resource assignment in wireless networks using a topology graph, where nodes represent sites and connecting line segments indicate the distances between them. Numbers are assigned to each vertex according to the distance-label constraint, aiming to minimize the largest assigned number, which represents the optimal radio label. In this paper, we primarily investigate the Cartesian product of \(n\) -order stars and rectangular mesh networks \(P(a,b)\) , where \(a,b\geq 2\) and \(a\neq b\) . This class of the Cartesian product graph is labeled according to relevant constraints, determining the optimal assignment strategy and its exact value. Our experimental data demonstrates that the proposed topological structure is more suitable for constructing large-scale networks compared to existing models.