Division Multiple Access Communication Research Articles

Task execution latency minimization for energy-sensitive IoTs in wireless powered mobile edge computing: A DRL-based method

Wireless powered mobile edge computing (MEC) has become a vital component of future 6G networks, offering efficient computational capabilities to internet of things (IoT) devices and ensuring a stable energy supply. In this paper, we propose an innovative design for a wireless powered MEC-assisted energy-sensitive IoT systems. The system integrates wireless power technology (WPT), allowing IoT devices to efficiently perform tasks under wireless power supply without consuming their battery energy. Therefore, we formulate a dynamic computational task execution latency minimization (DCTELM) problem to tackle the impacts of unpredictable energy requirements and potential communication latency on resource allocation. We also analyze the differences between time division multiple access and non-orthogonal multiple access communication protocols. Given the complexity and dynamic nature of this problem, we define it as a mixed integer nonlinear programming problem. To address this problem, we introduced an enhanced deep reinforcement learning (DRL) algorithm. First, the DCTELM problem is transformed into a Markov decision process (MDP), which simplifies the structure of the problem. Then, after determining the offloading decision, we reveal the convex relationship between resource allocation and task latency. Furthermore, the action space of MDP is further reduced, and a multi-head proximal policy optimization (PPO) algorithm is proposed to deal with the simplified MDP problem. This process reduces the complexity of problem solving, decreases the consumption of computational resources. Simulation results demonstrate that our method outperforms other baselines in terms of computation latency, particularly with the introduction of an exploration strategy during the training phase, which significantly reduces task latency.

Two Indicators of Cross-Correlation for the Functions from Zqn to Z2q

Boolean functions play an important role in the design of secure cryptosystems and code division multiple access (CDMA) communication. Several possible generalizations of Boolean functions have been obtained in recent years. In this paper, we analyze the properties of functions from in terms of their Walsh-Hadamard transform (WHT). We provide a relationship between cross-correlation and the WHT of these functions. Also, we present a necessary and sufficient condition for the functions to have complementary autocorrelation. The Parseval’s identity for the current setup of these functions is obtained. Further, we obtained the modulus indicator (MI) and the sum-of-squares-modulus indicator (SSMI) of cross-correlation among two functions for the current setup.

On the time complexity of achieving optimal throughput in time division multiple access communication networks

<abstract><p>The fundamental problem of finding transmission schedules for achieving optimal throughput in time division multiple access (TDMA) communication networks is known to be NP-hard. Let $ \mathcal{N} $ be a scheduled $ k $-time slot TDMA network with $ n $ stations and $ m $ links. We showed that an optimal link schedule for $ \mathcal{N} $ can be computed recursively with a recursion tree of logarithmic depth $ \mathcal{O}(\ln m) $ in expectation. Additionally, we showed that optimal link schedules for those TDMA networks, with recursion trees of depth meeting the expectation, can be found in time $ \mathcal{O}(m^{2+\ln k}) $. Likewise, we discuss analogous results for computing optimal station schedules of TDMA networks.</p></abstract>

A new construction of asymptotically optimal codebooks

<abstract><p>Codebooks with small cross-correlation amplitude have extensive applications in many fields including code division multiple access (CDMA) communications systems, space-time codes, and compressed sensing. In this paper, a class of asymptotically optimal codebooks was constructed, and the maximum inner-product of these presented codebooks was determined by using properties of character sums over finite fields. Furthermore, these codebooks provided new parameters.</p></abstract>

Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound

<p style='text-indent:20px;'>Codebooks with small maximum cross-correlation amplitudes are used to distinguish the signals from different users in code division multiple access communication systems. In this paper, several classes of codebooks are introduced, whose maximum cross-correlation amplitudes asymptotically achieve the corresponding Welch bound and Levenshtein bound. Specially, a class of optimal codebooks with respect to the Levenshtein bound is obtained. These classes of codebooks are constructed by selecting certain rows deterministically from circulant matrices, Fourier matrices and Hadamard matrices, respectively. The construction methods and parameters of some codebooks provided in this paper are new.</p>

An On-Demand TDMA Approach Optimized for Low-Latency IoT Applications.

The never-ending evolution of the Internet of Things ecosystem is reshaping the arena of wireless communications and competing against conventional networking solutions in fields such as battery life, device and deployment cost, coverage, and support for an immense number of devices. Inspired by this phenomenon, this paper presents a novel Medium Access Control protocol utilizing long-range technology, based on a Time Division Multiple Access communication protocol variant, adjusted to make better use of each device’s hardware. Focusing on Low Power Wide Area Network applications, this implementation improves data latency and offers amplified performance due to better network awareness and dynamic time slot rescheduling. Various simulation scenarios were contrived to evaluate the protocol’s performance. The results instate the proposed algorithm as a promising access scheme for the IoT field.

