Spatial Deep Learning for Wireless Scheduling
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
The optimal scheduling of multiple interfering links in a densely deployed wireless network with full frequency reuse is a well-known challenging problem. The classical optimization approaches to this problem typically operate under the paradigm of first estimating all the interfering channel strengths then finding an optimum solution using the model. However, traditional scheduling methods are computationally and resource intensive, because channel estimation is expensive especially in dense networks, and further the optimization of link scheduling is typically a nonconvex problem. This paper takes a novel deep spatial learning approach to the scheduling problem. We show that it is possible to bypass the channel estimation stage altogether and to use a deep neural network to produce a near optimal schedule based solely on geographic locations of the transmitters and receivers in the network. This is accomplished by taking advantage of the recent advances in fractional programming that allows us to generate high- quality local optimum solutions to the scheduling problem for randomly deployed device-to-device networks as training data, and by using a novel neural network architecture that takes the geographic spatial convolutions of the interfering and interfered neighboring nodes as input over multiple feedback stages to learn the optimum solution.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
LeCun, Y., Bengio, Y., & Hinton, G. (2015) · Nature · doi:10.1038/nature14539 · Cited by 84,126
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
Learning to optimize: Training deep neural networks for wireless resource management
Sun, H., Chen, X., Shi, Q., Hong, M., Fu, X., & Sidiropoulos, N. D. (2017) · 2017 IEEE 18th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC) · doi:10.1109/spawc.2017.8227766 · Cited by 308
Cited by
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
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
Spatial Deep Learning for Wireless Scheduling
Cui, W., Shen, K., & Yu, W. (2019) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2019.2904352 · Cited by 265
Self-citationLORM: 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
Metadata
- Authors
- Cui, W., Shen, K., & Yu, W.
- Venue
- 2018 IEEE Global Communications Conference (GLOBECOM)
- Publisher
- IEEE
- Published
- 2018-12
- Pages
- 1-6
- ISSN
- 1930-529X (ISSN-L)
- OpenAlex
- W2963641440
- Cited by
- 26
- References
- 3
- FWCI
- 5.23
- Type
- conference paper
- Language
- en
- Open access
- closed
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
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.