Joint Pilot and Payload Power Allocation for Massive-MIMO-Enabled URLLC IIoT Networks
Open accessThe DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Abstract
The Fourth Industrial Revolution (Industrial 4.0) is coming, and this revolution will fundamentally enhance the way factories manufacture products. The conventional wired lines connecting central controller to robots or actuators will be replaced by wireless communication networks due to its low cost of maintenance and high deployment flexibility. However, some critical industrial applications require ultra-high reliability and low latency communication (URLLC). In this paper, we advocate the adoption of massive multiple-input multiple output (MIMO) to support the wireless transmission for industrial applications as it can provide deterministic communications similar as wired lines thanks to its channel hardening effects. To reduce the latency, the channel blocklength for packet transmission is finite, which incurs transmission rate degradation and decoding error probability. Thus, conventional resource allocation for massive MIMO transmission based on Shannon capacity assuming the infinite channel blocklength is no longer optimal. We first derive the closed-form expression of lower bound (LB) of achievable uplink data rate for massive MIMO system with imperfect channel state information (CSI) for both maximum-ratio combining (MRC) and zero-forcing (ZF) receivers. Then, we propose novel low complexity algorithms to solve the achievable data rate maximization problems by jointly optimizing the pilot and payload transmission power for both MRC and ZF. Simulation results confirm the rapid convergence speed and performance advantage over the existing benchmark algorithms.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Andrews, J. G., Buzzi, S., Choi, W., Hanly, S. V., Lozano, A., Soong, A. C. K., & Zhang, J. C. (2014) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2014.2328098 · Cited by 8,106 · cited 1×
“By equipping a large number of antennas at the base station (BS), massive multiple-input multiple-output (MIMO) has been widely regarded as the key enabler for the creation of the fifth generation (5G) wireless networks [16].”
BackgroundNoncooperative Cellular Wireless with Unlimited Numbers of Base Station Antennas
Marzetta, T. L. (2010) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2010.092810.091092 · Cited by 6,302 · cited 2×
“All the devices should be allocated with orthogonal pilot resources so that the CC is able to distinguish the channels from different devices, thus, the number of symbols for channel estimation should be no smaller than the number of devices [20].”
BackgroundChannel Coding Rate in the Finite Blocklength Regime
Polyanskiy, Y., Poor, H. V., & Verdu, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2043769 · Cited by 3,885 · cited 1×
“In [6], Peter et al.”
Energy and spectral efficiency of very large multiuser MIMO systems
Ngo, H. Q., Larsson, E. G., & Marzetta, T. L. (2013) · IEEE Transactions on Communications · doi:10.1109/tcomm.2013.020413.110848 · Cited by 3,173 · cited 1×
“The proof follows the similar steps as those in Appendix A of [35] for perfect CSI.”
MethodRandom Matrix Theory and Wireless Communications
Tulino, A. M., & Verdú, S. (2004) · Foundations and Trends™ in Communications and Information Theory · doi:10.1561/0100000001 · Cited by 2,034 · cited 1×
“By using the identity [37] E { tr ( W−1 )} = m n−m (55)”
A tutorial on geometric programming
Boyd, S., Kim, S.-J., Vandenberghe, L., & Hassibi, A. (2007) · Optimization and Engineering · doi:10.1007/s11081-007-9001-7 · Cited by 1,195 · cited 1×
“In [31], the authors claimed that the GP problem can be efficiently solved by using the standard interior point methods with a worst-case polynomial-time complexity.”
MethodIndustrie 4.0: Hit or Hype? [Industry Forum]
Drath, R., & Horch, A. (2014) · IEEE Industrial Electronics Magazine · doi:10.1109/mie.2014.2312079 · Cited by 986 · cited 1×
“0 has been envisioned as the future paradigm for the next generation of industrial systems, which integrates advanced manufacturing functions with the industrial internet-of-things (IIoT) to create a more intelligent and automatic digital manufacturing system [1].”
BackgroundDynamic Spectrum Management: Complexity and Duality
Luo, Z.-Q., & Zhang, S. (2008) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.914876 · Cited by 929 · cited 10×
“More time slots are needed for CSI feedback.”
BackgroundInfluentialPower Control By Geometric Programming
Chiang, M., Tan, C. W., Palomar, D. P., O'neill, D., & Julian, D. (2007) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2007.05960 · Cited by 886 · cited 1×
“2The best local monomial approximations means that the approximation function should satisfy three conditions as specified in Section IV-A of [33].”
Background
Research works printed but not linked: 9
- shi, 2008, Rate optimization for multiuser MIMO systems with linear processing, IEEE Trans Signal Process, 56, 4020, 10.1109/TSP.2008.924796 · doi:10.1109/tsp.2008.924796
- 2010, Further Advancements for E-UTRA Physical Layer Aspects
- 10.1109/ICC.2019.8761334 · doi:10.1109/icc.2019.8761334
- 10.1109/ICCW.2019.8756746 · doi:10.1109/iccw.2019.8756746
- lu, 2015, Joint optimization of power allocation and training duration for uplink multiuser MIMO communications, Proc IEEE Wireless Commun Netw Conf (WCNC), 322
- grant, 2016, CVX Matlab software for disciplined convex programming version 1
- 10.1109/TWC.2018.2827368 · doi:10.1109/twc.2018.2827368
- 10.1109/JSAC.2018.2872361 · doi:10.1109/jsac.2018.2872361
- 10.1109/ICC.2017.7996416 · doi:10.1109/icc.2017.7996416
Cited by
Edge artificial intelligence for 6g: vision, enabling technologies, and applications
Letaief, K. B., Shi, Y., Lu, J., & Lu, J. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3126076 · Cited by 829
“To support multiple edge devices for uploading intermediate features using short packet transmission, massive MIMO can be adopted to combat channel fast fading and provide a nearly deterministic communication environment due to channel hardening [231].”
Method
Metadata
- Authors
- Ren, H., Pan, C., Deng, Y., Elkashlan, M., & Nallanathan, A.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2020-05
- Volume
- 38
- Issue
- 5
- Pages
- 816-830
- ISSN
- 0733-8716 (ISSN-L)
- 1558-0008
- OpenAlex
- W3013864432
- Cited by
- 183
- References
- 27
- FWCI
- 8.61
- Type
- journal article
- Language
- en
- Open access
- hybrid
- Funders
- U.K. Engineering and the Physical Sciences Research Council (EP/N029666/1)
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.