论文标题

具有深度学习方法的无线D2D系统基于信息的时间表

Age of Information-based Scheduling for Wireless D2D Systems with a Deep Learning Approach

论文作者

Luo, Ling, Liu, Zhenyu, Chen, Zhiyong, Hua, Min, Li, Wenqing, Xia, Bin

论文摘要

设备对设备(D2D)链接计划避免过度干扰对于无线D2D通信的成功至关重要。大多数传统的调度方案仅考虑系统的最大吞吐量或公平性,并且不考虑信息的新鲜感。在本文中,我们提出了一种新颖的D2D链接计划方案,以优化信息时代(AOI)和吞吐量共同调度问题时,当D2D链接在最后一个备用的服务策略下通过数据包更换(LCFS-PR)链接在最后一流的服务策略下发送数据包。这是由于最大吞吐量调度可能会降低与通道条件差的链接的激活概率这一事实的动机,从而导致AOI性能糟糕。具体而言,我们得出了在时空干扰队列动力学下,在平均场假设的时空干扰队列下,网络的总体平均AOI和网络吞吐量的表达。此外,提出了一种神经网络结构,以学习从地理位置到固定随机策略下最佳调度参数的映射,在此过程中可以做出调度决策,而无需估算神经网络经过良好培训之后的渠道状态信息(CSI)。为了克服无法反向传播隐式损耗函数的问题,我们得出了梯度的数值解决方案。最后,数值结果表明,深度学习方法的性能接近具有较高计算复杂性的局部最佳算法的性能。还获得了AOI和吞吐量的权衡曲线,当吞吐量最大化时,AOI倾向于无穷大。

Device-to-device (D2D) links scheduling for avoiding excessive interference is critical to the success of wireless D2D communications. Most of the traditional scheduling schemes only consider the maximum throughput or fairness of the system and do not consider the freshness of information. In this paper, we propose a novel D2D links scheduling scheme to optimize an age of information (AoI) and throughput jointly scheduling problem when D2D links transmit packets under the last-come-first-serve policy with packet-replacement (LCFS-PR). It is motivated by the fact that the maximum throughput scheduling may reduce the activation probability of links with poor channel conditions, which results in terrible AoI performance. Specifically, We derive the expression of the overall average AoI and throughput of the network under the spatio-temporal interfering queue dynamics with the mean-field assumption. Moreover, a neural network structure is proposed to learn the mapping from the geographic location to the optimal scheduling parameters under a stationary randomized policy, where the scheduling decision can be made without estimating the channel state information(CSI) after the neural network is well-trained. To overcome the problem that implicit loss functions cannot be back-propagated, we derive a numerical solution of the gradient. Finally, numerical results reveal that the performance of the deep learning approach is close to that of a local optimal algorithm which has a higher computational complexity. The trade-off curve of AoI and throughput is also obtained, where the AoI tends to infinity when throughput is maximized.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源