基于图神经网络的面向时延的分布式调度
Delay-Oriented Distributed Scheduling Using Graph Neural Networks
摘要:
在无线多跳网络中,时延是许多应用的重要度量。然而,在文献中的最大权重调度算法通常集中在瞬时最优性,其中的调度是通过解决最大加权独立集(MWIS)问题的干扰图在每个时隙选择。这些短视的政策表现不佳的面向延迟的调度,其中网络的当前积压和前一个时隙的时间表之间的依赖关系需要考虑。为了解决这个问题,我们提出了一种基于图卷积网络(GCN)的面向延迟的分布式调度器。简而言之,在调用分布式贪婪MWIS求解器之前,可训练的GCN模块生成捕获网络拓扑以及多步前瞻积压的节点嵌入。在中小型无线网络的异构发射功率,其中一些中央链路有许多干扰邻居,我们提出的分布式调度器可以超越短视的基于贪婪和即时最佳MWIS求解器,具有良好的泛化能力,跨图形模型和通信复杂性的增加最小。
英文摘要:
In wireless multi-hop networks, delay is an important metric for many applications. However, the max-weight scheduling algorithms in the literature typically focus on instantaneous optimality, in which the schedule is selected by solving a maximum weighted independent set (MWIS) problem on the interference graph at each time slot. These myopic policies perform poorly in delay-oriented scheduling, in which the dependency between the current backlogs of the network and the schedule of the previous time slot needs to be considered. To address this issue, we propose a delay-oriented distributed scheduler based on graph convolutional networks (GCNs). In a nutshell, a trainable GCN module generates node embeddings that capture the network topology as well as multi-step lookahead backlogs, before calling a distributed greedy MWIS solver. In small- to medium-sized wireless networks with heterogeneous transmit power, where a few central links have many interfering neighbors, our proposed distributed scheduler can outperform the myopic schedulers based on greedy and instantaneously optimal MWIS solvers, with good generalizability across graph models and minimal increase in communication complexity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。