A Novel K-Repetition Design for SCMA

This work presents a novel K-Repetition based HARQ scheme for LDPC coded uplink SCMA by employing a network coding (NC) principle to encode different packets, where K-Repetition is an emerging technique (recommended in 3GPP Release 15) for enhanced reliability and reduced latency in future massive machine-type communication. Such a scheme is referred to as the NC aided K-repetition SCMA (NCK-SCMA). We introduce a joint iterative detection algorithm for improved detection of the data from the proposed LDPC coded NCKSCMA systems. Simulation results demonstrate the benefits of NCK-SCMA with higher throughput and improved reliability over the conventional K-Repetition SCMA.

A Tutorial on Decoding Techniques of Sparse Code Multiple Access

Sparse Code Multiple Access (SCMA) is a disruptive code-domain non-orthogonal multiple access (NOMA) scheme to enable \color{black}future massive machine-type communication networks. As an evolved variant of code division multiple access (CDMA), multiple users in SCMA are separated by assigning distinctive sparse codebooks (CBs). Efficient multiuser detection is carried out at the receiver by employing the message passing algorithm (MPA) that exploits the sparsity of CBs to achieve error performance approaching to that of the maximum likelihood receiver. In spite of numerous research efforts in recent years, a comprehensive one-stop tutorial of SCMA covering the background, the basic principles, and new advances, is still missing, to the best of our knowledge. To fill this gap and to stimulate more forthcoming research, we provide a holistic introduction to the principles of SCMA encoding, CB design, and MPA based decoding in a self-contained manner. As an ambitious paper aiming to push the limits of SCMA, we present a survey of advanced decoding techniques with brief algorithmic descriptions as well as several promising directions.

Multicarrier-Division Duplex for Solving the Channel Aging Problem in Massive MIMO Systems

The separation of training and data transmission as well as the frequent uplink/downlink (UL/DL) switching make time-division duplex (TDD)-based massive multiple-input multiple-output (mMIMO) systems less competent in fast time-varying scenarios due to the resulted severe channel aging. To this end, a multicarrier-division duplex (MDD) mMIMO scheme associated with two types of well-designed frame structures are introduced for combating channel aging when communicating over fast time-varying channels. To compare with TDD, the corresponding frame structures related to 3GPP standards and their variant forms are presented. The MDD-specific general Wiener predictor and decision-directed Wiener predictor are introduced to predict the channel state information, respectively, in the time domain based on UL pilots and in the frequency domain based on the detected UL data, considering the impact of residual self-interference (SI). Moreover, by applying the zero-forcing precoding and maximum ratio combining, the closed-form approximations for the lower bounded rate achieved by TDD and MDD systems over time-varying channels are derived. Our main conclusion from this study is that the MDD, endowed with the capability of full-duplex but less demand on SI cancellation than in-band full-duplex (IBFD), outperforms both the conventional TDD and IBFD in combating channel aging.

Heterogeneous graph neural network for power allocation in multicarrier-division duplex cell-free massive MIMO systems

In-band full duplex-based cell-free (IBFD-CF) systems suffer from severe interference problem including self-interference (SI) and cross-link interference (CLI), especially when cell-free (CF) systems are operated in a distributed way. To this end, we propose multicarrier-division duplex (MDD) as an enabler for full-duplex (FD)-style operation in distributed CF massive MIMO systems, where DL and UL transmissions take place simultaneously at the same frequency band but mutually orthogonal subcarrier sets. In order to maximize the spectral efficiency (SE) in the proposed systems, we present heterogeneous graph neural network specific for CF systems (CF-HGNN), which consists of an adaptive node embedding layer, meta-path based message passing, meta-path based attention and downstream power allocation learning. In particular, the adaptive node embedding layer can handle the varying number of access points (APs), mobile stations (MSs) and subcarriers, and the involved attention mechanism enables each AP/MS node in CF-HGNN to aggregate the information from interfering path and communication path with different priorities. Numerical results show that CF-HGNN is capable of using $10^4$ times less operation time to achieve the 99% performance of the SE of quadratic transform and successive convex approximation (QT-SCA). Additionally, CF-HGNN also significantly outperforms unfair greedy method in terms of SE performance. Furthermore, CF-HGNN exhibits good adaptivity to varying number of nodes and subcarriers, and also generalization ability to different sizes of CF network.

SETTI: A Self-supervised Adversarial Malware Detection Architecture in an IoT Environment

