arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2404.04162cs.NIcs.SYeess.SY
收藏

混合语义/比特通信网络中的无线资源优化

Wireless Resource Optimization in Hybrid Semantic/Bit Communication Networks

Le Xia, Yao Sun, Dusit Niyato, Lan Zhang, Muhammad Ali Imran

AI总结:

针对 SemCom 与 BitCom 共存的 HSB-Net,本文构建知识匹配感知两阶段排队模型,并联合优化用户关联、模式选择与带宽分配,以最大化消息吞吐量。

摘要:

近年来,语义通信(SemCom)在显著节约资源和高效信息交换方面展现出巨大潜力,从而自然引入了一种新颖且实用的蜂窝网络范式,其中 SemCom 与传统比特通信(BitCom)两种模式共存。然而,鉴于 SemCom 中独特的背景知识匹配以及耗时的语义编码需求,相关无线资源管理变得相当复杂且具有挑战性。为此,本文联合研究混合语义/比特通信网络(HSB-Net)中的用户关联(UA)、模式选择(MS)和带宽分配(BA)问题。具体而言,我们首先为 SemCom 和 BitCom 链路确定了统一的消息吞吐量性能指标。接着,我们专门开发了一种知识匹配感知的两阶段串联分组排队模型,并从理论上推导了平均分组丢失率和排队时延。结合实际约束,我们随后构建了 UA、MS 和 BA 的联合优化问题,以最大化 HSB-Net 的总体消息吞吐量。之后,我们利用 Lagrange 原始-对偶转换方法以及具有多项式时间复杂度、基于偏好列表的启发式算法,提出了一种最优资源管理策略。数值结果不仅证明了我们所提出的解析排队模型的准确性,还验证了所提策略相较于不同基准方案的性能优势。

英文摘要:

Recently, semantic communication (SemCom) has shown great potential in significant resource savings and efficient information exchanges, thus naturally introducing a novel and practical cellular network paradigm where two modes of SemCom and conventional bit communication (BitCom) coexist. Nevertheless, the involved wireless resource management becomes rather complicated and challenging, given the unique background knowledge matching and time-consuming semantic coding requirements in SemCom. To this end, this paper jointly investigates user association (UA), mode selection (MS), and bandwidth allocation (BA) problems in a hybrid semantic/bit communication network (HSB-Net). Concretely, we first identify a unified performance metric of message throughput for both SemCom and BitCom links. Next, we specially develop a knowledge matching-aware two-stage tandem packet queuing model and theoretically derive the average packet loss ratio and queuing latency. Combined with practical constraints, we then formulate a joint optimization problem for UA, MS, and BA to maximize the overall message throughput of HSB-Net. Afterward, we propose an optimal resource management strategy by utilizing a Lagrange primal-dual transformation method and a preference list-based heuristic algorithm with polynomial-time complexity. Numerical results not only demonstrate the accuracy of our analytical queuing model, but also validate the performance superiority of our proposed strategy compared with different benchmarks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