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

一种基于图核的快速黎曼流形无线链路调度分类方法

A Fast Graph Kernel Based Classification Method for Wireless Link Scheduling on Riemannian Manifold

Rashed Shelim, Ahmed S. Ibrahim

摘要:

针对黎曼流形上的设备到设备(D2D)网络中的无线链路调度问题,提出了一种新的图核方法。链路调度问题可以被认为是二元分类问题,因为每个D2D对只能保持状态活动或不活动。我们的目标是学习一种新的度量,有利于设计一个有效的,但计算要求较低的机器学习(ML)解决方案的二进制分类任务的链路调度问题,不需要信道状态信息(CSI)和训练样本的数量较少,而不是其他基准ML算法。为此,我们首先将无线D2D网络表示为图,并将每个D2D对的特征(包括其通信和干扰链路)建模为正则化的(即,正移位)拉普拉斯矩阵,其是对称正定(SPD)矩阵。通过这样做,我们表示的特征信息的每个D2D对SPD流形上的一个点,我们通过黎曼几何分析的拓扑结构。我们计算黎曼度量,例如,对数欧几里德度量(LEM),其是正则化拉普拉斯矩阵之间的合适的距离度量。然后,LEM被用来定义一个正定图核的二进制分类的链路调度决策。仿真结果表明,所提出的基于图核的方法在计算上要求较低,并且在不使用CSI和少于一百个训练网络布局的情况下,对于10个D2D对,实现了超过95%的基准算法FPLinQ [1]的总速率。

英文摘要:

In this paper, we propose a novel graph kernel method for the wireless link scheduling problem in device-to-device (D2D) networks on Riemannian manifold. The link scheduling problem can be considered as a binary classification problem since each D2D pair can only hold the state active or inactive. Our goal is to learn a novel metric that facilitates the design of an efficient but less computationally demanding machine learning (ML) solution for the binary classification task of link scheduling problem that requires no channel state information (CSI) and a fewer number of training samples as opposed to other benchmark ML algorithms. To this aim, we first represent the wireless D2D network as a graph and model the features of each D2D pair, including its communication and interference links, as regularized (i.e., positively-shifted) Laplacian matrices which are symmetric positive definite (SPD) one. By doing so, we represent the feature information of each D2D pair as a point on the SPD manifold, and we analyze the topology through Riemannian geometry. We compute the Riemannian metric, e.g., Log-Euclidean metric (LEM), which are suitable distance measures between the regularized Laplacian matrices. The LEM is then utilized to define a positive definite graph kernel for the binary classification of the link scheduling decisions. Simulation results demonstrate that the proposed graph Kernel-based method is computationally less demanding and achieves a sum rate of more than 95% of benchmark algorithm FPLinQ [1] for 10 D2D pairs without using CSI and less than a hundred training network layouts.

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

↑