The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Graph Embedding-Based Wireless Link Scheduling With Few Training Samples
Open accessAbstract
Link scheduling in device-to-device (D2D) networks is usually formulated as a non-convex combinatorial problem, which is generally NP-hard and difficult to get the optimal solution. Traditional methods to solve this problem are mainly based on mathematical optimization techniques, where accurate channel state information (CSI), usually obtained through channel estimation and feedback, is needed. To overcome the high computational complexity of the traditional methods and eliminate the costly channel estimation stage, machine leaning (ML) has been introduced recently to address the wireless link scheduling problems. In this article, we propose a novel graph embedding based method for link scheduling in D2D networks. We first construct a fully-connected directed graph for the D2D network, where each D2D pair is a node while interference links among D2D pairs are the edges. Then we compute a low-dimensional feature vector for each node in the graph. The graph embedding process is based on the distances of both communication and interference links, therefore without requiring the accurate CSI. By utilizing a multi-layer classifier, a scheduling strategy can be learned in a supervised manner based on the graph embedding results for each node. We also propose an unsupervised manner to train the graph embedding based method to further reinforce the scalability and develop a K-nearest neighbor graph representation method to reduce the computational complexity. Extensive simulation demonstrates that the proposed method is near-optimal compared with the existing state-of-art methods but is with only hundreds of training network layouts. It is also competitive in terms of scalability and generalizability to more complicated scenarios.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications
Cai, H., Zheng, V. W., & Chang, K. C.-C. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2807452 · Cited by 2,034
Deep Learning Based Communication Over the Air
Dorner, S., Cammerer, S., Hoydis, J., & Brink, S. T. (2018) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2017.2784180 · Cited by 859
Deep Learning-Based Channel Estimation for Beamspace mmWave Massive MIMO Systems
He, H., Wen, C.-K., Jin, S., & Li, G. Y. (2018) · IEEE Wireless Communications Letters · doi:10.1109/lwc.2018.2832128 · Cited by 823
Self-citationDeep Learning-based Channel Estimation for Beamspace mmWave Massive MIMO Systems
He, H., Wen, C.-K., Jin, S., & Li, G. Y. (2018) · arXiv · doi:10.48550/arxiv.1802.01290 · Cited by 823
Self-citationDeep Learning in Physical Layer Communications
Qin, Z., Ye, H., Li, G. Y., & Juang, B.-H. F. (2019) · IEEE Wireless Communications · doi:10.1109/mwc.2019.1800601 · Cited by 692
Self-citationMulti-Agent Deep Reinforcement Learning for Dynamic Power Allocation in Wireless Networks
Nasir, Y. S., & Guo, D. (2019) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2019.2933973 · Cited by 660
Li, X., Fang, J., Cheng, W., Duan, H., Chen, Z., & Li, H. (2018) · IEEE Access · doi:10.1109/access.2018.2831240 · Cited by 192
LORM: Learning to Optimize for Resource Management in Wireless Networks With Few Training Samples
Shen, Y., Shi, Y., Zhang, J., & Letaief, K. B. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2947591 · Cited by 134
User Association and Load Balancing for Massive MIMO through Deep Learning
Zappone, A., Sanguinetti, L., & Debbah, M. (2018) · 2018 52nd Asilomar Conference on Signals, Systems, and Computers · doi:10.1109/acssc.2018.8645483 · Cited by 48
User Association and Load Balancing for Massive MIMO through Deep Learning
Zappone, A., Sanguinetti, L., & Debbah, M. (2018) · arXiv · doi:10.48550/arxiv.1812.06905 · Cited by 48
Cited by
Shen, Y., Shi, Y., Zhang, J., & Letaief, K. B. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.3036965 · Cited by 367
Optimal Wireless Resource Allocation With Random Edge Graph Neural Networks
Eisen, M., & Ribeiro, A. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2988255 · Cited by 327
Jiang, T., Cheng, H. V., & Yu, W. (2021) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3078502 · Cited by 290
Graph-based deep learning for communication networks: A survey
Jiang, W. (2022) · Computer Communications · doi:10.1016/j.comcom.2021.12.015 · Cited by 284
Deep-Learning-Based Wireless Resource Allocation With Application to Vehicular Networks
Liang, L., Ye, H., Yu, G., & Li, G. Y. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2957798 · Cited by 282
Self-citation
Metadata
- Authors
- Lee, M., Yu, G., & Li, G. Y.
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2021-04
- Volume
- 20
- Issue
- 4
- Pages
- 2282-2294
- ISSN
- 1536-1276 (ISSN-L)
- 1558-2248
- OpenAlex
- W2948960695
- Cited by
- 180
- References
- 10
- FWCI
- 7.43
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Graph Embedding-Based Wireless Link Scheduling With Few Training Samples. https://app.cochat.ai/papers/10.1109/twc.2020.3040983
- The paper
- Lee, M., Yu, G., & Li, G. Y. (2021). Graph Embedding-Based Wireless Link Scheduling With Few Training Samples. IEEE Transactions on Wireless Communications. https://doi.org/10.1109/twc.2020.3040983
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.