The exact expressions and simple tight lower bounds for end-to-end average symbol error rate (ASER) and outage probability (OP) are derived in amplify-and-forward (AF) source-relay-destination cooperative link, provided that source-destination path is correlated with the source-relay path. Afterward, an optimum power allocation (PA) and relay location (RL) algorithm is presented. The effect of correlation factor and path-loss exponent (PLE) on the optimal nodes’ power and location is investigated. The results show that optimizing relay location is more efficient than power allocation. Furthermore, a machine learning (ML) implementation of the proposed convex optimization-based algorithm is investigated to cop the computational burden. Specifically, the data set is obtained by using the proposed algorithm. Given the data set, the optimization algorithm can be translated into a regression problem, and feed-forward neural networks (FNNs) are then employed to solve this problem efficiently. The simulation results represented a compromise between accuracy and computation times for the ML-based joint PA-RL optimization.
26 August 2024 in IEEE Open Journal of the Communications Society
This article addresses the JPACA problem in uplink NOMA networks, an essential consideration for enhancing the performance of wireless communication systems. We introduce a novel methodology that integrates CO and ML techniques to optimize resource allocation efficiently and effectively. Initially, we develop a CO-based algorithm that employs an alternating optimization strategy to iteratively solve for channel and power allocation, ensuring QoS while maximizing the system’s sum-rate. To overcome the inherent challenges of real-time application due to computational complexity, we further propose a ML-based approach that utilizes a stacking ensemble model combining CNN, FNN, and RF. This model is trained on a dataset generated via the CO algorithm to predict optimal resource allocation in real-time scenarios. Simulation results demonstrate that our proposed methods not only reduce the computational load significantly but also maintain high system performance, closely approximating the results of more computationally intensive exhaustive search methods. The dual approach presented not only enhances computational efficiency but also aligns with the evolving demands of future wireless networks, marking a significant step towards intelligent and adaptive resource management in NOMA systems.
This study proposes some multivariable approaches for power allocation in orthogonal frequency multiple access‐based differential chaos shift keying (OFDM‐DCSK) system. The objective is to minimise the overall bit error rate (BER) under the total transmission power limit. There is some literature focusing on the power allocation for OFDM‐DCSK systems, but all of them have only addressed the case where the power allocated to the reference subcarrier is assumed to be equal to one to simplify the problem to a single‐variable optimisation problem. In this study, the authors simultaneously take the reference and data‐bearing subcarriers power into consideration. They formulate a multivariable optimisation problem and solve it using Lagrange relaxation to derive a closed form solution. As the main contribution, the problem is converted to a cubic equation which is solved theoretically. Since the equation is non‐convex, they solve it again using a genetic algorithm (GA)‐based method for additive white Gaussian noise channel as a case study. The heuristic algorithm validates the theoretical approach. As another conclusion, the simulation results indicate that both of the proposed approaches outperform algorithms relaxing the reference power in terms of the BER performance, but the analytical solution leads to less time complexity in comparison with the GA‐based method.
11 August 2020 in Wireless Personal Communications