To keep up with the continuously growing coverage demands and attain true global coverage, the deployment of multi-layered low Earth orbit satellite constellations is necessary. Next-generation mega satellite constellations are expected to rely on inter-satellite links to relay information, which will enable fast and reliable communications between the different satellite nodes in free-space and facilitate the utilization of coverage diversity modes that can further enhance the quality-of-service provided in the network. However, materializing these high performing systems is challenging due to the complexity of the network architecture which may require long and complex simulation processes during design. In this article, we develop theoretical modeling for the probability of coverage for various diversity modes in mega satellite constellations by leveraging tools from stochastic geometry. We first develop analytical models for conventional single-shell networks and then extend these models to incorporate multi-shell networks. The analysis is validated using Monte-Carlo simulations which show a close fit to the analytical models derived. Moreover, the analytical models provide a performance baseline that is comparable to practical networks that rely on regular network architectures such as SpaceX's Starlink. This allows network operators to devise uplink expansion strategies to cater for expanding user demands and gain insights into the performance of the network as more shells are introduced into the network.

Cell-free (CF) massive multiple-input multiple-output (MIMO), as a promising network architecture for beyond the fifth generation (5G), has a great potential to support grant-free (GF) transmission for machine-type communication (MTC). To shed light on this subject, this work aims to model and evaluate the performance of GF transmission in CF massive MIMO under a realistic network deployment scenario, where the spatial locations of both access points (APs) and devices are assumed to be random in nature. In particular, by capitalizing on the distinctive CF network architecture and features, we design a new two-disk based geometric model for GF transmission, which facilitates analysis and understanding in CF massive MIMO. Based on the proposed two-disk model, we derive an approximated closed-form expression for the access success probability by leveraging on techniques from stochastic geometry, and investigate the impact of different key system parameters on the network performance. To highlight the performance superiority of CF massive MIMO, we further provide a comparative analysis by using an analogous single-disk model in an equivalent co-located massive MIMO network. Simulation results verify our analysis and demonstrate that CF massive MIMO is able to significantly outperform its co-located counterpart in terms of access success probability and provide robust performance against increased access density, which well suits to crowd scenarios.

In this paper, a successive interference cancellation (SIC) aided K-repetition scheme is proposed to support contention-based mission-critical machine-type communication (MTC) in cell-free (CF) massive multiple-input and multipleoutput (MIMO) systems. With the assistance of a tailored deep neural network (DNN) based preamble multiplicity estimator, the proposed SIC in K-repetition is capable of fully cancelling the interference signals, which leads to the reliability improvement in CF massive MIMO. Simulation results show the accuracy of preamble multiplicity estimation by the proposed DNN, and demonstrate that, compared to the existing schemes, the proposed SIC scheme can achieve an improvement of two orders of magnitude in terms of block error rate (BLER) under a given latency constraint. Moreover, when the number of access points (APs) is sufficiently large, employing the proposed SIC scheme provides a great potential to meet ultra-reliable and low-latency requirements, e.g., 10-5 BLER and 1 ms access latency, for crowd mission-critical applications, which is far beyond the capabilities of the existing schemes.

Enabling ultra-reliable low-latency communication (URLLC) with stringent requirements for transmitting data packets (e.g., 99.999% reliability and 1 millisecond latency) presents considerable challenges in uplink transmissions. For each packet transmission over dynamically allocated network radio resources, the conventional random access protocols are based on a request-grant scheme. This induces excessive latency and necessitates reliable control signalling, resulting overhead. To address these problems, grant-free (GF) solutions are proposed in the fifth-generation (5G) new radio (NR). In this paper, an overview and vision of the state-of-the-art in enabling GF URLLC are presented. In particular, we first provide a comprehensive review of NR specifications and techniques for URLLC, discuss underlying principles, and highlight impeding issues of enabling GF URLLC. Furthermore, we briefly explain two key phenomena of massive multiple-input multiple-output (mMIMO) (i.e., channel hardening and favorable propagation) and build several deep insights into how celebrated mMIMO features can be exploited to enhance the performance of GF URLLC. Moving further ahead, we examine the potential of cell-free (CF) mMIMO and analyze its distinctive features and benefits over mMIMO to resolve GF URLLC issues. Finally, we identify future research directions and challenges in enabling GF URLLC with CF mMIMO. A new version of the paper has been updated on 21/08/2021

Preamble collision is a bottleneck that impairs the performance of random access (RA) user equipment (UE) in grant-free RA (GFRA). In this paper, by leveraging distributed massive multiple input multiple output (mMIMO) together with machine learning, a novel machine learning based framework solution is proposed to address the preamble collision problem in GFRA. The key idea is to identify and employ the neighboring access points (APs) of a collided RA UE for its data decoding rather than all the APs, so that the mutual interference among collided RA UEs can be effectively mitigated. To this end, we first design a tailored deep neural network (DNN) to enable the preamble multiplicity estimation in GFRA, where an energy detection (ED) method is also proposed for performance comparison. With the estimated preamble multiplicity, we then propose a K-means AP clustering algorithm to cluster the neighboring APs of collided RA UEs and organize each AP cluster to decode the received data individually. Simulation results show that a decent performance of preamble multiplicity estimation in terms of accuracy and reliability can be achieved by the proposed DNN, and confirm that the proposed schemes are effective in preamble collision resolution in GFRA, which are able to achieve a near-optimal performance in terms of uplink achievable rate per collided RA UE, and offer significant performance improvement over traditional schemes.