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.
翻译:避免过度干扰的设备到设备( D2D) 链接的时间安排对于无线 D2D 通信的成功至关重要。 大多数传统时间安排计划只考虑系统的最大输送量或公平性,而不考虑信息的新鲜性。 在本文中, 我们提出一个新的 D2D 链接计划, 以优化信息时代( AoI) 和通过量联合列表问题, 在 D2D 链接以包替换( LCFS-PR) 的方式传输端端端第一保存政策下的数据包时, 避免过度干扰 。 原因是, 最大通过量的时间安排可能降低与恶劣的频道条件连接的启动概率, 从而导致AoI 功能的可怕性能。 具体地说, 我们根据中度- 时间干扰队列的动态来显示总体平均 AoI 和网络的吞吐量。 此外, 提议一个神经网络结构, 学习从地理位置到固定随机替换( LCFSFS-PR-PR) 的优化列表参数, 在不估算频道状态信息时做出相应的决定, 在内层网络之后, 无法通过精确的计算结果。