Future 5th generation (5G) networks are expected to enable three key services -enhanced mobile broadband (eMBB), massive machine type communications (mMTC) and ultra-reliable and low latency communications (URLLC). As per the 3rd generation partnership project (3GPP) URLLC requirements, it is expected that the reliability of one transmission of a 32 byte packet will be at least 99.999% and the latency will be at most 1 ms. This unprecedented level of reliability and latency will yield various new applications such as smart grids, industrial automation and intelligent transport systems. In this survey we present potential future URLLC applications, and summarize the corresponding reliability and latency requirements. We provide a comprehensive discussion on physical (PHY) and medium access control (MAC) layer techniques that enable URLLC, addressing both licensed and unlicensed bands. The paper evaluates the relevant PHY and MAC techniques for their ability to improve the reliability and reduce the latency. We identify that enabling long-term evolution (LTE) to coexist in the unlicensed spectrum is also a potential enabler of URLLC in the unlicensed band, and provide numerical evaluations. Lastly, the paper discusses the potential future research directions and challenges in achieving the URLLC requirements.

Non-orthogonal multiple access (NOMA) is one promising technology, which provides high system capacity, low latency, and massive connectivity, to address several challenges in the fifth-generation wireless systems. In this paper, we first reveal that the NOMA techniques have evolved from single-carrier NOMA (SC-NOMA) into multi-carrier NOMA (MC-NOMA). Then, we comprehensively investigated on the basic principles, enabling schemes and evaluations of the two most promising MC-NOMA techniques, namely sparse code multiple access (SCMA) and pattern division multiple access (PDMA). Meanwhile, we consider that the research challenges of SCMA and PDMA might be addressed with the stimulation of the advanced and matured progress in SC-NOMA. Finally, yet importantly, we investigate the emerging applications, and point out the future research trends of the MC-NOMA techniques, which could be straightforwardly inspired by the various deployments of SC-NOMA.

With the emergence of the mission-critical Internet of Things applications, ultra-reliable low-latency communications are attracting a lot of attentions. Non-orthogonal multiple access (NOMA) with multiple-input multiple-output (MIMO) is one of the promising candidates to enhance connectivity, reliability, and latency performance of the emerging applications. In this paper, we derive a closed-form upper bound for the delay target violation probability in the downlink MIMO-NOMA, by applying stochastic network calculus to the Mellin transforms of service processes. A key contribution is that we prove that the infinite-length Mellin transforms resulting from the non-negligible interferences of NOMA are Cauchy convergent and can be asymptotically approached by a finite truncated binomial series in the closed form. By exploiting the asymptotically accurate truncated binomial series, another important contribution is that we identify the critical condition for the optimal power allocation of MIMO-NOMA to achieve consistent latency and reliability between the receivers. The condition is employed to minimize the total transmit power, given a latency and reliability requirement of the receivers. It is also used to prove that the minimal total transmit power needs to change linearly with the path losses, to maintain latency and reliability at the receivers. This enables the power allocation for mobile MIMO-NOMA receivers to be effectively tracked. The extensive simulations corroborate the accuracy and effectiveness of the proposed model and the identified critical condition.

It is challenging to satisfy the critical requirements of ultra-reliable and low latency communications (URLLC) in the Internet of things (IoT) under severe channel fading. The emerging massive multi-user multiple-input and multiple-output (MU-MIMO) concept is applied in IoT networks under shadow fading, enabling URLLC with pilot-assisted channel estimation (PACE) and zero-forcing (ZF) detection. Assuming users are uniformly and randomly deployed under log-normal shadow fading, the probability density function (pdf) of post-processing signal-to-noise ratios (SNRs) is derived for the uplink (UL) of massive MU-MIMO with perfect channel state information (CSI) and imperfect CSI obtained by PACE. Then, finite blocklength (FBL) information theory is utilized to derive the error probability of accessing users with a given latency, thereby evaluating the reliability of massive MU-MIMO for short-packet transmissions. Further, the length of pilots to minimize the error probability can be decided by the golden section search method (GSSM), which can converge rapidly. Numerical results verify that massive MU-MIMO can support a large number of UL URLLC users even when users are randomly deployed under shadow fading.

Roadside units (RSUs), which have strong computing capability and are close to vehicle nodes, have been widely used to process delay- and computation-intensive tasks of vehicle nodes. However, due to their high mobility, vehicles may drive out of the coverage of RSUs before receiving the task processing results. In this paper, we propose a mobile edge computing-assisted vehicular network, where vehicles can offload their tasks to a nearby vehicle via a vehicle-to-vehicle (V2V) link or a nearby RSU via a vehicle-to-infrastructure link. These tasks are also migrated by a V2V link or an infrastructure-to-infrastructure (I2I) link to avoid the scenario where the vehicles cannot receive the processed task from the RSUs. Considering mutual interference from the same link of offloading tasks and migrating tasks, we construct a vehicle offloading decision-based game to minimize the computation overhead. We prove that the game can always achieve Nash equilibrium and convergence by exploiting the finite improvement property. We then propose a task migration (TM) algorithm that includes three task-processing methods and two task-migration methods. Based on the TM algorithm, computation overhead minimization offloading (COMO) algorithm is presented. Extensive simulation results show that the proposed TM and COMO algorithms reduce the computation overhead and increase the success rate of task processing.

To meet the requirements of high energy efficiency (EE) and large system capacity for the fifth-generation Internet of Things (IoT), the use of massive multiple-input multiple-output technology has been launched in the massive IoT (mIoT) network, where a large number of devices are connected and scheduled simultaneously. This paper considers the energy-efficient design of a multipair decode-and-forward relay-based IoT network, in which multiple sources simultaneously transmit their information to the corresponding destinations via a relay equipped with a large array. In order to obtain an accurate yet tractable expression of the EE, first, a closed-form expression of the EE is derived under an idealized simplifying assumption, in which the location of each device is known by the network. Then, an exact integral-based expression of the EE is derived under the assumption that the devices are randomly scattered following a uniform distribution and transmit power of the relay is equally shared among the destination devices. Furthermore, a simple yet efficient lower bound of the EE is obtained. Based on this, finally, a low-complexity energy-efficient resource allocation strategy of the mIoT network is proposed under the specific quality-of-service constraint. The proposed strategy determines the near-optimal number of relay antennas, the near-optimal transmit power at the relay, and near-optimal density of active mIoT device pairs in a given coverage area. Numerical results demonstrate the accuracy of the performance analysis and the efficiency of the proposed algorithms.