Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.

Generalized Sparse and Low-Rank Optimization for Ultra-Dense Networks

Open access
Shi, Yuanming, Zhang, Jun, Chen, Wei, Letaief, Khaled B. · 2018 · IEEE Communications Magazine

Abstract

The ultra-dense network (UDN) is a promising technology to further evolve wireless networks and meet the diverse performance requirements of 5G networks. With abundant access points, each with communication, computation, and storage resources, the UDN brings unprecedented benefits, including significant improvement in network spectral efficiency and energy efficiency, greatly reduced latency to enable novel mobile applications, and the capability of providing massive access for Internet of Things devices. However, such great promise comes with formidable research challenges. To design and operate such complex networks with various types of resources, efficient and innovative methodologies will be needed. This motivates the recent introduction of highly structured and generalizable models for network optimization. In this article, we present some recently proposed large-scale sparse and low-rank frameworks for optimizing UDNs, supported by various motivating applications. Special attention is paid to algorithmic approaches to deal with nonconvex objective functions and constraints, as well as computational scalability.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/mcom.2018.1700472

Cites

15 of 15 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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

Show all 15 references

Cited by

Metadata

Authors
Shi, Y., Zhang, J., Chen, W., & Letaief, K. B.
Affiliations
  • ShanghaiTech University (CN)
  • Hong Kong University of Science and Technology (HK)
  • Tsinghua University (CN)
Venue
IEEE Communications Magazine
Published
2018-06
Volume
56
Issue
6
Pages
42-48
ISSN
0163-6804 (ISSN-L)
OpenAlex
W2964266674
Cited by
44
References
15
Citations by year
2026: 3 · 2025: 1 · 2024: 2 · 2023: 5 · 2022: 6 · 2021: 4 · 2020: 3 · 2019: 14 · 2018: 6
FWCI
2.58
Type
journal article
Language
en
Open access
Locations
  • IEEE Communications Magazine (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Rare & Special e-Zone (The Hong Kong University of Science and Technology) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Natural Science Foundation of China (2013CB336600, 973 Program, 61671269, 61621091, 61601290)
  • National Key Research and Development Program of China (2013CB336600)
Topics
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced MIMO Systems Optimization
  • Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › Advanced Wireless Communication Technologies
Keywords
ultra-dense networks, sparse optimization, low-rank optimization, 5G, non-convex optimization, computational scalability, network resource allocation, Internet of Things, energy efficiency, spectral efficiency

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.