4.5 Article

A resource allocation scheme for D2D communications with unknown channel state information

期刊

PEER-TO-PEER NETWORKING AND APPLICATIONS
卷 15, 期 2, 页码 1189-1213

出版社

SPRINGER
DOI: 10.1007/s12083-021-01265-5

关键词

Bipartite matching; Cellular communications; D2D; Machine learning; Resource allocation

向作者/读者索取更多资源

In this paper, the problem of D2D resource allocation under unknown channel state information (CSI) is addressed. A network controller based on combinatorial multi-armed bandit (CMAB) is proposed to achieve optimal D2D configuration without CSI. Numerical experiments are conducted to verify the effectiveness of the proposed scheme in D2D relay selection and joint mode selection and channel allocation.
Device-to-device (D2D) communication is a dramatic departure from the conventional cellular architecture as it allows for user equipment (UE) in a cellular network to act as transmission relays without the involvement of network infrastructure, effectively realizing a co-existing massive ad-hoc network. While a hybrid D2D-cellular architecture can enhance the spectral efficiency, resource allocation in such a two-tier system is faced with unique challenges to ensure minimal impact on the performance of existing cellular users (CUs). In this paper, we address the D2D resource allocation problem under unknown channel state information (CSI). CSI-free schemes are substantial given that certain practical limitations (e.g., finite CSI feedback delay) make the knowledge of instantaneous CSI impossible in systems with fading channels. Also, statistical CSI needs pre-deployment training/model extraction and becomes invalid as the operating environment changes. Our proposed D2D resource optimization scheme for unknown CSI settings is applicable to a sub-class of scenarios which can be framed as the graph-theoretic weighted bipartite matching (WBM) problem. In the absence of CSI, WBM becomes a combinatorial problem with unknown random edge weights and generally unknown distributions. To compensate for this lack of knowledge, we resort to the formalism of combinatorial multi-armed bandit (CMAB) from machine learning theory. A CMAB-based network controller is able to reach optimal D2D configuration by following efficient rules which strike a balance between exploring alternative matchings and exploiting the gradually gained experience. We formulate and numerically experiment with two problems as proof of concept, namely (i) D2D relay selection, and (ii) joint mode selection and channel allocation. We also compare our results with existing/baseline schemes with various flavors of CSI availability assumptions, including perfect instantaneous CSI, perfect statistical CSI, erroneous CSI, and static CSI.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据