Experimental Study of Multiband Acousto-Optic Filtering by Decoding of Spectrally Encoded Signals in Noncoherent OCDMA Systems

The possibility of using acousto-optic multiband filters for construction of code division multiple-access communication networks has been experimentally proved. Correlation interference has been studied for a set of bands with a spectrum close to sin(x)/x function which are used for encoding/decoding. For the case of several transmitters, a special technology was developed and realized that made it possible to perform studies on a transmission line based on two filters. The key component of this technology lies in emulating the sum signal from two to five transmitters on the first filter. The measured signal-to-interference ratio was more than 11 dB and decreased by less than 3 dB due to correlation interference from the network neighborhood and the emulation error of the sum signal.

Sum-Rate Maximization for IRS-Assisted UAV OFDMA Communication Systems

In this paper, we consider the application of intelligent reflecting surface (IRS) in unmanned aerial vehicle (UAV)-based orthogonal frequency division multiple access (OFDMA) communication systems, which exploits both the significant beamforming gain brought by the IRS and the high mobility of UAV for improving the system sum-rate. The joint design of UAV's trajectory, IRS scheduling, and communication resource allocation for the proposed system is formulated as a non-convex optimization problem to maximize the system sum-rate while taking into account the heterogeneous quality-of-service (QoS) requirement of each user. The existence of an IRS introduces both frequency-selectivity and spatial-selectivity in the fading of the composite channel from the UAV to ground users. To facilitate the design, we first derive the expression of the composite channels and propose a parametric approximation approach to establish an upper and a lower bound for the formulated problem. An alternating optimization algorithm is devised to handle the lower bound optimization problem and its performance is compared with the benchmark performance achieved by solving the upper bound problem. Simulation results unveil the small gap between the developed bounds and the promising sum-rate gain achieved by the deployment of an IRS in UAV-based communication systems.

Deep Learning Based Successive Interference Cancellation Scheme in Nonorthogonal Multiple Access Downlink Network

In this paper, a deep learning-based successive interference cancellation (SIC) scheme for use in nonorthogonal multiple access (NOMA) communication systems is investigated. NOMA has become a notable technique in the field of mobile wireless communication because of its capacity to overcome orthogonality, unlike a conventional orthogonal frequency division multiple access (OFDMA) communication system. In NOMA communication systems, SIC is one of the decoding schemes applied at receivers for downlink NOMA transmissions. In this paper, a convolutional neural network (CNN)-based SIC scheme is proposed to improve performance of the single base station and multiuser NOMA scheme. In contrast to existing SIC schemes, the proposed CNN-based SIC scheme can effectively mitigate losses resulting from imperfections of the SIC. The simulation results indicate that the CNN-based SIC method can successfully relieve conventional SIC impairments and achieve good detection performance. Consequently, a CNN-based SIC scheme can be considered as a potential technique for use in NOMA detection schemes.

New Constructions of Codebooks Nearly Meeting the Welch Bound

Optimal codebooks meeting the Welch bound with equality are desirable in many areas, such as direct spread code division multiple access communications, compressed sensing and so on. However, it is difficult to construct such optimal codebooks. There have been a number of attempts to construct codebooks nearly meeting the Welch bound. In this paper, we introduce a generic construction of codebooks using generalized bent functions from [Formula: see text] to [Formula: see text], where [Formula: see text] is a prime and [Formula: see text] is a positive integer with [Formula: see text]. With this construction, we obtain two new families of codebooks nearly meeting the Welch bound. These codebooks have new parameters and could have a small alphabet size. In particular, a class of regular generalized bent functions from [Formula: see text] to [Formula: see text] is presented.

Frequency-Angle Spectrum Hole Detection with Taylor Expansion Based Focusing Transformation

