基于链解码的ARQ遗留用户最优频谱共享
Optimal Spectrum Sharing with ARQ based Legacy Users via Chain Decoding
摘要：
该文研究了频谱共享网络中的接入策略设计，利用传统的主用户重传协议，通过次用户机会重传和链式解码来提高频谱效率。在对PU的干扰约束下，最大化SU吞吐量的最优策略及其性能被发现在封闭的形式。结果表明，最优策略在三种模式中随机选择：空闲模式，SU在PU的重传窗口内保持空闲，避免造成干扰;干扰消除模式，SU在解码PU分组后才进行传输，通过干扰消除提高自身的吞吐量; SU总是在PU的重传窗口上进行发送，以最大化未来经由链解码的干扰消除的可能性。该结构被利用来设计随机优化算法，以便于在模型参数未知或随时间变化时基于来自SU接收机处的PU和CSI测量的ARQ反馈来进行学习和自适应。它示出的数字，对于10%的干扰约束，最佳的接入策略产生15%的改进，比一个国家的最先进的计划没有SU重传，和高达2倍的增益超过一个计划使用非自适应接入策略，而不是最佳的。
英文摘要：
This paper investigates the design of access policies in spectrum sharing networks by exploiting the retransmission protocol of legacy primary users (PUs) to improve the spectral efficiency via opportunistic retransmissions at secondary users (SUs) and chain decoding. The optimal policy maximizing the SU throughput under an interference constraint to the PU and its performance are found in closed form. It is shown that the optimal policy randomizes among three modes: Idle, the SU remains idle over the retransmission window of the PU, to avoid causing interference; Interference cancellation, the SU transmits only after decoding the PU packet, to improve its own throughput via interference cancellation; Always transmit, the SU transmits over the retransmission window of the PU to maximize the future potential of interference cancellation via chain decoding. This structure is exploited to design a stochastic optimization algorithm to facilitate learning and adaptation when the model parameters are unknown or vary over time, based on ARQ feedback from the PU and CSI measurements at the SU receiver. It is shown numerically that, for a 10% interference constraint, the optimal access policy yields 15% improvement over a state-of-the-art scheme without SU retransmissions, and up to 2x gain over a scheme using a non-adaptive access policy instead of the optimal one.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
