Contemporary wireless communication systems rely on Multi-User Multiple-Input Multiple-Output (MU-MIMO) techniques. In such systems, each Access Point (AP) is equipped with multiple antenna elements and serves multiple devices simultaneously. Notably, traditional systems utilize fixed antennas, i.e., antennas without any movement capabilities, while the idea of movable antennas has recently gained traction among the research community. By moving in a confined region, movable antennas are able to exploit the wireless channel variation in the continuous domain. This additional degree of freedom may enhance the quality of the wireless links, and consequently the communication performance. However, movable antennas for MU-MIMO proposed in the literature are complex, bulky, expensive and present a high power consumption. In this paper, we propose an alternative to such systems that has lower complexity and lower cost. More specifically, we propose the incorporation of rotation capabilities to APs equipped with Uniform Linear Arrays (ULAs) of antennas. We consider the uplink of an indoor scenario where the AP serves multiple devices simultaneously. The optimal rotation of the ULA is computed based on estimates of the positions of the active devices and aiming at maximizing the per-user mean achievable Spectral Efficiency (SE). Adopting a spatially correlated Rician channel model, our numerical results show that the rotation capabilities of the AP can bring substantial improvements in the SE in scenarios where the line-of-sight component of the channel vectors is strong. Moreover, our proposed system is robust against imperfect positioning estimates.
Spatially correlated device activation is a typical feature of the Internet of Things (IoT). This motivates the development of channel scheduling (CS) methods that mitigate device collisions efficiently in such scenarios, which constitutes the scope of this work. Specifically, we present a quadratic program (QP) formulation for the CS problem considering the joint activation probabilities among devices. This formulation allows the devices to stochastically select the transmit channels, thus, leading to a soft-clustering approach. We prove that the optimal QP solution can only be attained when it is transformed into a hard-clustering problem, leading to a pure integer QP, which we transform into a pure integer linear program (PILP). We leverage the branch-and-cut (B&C) algorithm to solve PILP optimally. Due to the high computational cost of B&C, we resort to some sub-optimal clustering methods with low computational costs to tackle the clustering problem in CS. Our findings demonstrate that the CS strategy, sourced from B&C, significantly outperforms those derived from sub-optimal clustering methods, even amidst increased device correlation.
Compressed sensing multi-user detection (CS-MUD) algorithms play a key role in optimizing grant-free (GF) non-orthogonal multiple access (NOMA) for massive machine-type communications (mMTC). However, current CS-MUD algorithms cannot be efficiently parallelized, which results in computationally expensive implementations of joint activity detection and channel estimation (JADCE) as the number of deployed machine-type devices (MTDs) increases. To address this, the present work proposes novel JADCE algorithms that can be applied in parallel for different clusters of MTDs by exploiting the structure of the pilot sequences. These are the approximation error method (AEM)-alternating direction method of multipliers (ADMM) and AEM-sparse Bayesian learning (SBL). Results presented in terms of the normalized mean square error and the probability of miss detection evince comparable performance to the conventional algorithms. However, both AEM-ADMM and AEM-SBL algorithms have significantly reduced computational complexity and run-times, thus, increasing network scalability.
We propose and evaluate the performance of a Non-Orthogonal Multiple Access (NOMA) dual-hop multiple relay (MR) network from an information freshness perspective using the Age of Information (AoI) metric. More specifically, we consider an age dependent (AD) policy, named as AD-NOMA- MR, in which users only transmit, with a given probability, after they reach a certain age threshold. The packets sent by the users are potentially received by the relays, and then forwarded to a common sink in a NOMA fashion by randomly selecting one of the available power levels, and multiple packets are received if all selected levels are unique. We derive analytical expressions for the average AoI of AD-NOMA-MR. Through numerical and simulation results, we show that the proposed policy can improve the average AoI up to 76.6% when compared to a previously proposed AD Orthogonal Multiple Access MR policy.
Cellular networks that are traditionally designed for human-type communication (HTC) have the potential to provide cost effective connectivity to machine-type communication (MTC). However, MTC is characterized by unprecedented traffic in cellular networks, thus posing a challenge to its successful incorporation. In this work, we propose a unified framework for amicable coexistence of MTC and HTC. We consider a heterogeneous network where machine-type devices coexist with enhanced mobile broadband (eMBB) devices and propose transceiver techniques that promote efficient signal recovery from these devices. For this, we present an eMBB pilot and MTC data generation strategy that facilitates joint coherent decoding of eMBB data and non-coherent decoding of MTC data. Furthermore, we assess the feasibility of coexistence using receiver operating characteristics, outage probability, and normalized mean square error (NMSE). Our numerical results reveal that a harmonious coexistence of the heterogeneous services can be achieved with properly configured average signal-to-noise ratios and pilot length.
Internet of Things (IoT) has triggered a rapid increase in the number of connected devices and new use cases of wireless communications. To meet the new demands, the fifth generation (5G) of wireless communication systems features native machine type communication (MTC) services in addition to traditional human type communication (HTC) services. Some of the main challenges are the heterogeneous requirements and the sporadic traffic of massive MTC (mMTC), which makes the orthogonal allocation of resources infeasible. To overcome this problem, grant free non-orthogonal multiple access schemes have been proposed alongside with sparse signal recovery algorithms. While most of the related works have considered only homogeneous networks, we focus on a scenario where an enhanced mobile broadband (eMBB) device and multiple MTC devices share the same radio resources. We exploit the approximate message passing (AMP) algorithm for joint device activity detection and channel estimation of MTC devices in the presence of interference from eMBB, and evaluate the system performance in terms of receiver operating characteristics (ROC) and channel estimation errors. Moreover, we also propose two new pilot sequence generation strategies which improve the detection capabilities of the MTC receiver without affecting the eMBB service.