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

多天线阅读器后向散射网络能量分配与数据调度研究

On Energy Allocation and Data Scheduling in Backscatter Networks with Multi-antenna Readers

Mohammad Movahednasab, Mohammad Reza Pakravan, Behrooz Makki, Tommy Svensson

摘要:

本文研究了具有多天线阅读器的单站反向散射通信网络中的吞吐量效用函数。在所考虑的模型中,后向散射节点(BN)在传输到读取器之前将数据存储在其缓冲区中。我们研究了三个效用函数,即总和,比例和共同的吞吐量。我们设计了相应于每个效用函数的在线接纳策略,以确定缓冲区中可以接纳多少数据。此外,我们提出了一个在线的数据链路控制策略,用于联合控制发射和接收波束成形向量以及BN的反射系数。所提出的数据准入和数据链路控制策略共同优化了吞吐量效用,同时稳定了缓冲区。在控制策略的设计中,我们采用了最小漂移加惩罚(MDPP)方法。遵循MDPP方法,我们将最优数据链路控制和数据接纳策略转化为两个独立的优化问题的解,这两个优化问题在每个时隙内都要求解。对应于数据链路控制的优化问题是非凸的并且不具有平凡解。使用拉格朗日对偶和二次变换,我们找到了一个封闭形式的迭代解。最后,我们使用有限块长码的可达速率的结果来研究在短分组的情况下的系统性能。如所示,所提出的策略实现了最佳效用,并稳定了BN中的数据缓冲区。

英文摘要:

In this paper, we study the throughput utility functions in buffer-equipped monostatic backscatter communication networks with multi-antenna Readers. In the considered model, the backscatter nodes (BNs) store the data in their buffers before transmission to the Reader. We investigate three utility functions, namely, the sum, the proportional and the common throughput. We design online admission policies, corresponding to each utility function, to determine how much data can be admitted in the buffers. Moreover, we propose an online data link control policy for jointly controlling the transmit and receive beamforming vectors as well as the reflection coefficients of the BNs. The proposed policies for data admission and data link control jointly optimize the throughput utility, while stabilizing the buffers. We adopt the min-drift-plus-penalty (MDPP) method in designing the control policies. Following the MDPP method, we cast the optimal data link control and the data admission policies as solutions of two independent optimization problems which should be solved in each time slot. The optimization problem corresponding to the data link control is non-convex and does not have a trivial solution. Using Lagrangian dual and quadratic transforms, we find a closed-form iterative solution. Finally, we use the results on the achievable rates of finite blocklength codes to study the system performance in the cases with short packets. As demonstrated, the proposed policies achieve optimal utility and stabilize the data buffers in the BNs.

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

↑