In cognitive radio (CR), the problem of spectrum hole detection has been extensively studied in single dimension, such as frequency domain, spatial domain, and so on. Recently, a class of two dimension spectrum hole detection methods, named as joint angle-frequency estimation (JAFE), has attracted much attention. Nevertheless, most of the existing approaches are only suitable for the scenario with matching frequency-angle pairs, rather than the non-matching scenario between the two parameters, like space division multiple access (SDMA) or frequency division multiplexing access (FDMA) communication mode which allows the same frequency band (or angle) to be reused in different angles (or frequencies). For the above two cases, including matching and non-matching scenarios, this paper develops an effective frequency-angle spectrum hole detection algorithm with Taylor expansion based focusing transformation (TFT-FASHD), on the basis of signal sparse representation by extending the array manifold from angle domain to frequency-angle domain. In the proposed method, for Fourier transform representation of the sparse model, a focusing transformation based on Taylor expansion is first performed to focus the signal subspaces at different frequencies to a single frequency, so as to carry out dimension reduction of dictionary in angular domain. TFT is derived by decomposing the array manifold with Taylor expansion, and further the optimum focusing frequency of focusing transform is discussed theoretically. Second, atoms with high representative performance are chosen by the presented TFT and compressed sensing (CS). Third, according to the low dimension dictionary, the TFT-FASHD is implemented by CS under multiple measurement vector (MMV) circumstances. The accuracy of the algorithm in non-matching scenario is verified by simulation results. For the matching scenario, compared with the related JAFE methods, the proposed algorithm has a lower computational complexity, smaller detection error, and higher energy efficiency, which are validated through simulation.

ECC joins first time with SC-FDMA for Mission “security”

The recent advancements in the internet technology have created the urgency in developing critical data security framework around the globe. One of the most shared multimedia objects is the image which is safeguarded through a task called image encryption. An integrated approach to image encryption is the need of the hour which can combine algorithm and communication model. In this context, this work presents the first- of- its- kind approach addressing Elliptic Curve Cryptography (ECC) to encrypt and decrypt the images to enhance their security during transmission via Single Carrier Frequency Division Multiple Access (SC-FDMA) communication systems. The uniqueness of this work is to combine the encryption scheme and subsequent wireless transmission. Modified Huffman coding has been employed to achieve compression. The viability of the proposed approach was tested and the performance metrics namely Entropy, PSNR, Histogram, correlation coefficient, differential attack, NIST test, and occulation attack analyses were evaluated. The simulation results prove the efficiency of the proposed integrated encryption – compression – communication schema.

A New Construction of Codebooks Meeting the Levenshtein Bound

Codebooks with low coherence have extensive applications in many fileds such as code division multiple access (CDMA) communication systems, MIMO communications, compressed sensing and so on. In this paper, based on additive characters over finite fields, we propose a construction of optimal codebook with respect to the Levenshtein bound and verify that it is a new construction. By shortening the length of the optimal codebooks, we present a construction of codebooks asymptotically meeting the Levenshtein bound. To the best of our knowledge, the parameters of the asymptotically optimal codebooks are new.

Asymptotically Optimal Codebooks Derived From Generalised Bent Functions

Codebooks are required to have small inner-product correlation in many practical applications, such as direct spread code division multiple access communications, space-time codes and compressed sensing. In general, it is difficult to construct optimal codebooks. In this paper, two kinds of codebooks are presented and proved to be optimally optimal with respect to the Welch bound. Additionally, the constructed codebooks in this paper have new parameters.

Evaluation of Zadoff–Chu, Kasami, and Chirp-Based Encoding Schemes for Acoustic Local Positioning Systems

The task of determining the physical coordinates of a target in indoor environments is still a key factor for many applications, including people and robot navigation, user tracking, location-based advertising, augmented reality, gaming, emergency response, or ambient-assisted living environments. Among the different possibilities for indoor positioning, acoustic local positioning systems (ALPSs) have the potential for centimeter-level positioning accuracy with coverage distances up to tens of meters. In addition, acoustic transducers are small, low cost, and reliable thanks to the room constrained propagation of these mechanical waves. Waveform design (coding and modulation) is usually incorporated into these systems to facilitate the detection of the transmitted signals at the receiver. The aperiodic correlation properties of the emitted signals have a large impact on how the ALPSs cope with common impairment factors, such as multipath propagation, multiple access interference, Doppler shifting, near-far effect, or ambient noise. This article analyzes three of the most promising families of codes found in the literature for ALPS: Kasami codes, Zadoff–Chu, and orthogonal chirp signals. The performance of these codes is evaluated in terms of time of arrival accuracy and characterized by means of model simulation under realistic conditions and by means of experimental tests in controlled environments. The results derived from this study can be of interest for other applications based on spreading sequences, such as underwater acoustic systems, ultrasonic imaging, or even code division multiple access (CDMA) communications systems.

Codebooks from generalized bent [formula omitted]-valued quadratic forms

