网络编码双向中继信道中的结构最优传输控制
Structured Optimal Transmission Control in Network-coded Two-way Relay Channels
AI总结：
本文研究网络编码双向中继信道中的传输控制问题，通过马尔可夫决策过程建模，提出基于动态规划的最优策略，证明在特定条件下最优策略随队列状态或信道状态非递减，以降低复杂度并实现实时控制。
摘要：
本文考虑网络编码双向中继信道（NC-TWRC）中的传输控制问题，其中中继器缓冲来自两个用户的随机符号到达，并假设信道存在衰落。该问题通过折扣无限 horizon 马尔可夫决策过程（MDP）建模。目标是找到一个传输控制策略，以最小化符号延迟、缓冲溢出、传输功率消耗和误码率。通过子模性、多模性和 L-自然凸性等概念，研究动态规划（DP）算法搜索的最优策略结构。证明在某些条件下，最优传输策略随队列占用或/且信道状态非递减。本文结果可用于降低 DP 的复杂度并促进实时控制。
英文摘要：
This paper considers a transmission control problem in network-coded two-way relay channels (NC-TWRC), where the relay buffers random symbol arrivals from two users, and the channels are assumed to be fading. The problem is modeled by a discounted infinite horizon Markov decision process (MDP). The objective is to find a transmission control policy that minimizes the symbol delay, buffer overflow and transmission power consumption and error rate simultaneously and in the long run. By using the concepts of submodularity, multimodularity and L-natural convexity, we study the structure of the optimal policy searched by dynamic programming (DP) algorithm. We show that the optimal transmission policy is nondecreasing in queue occupancies or/and channel states under certain conditions such as the chosen values of parameters in the MDP model, channel modeling method, modulation scheme and the preservation of stochastic dominance in the transitions of system states. The results derived in this paper can be used to relieve the high complexity of DP and facilitate real-time control.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