In recent years, malware detection has become an active research topic in the area of Internet of Things (IoT) security. The principle is to exploit knowledge from large quantities of continuously generated malware. Existing algorithms practice available malware features for IoT devices and lack real-time prediction behaviors. More research is thus required on malware detection to cope with real-time misclassification of the input IoT data. Motivated by this, in this paper we propose an adversarial self-supervised architecture for detecting malware in IoT networks, SETTI, considering samples of IoT network traffic that may not be labeled. In the SETTI architecture, we design three self-supervised attack techniques, namely Self-MDS, GSelf-MDS and ASelf-MDS. The Self-MDS method considers the IoT input data and the adversarial sample generation in real-time. The GSelf-MDS builds a generative adversarial network model to generate adversarial samples in the self-supervised structure. Finally, ASelf-MDS utilizes three well-known perturbation sample techniques to develop adversarial malware and inject it over the self-supervised architecture. Also, we apply a defence method to mitigate these attacks, namely adversarial self-supervised training to protect the malware detection architecture against injecting the malicious samples. To validate the attack and defence algorithms, we conduct experiments on two recent IoT datasets: IoT23 and NBIoT. Comparison of the results shows that in the IoT23 dataset, the Self-MDS method has the most damaging consequences from the attacker's point of view by reducing the accuracy rate from 98% to 74%. In the NBIoT dataset, the ASelf-MDS method is the most devastating algorithm that can plunge the accuracy rate from 98% to 77%.

Human Biometric Signals Monitoring based on WiFi Channel State Information using Deep Learning

In this paper, we first present a single-input, multiple-output convolutional neural network that can estimate both heart rate and respiration rate simultaneously by exploiting the underlying link between heart rate and respiration rate. The inputs to the neural network are the amplitude and phase of channel state information collected by a pair of WiFi devices. Our WiFi-based technique addresses privacy concerns and is adapt- able to a variety of settings. This system overall accuracy for the heart and respiration rate estimation can reach 99.109% and 98.581%, respectively. Furthermore, we developed and analyzed two deep learning-based neural network classification algorithms for categorizing four types of sleep stages: wake, rapid eye movement (REM) sleep, non-rapid eye movement (NREM) light sleep, and NREM deep sleep. This system overall classification accuracy can reach 95.925%

Performance Analysis of Multiple-Antenna Ambient Backscatter Systems at Finite Blocklengths

This paper analyzes the maximal achievable rate for a given blocklength and error probability over a multiple-antenna ambient backscatter channel with perfect channel state information at the receiver. The result consists of a finite blocklength channel coding achievability bound and a converse bound based on the Neyman-Pearson test and the normal approximation based on the Berry- Esseen Theorem. Numerical evaluation of these bounds shows fast convergence to the channel capacity as the blocklength increases and also proves that the channel dispersion is an accurate measure of the backoff from capacity due to finite blocklength.

On the Security of LEO Satellite Communication Systems: Vulnerabilities, Countermeasures, and Future Trends

Low Earth Orbit (LEO) satellite systems undergo a period of rapid development driven by the ever-increasing user demands, reduced costs, and technological progress. Since there is a paucity of literature on the security issues of LEO Satellite Communication Systems (SCSs), we aim for filling this knowledge gap. Specifically, we critically appraise the inherent characteristics of LEO SCSs and summarize their unique security vulnerabilities. In light of this, we further discuss their security vulnerabilities, including the issues of passive and active eavesdropping attacks, interference scenarios, single event upsets, and space debris. Subsequently, we discuss the corresponding active and passive security countermeasures, followed by unveiling a range of trade-offs, security vulnerabilities and their countermeasures. Furthermore, we shed light on several promising future research directions for enhancing the security of LEO SCSs, such as secure quantum communications, three-dimensional virtual arrays, artificial intelligence-based security measures, space-based blockchain, and intelligent reflecting surface enabled secure transmission. Finally, the take-away messages of this paper are crystallized in our concluding design guidelines.

Simultaneous Transmission and Reflection Reconfigurable Intelligent Surface Assisted MIMO Systems

In this work, we investigate a novel simultaneous transmission and reflection reconfigurable intelligent surface (RIS)-assisted multiple-input multiple-output downlink system, where three practical transmission protocols, namely, energy splitting (ES), mode selection (MS), and time splitting (TS), are studied. For the system under consideration, we maximize the weighted sum rate with multiple coupled variables. To solve this optimization problem, a block coordinate descent algorithm is proposed to reformulate this problem and design the precoding matrices and the transmitting and reflecting coefficients (TARCs) in an alternate manner. Specifically, for the ES scheme, the precoding matrices are solved using the Lagrange dual method, while the TARCs are obtained using the penalty concave-convex method. Additionally, the proposed method is extended to the MS scheme by solving a mixed-integer problem. Moreover, we solve the formulated problem for the TS scheme using a one-dimensional search and the Majorization-Minimization technique. Our simulation results reveal that: 1) Simultaneous transmission and reflection RIS (STAR-RIS) can achieve better performance than reflecting-only RIS; 2) In unicast communication, TS scheme outperforms the ES and MS schemes, while in broadcast communication, ES scheme outperforms the TS and MS schemes.