Codebooks with small inner-product correlation have applications in unitary space–time modulations, multiple description coding over erasure channels, direct spread code division multiple access communications, compressed sensing, and coding theory. It is interesting to construct codebooks (asymptotically) achieving the Levenshtein bound. This paper presents a class of generalized bent Z4-valued quadratic forms, which contains functions proposed by Heng and Yue (2017). Using these generalized bent Z4-valued quadratic forms, we construct optimal codebooks achieving the Levenshtein bound. These codebooks have parameters (22m+2m,2m) and alphabet size 6.

Augmented Lagrangian combined to evolutionary heuristic for energy efficiency in OCDMA networks

This paper proposes combining the augmented Lagrangian method (ALM) with evolutionary heuristic methods, as well as quasi-Newton optimization methods applied to the energy efficiency (EE) maximization in the optical code division multiple access (OCDMA) communication network. The particle swarm optimization (PSO) and a hybridization between the PSO and the gravitational search algorithm (GSA) called PSOGSA have been deployed. The ALM structure replaces the objective function and allows a best fit to the problem, and ultimately provide more information about the solution. Numerical results demonstrate the robustness and low-complexity of hybrid ALM-PSO, while the ALM associated with PSOGSA attains robustness at cost of high-complexity. In turn, the usually ALM combined with Broyden-Fletcher-Goldfarb-Shanno (BFGS) method presents convergence for a restrict scenarios, failing to perform suitably for networks with large numbers of users.

Framework for a Perceptive Mobile Network Using Joint Communication and Radar Sensing

In this paper, we develop a framework for a novel perceptive mobile/cellular network that integrates radar sensing function into the mobile communication network. We propose a unified system platform that enables downlink and uplink sensing, sharing the same transmitted signals with communications. We aim to tackle the fundamental sensing parameter estimation problem in perceptive mobile networks, by addressing two key challenges associated with sophisticated mobile signals and rich multipath in mobile networks. To extract sensing parameters from orthogonal frequency division multiple access and spatial division multiple access communication signals, we propose two approaches to formulate it to problems that can be solved by compressive sensing techniques. Most sensing algorithms have limits on the number of multipath signals for their inputs. To reduce the multipath signals, as well as removing unwanted clutter signals, we propose a background subtraction method based on simple recursive computation, and provide a closed-form expression for performance characterization. The effectiveness of these methods is validated in simulations.

A further construction of asymptotically optimal codebooks with multiplicative characters

Codebooks with small inner-product correlation are preferred in many practical applications such as direct spread code division multiple access communications, coding theory, compressed sensing and so on. Heng et al. (IEEE Trans Inf Theory 63(10):6179–6187, 2017), Heng (Discrete Appl Math 250:227–240, 2018) and Luo and Cao (IEEE Trans Inf Theory 64(10):6498–6505, 2018) proposed constructions of asymptotically optimal codebooks via character sums related to Jacobi sums. In this paper, we mainly present a further generalization of the work by Heng (2018). The construction in this paper is an extension and generalization of the above works, and deduces a class of asymptotically optimal codebooks. Furthermore, the parameters of the codebooks are flexible and new.

Approach to MAI cancellation for micro-satellite clusters

With the development of micro-satellite technology, traditional monolithic satellites can be replaced by micro-satellite clusters to achieve high flexibility and dynamic reconfiguration capability. For satellite clusters based on the frequency division-code division multiple access (FD-CDMA) communication system, the inter-satellite ranging precision is usually constrained due to the influence of multi-address interference (MAI). The multi-user detection (MUD) is a solution to MAI, which can be divided into two categories: the linear detector (LD) and the non-linear detector (NLD). The general idea of the LD is aiming to make a better decision during the symbol decision process by using the information of all channels. However, it is not beneficial for the signal phase tracking precision. Instead, the principle of the NLD is to rebuild the interference signal and cancel it from the original one, which can improve the ranging performance at the expense of considerable delays. In order to enable simultaneous ranging and communication and reduce multi-node ranging performance degradation, this paper proposes an NLD scheme based on a delay locked loop (DLL), which simplifies the receiver structure and introduces no delay in the decision process. This scheme utilizes the information obtained from the interference channel to reconstruct the interference signal and then cancels it from the original delayed signal. Therefore, the DLL input signal-to-interference ratio (SIR) of the desired channel can be significantly improved. The experimental results show that with the proposed scheme, the standard deviation of the tracking steady error is decreased from 5.59 cm to 3.97 cm for SIR = 5 dB, and 13.53 cm to 5.77 cm for SIR = -5 dB, respectively.