Computational Methods in Wireless Communication

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "E1: Mathematics and Computer Science".

Deadline for manuscript submissions: 31 May 2026 | Viewed by 2865

Special Issue Editor


E-Mail
Guest Editor
School of Electrical Engineering, Kookmin University, Seoul, Republic of Korea
Interests: wireless communication

Special Issue Information

Dear Colleagues,

Computational Methods in Wireless Communication is a specialized field that focuses on the development of advanced computational techniques for the design, analysis, and optimization of wireless communication systems. This domain plays a critical role in enhancing the performance, efficiency, and reliability of modern wireless networks by leveraging sophisticated mathematical models, optimization algorithms, and machine learning methodologies. This interdisciplinary domain is indispensable for the evolution of future wireless communication technologies, underpinning innovations in ultra-reliable, high-speed, and intelligent networking systems.

We welcome submissions in the following research areas:

  1. Optimization Techniques
    • Application of advanced mathematical optimization frameworks to address complex challenges such as power allocation, spectrum management, and beamforming;
    • Utilization of methodologies including Convex and Non-Convex Optimization, as well as Metaheuristic Algorithms (e.g., Genetic Algorithms, Particle Swarm Optimization, etc.);
  1. Machine Learning and AI-Driven Approaches
    • Integration of deep learning and reinforcement learning techniques for intelligent signal detection, predictive channel modelling, and dynamic network traffic management;
    • Implementation of cutting-edge architectures such as Convolutional Neural Networks (CNNs), Recurrent Neural Networks (RNNs), Transformers, and Federated Learning to enhance wireless system intelligence.
  1. Theoretical Modelling and Stochastic Optimization
    • Development of probabilistic frameworks for characterizing wireless channel behaviour and optimizing network performance under uncertainty;
    • Deployment of techniques such as Markov Decision Processes (MDPs), Bayesian Inference, and Stochastic Control for adaptive resource allocation.
  1. Advanced Signal Processing Algorithms
    • Design and implementation of sophisticated signal processing methodologies for next-generation wireless technologies, including MIMO, OFDM, and adaptive beamforming;
    • Exploration of techniques such as compressive sensing, blind source separation, and advanced filtering methods to enhance spectral efficiency and interference mitigation.
  1. Quantum Computing and Next-Generation Computational Paradigms
    • Investigation of quantum computing’s potential to revolutionize wireless network optimization through quantum algorithms and quantum-assisted signal processing;
    • Development of low latency computing frameworks for mission-critical and high-speed wireless communication scenarios.

Dr. Taehyoung Kim
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 250 words) can be sent to the Editorial Office for assessment.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • next-generation wireless communication systems
  • optimization techniques
  • convex/non-convex optimization
  • artificial intelligence applications
  • deep learning
  • large language model
  • stochastic optimization
  • signal processing
  • mathematical modelling
  • statistics applications
  • quantum computing

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • Reprint: MDPI Books provides the opportunity to republish successful Special Issues in book format, both online and in print.

Further information on MDPI's Special Issue policies can be found here.

Published Papers (5 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

29 pages, 3379 KB  
Article
Robust OTFS Detection via MMSE-DFE Equalization for ISAC in Doubly Dispersive Channels
by Khaled Ramadan, Ibrahim Aqeel and Emad S. Hassan
Mathematics 2025, 13(21), 3545; https://doi.org/10.3390/math13213545 - 5 Nov 2025
Viewed by 453
Abstract
This paper presents a detailed performance evaluation of a proposed Orthogonal Time Frequency Space (OTFS) system for Integrated Sensing and Communications (ISAC) in doubly dispersive wireless channels, characterized by both delay and Doppler spreads. The system is benchmarked against conventional Orthogonal Frequency Division [...] Read more.
This paper presents a detailed performance evaluation of a proposed Orthogonal Time Frequency Space (OTFS) system for Integrated Sensing and Communications (ISAC) in doubly dispersive wireless channels, characterized by both delay and Doppler spreads. The system is benchmarked against conventional Orthogonal Frequency Division Multiplexing (OFDM) schemes with Linear Minimum Mean Square Error (LMMSE) and Minimum Mean Square Error Decision Feedback Equalizer (MMSE-DFE) receivers. Through extensive simulations, the paper assesses Bit Error Rate (BER) and throughput performance under various Signal-to-Noise Ratios (SNRs), channel estimation error percentages, and multipath conditions. Results indicate that the proposed OTFS system is highly suitable for ISAC scenarios due to its delay-Doppler domain resilience and robustness to mobility, delivering superior BER performance, e.g., 1.25×105 at 20 dB SNR with 0% estimation error, compared to 1.10×103 for OFDM-LMMSE. It also sustains 64 Mbps throughput under ideal conditions, though it shows sensitivity under severe estimation errors and rich multipath. In contrast, OFDM with LMMSE demonstrates smaller performance variation, maintaining over 61 Mbps throughput even at 100% estimation error and 15 scattered path components. These results suggest that OTFS is an effective waveform for ISAC when accurate channel estimation is available, while the corresponding OFDM with MMSE-DFE remains a robust fallback in highly uncertain environments. Full article
(This article belongs to the Special Issue Computational Methods in Wireless Communication)
Show Figures

Figure 1

22 pages, 574 KB  
Article
Resource Allocation and Energy Harvesting in UAV-Assisted Full-Duplex Cooperative NOMA Systems
by Turki Essa Alharbi
Mathematics 2025, 13(21), 3544; https://doi.org/10.3390/math13213544 - 5 Nov 2025
Viewed by 467
Abstract
Unmanned aerial vehicles (UAVs) are a promising technology for future sixth-generation (6G) wireless networks. They are airborne vehicles that act either as as flying relays or base stations (BS) to provide the line-of-sight (LOS) transmission, enable wide-area coverage, and increase the spectral efficiency. [...] Read more.
Unmanned aerial vehicles (UAVs) are a promising technology for future sixth-generation (6G) wireless networks. They are airborne vehicles that act either as as flying relays or base stations (BS) to provide the line-of-sight (LOS) transmission, enable wide-area coverage, and increase the spectral efficiency. In this work, a UAV is employed to forward information from the BS to distant users using a decode-and-forward (DF) protocol. The BS serves ground users through UAV by employing non-orthogonal multiple access (NOMA). The UAV relay will be wirelessly powered and harvests energy from the BS by applying a simultaneous wireless information and power transfer (SWIPT) technique. To further improve overall performance, the near user will act as a full-duplex (FD) relay to forward the far user’s information by applying cooperative non-orthogonal multiple access (C-NOMA). The proposed scheme considers a practical detection order using a feasible successive interference cancellation (SIC) operation. Additionally, a relay power control method is introduced for the near user to guarantee a reliable cooperative link. In the proposed scheme, a low-complexity closed-form power allocation is derived to maximize the minimum achievable rate. Numerical results demonstrate that the power allocation scheme significantly improves the far user’s rate performance, and the proposed scheme guarantees a higher target rate and outperforms the conventional NOMA, half-duplex (HD) C-NOMA, and FD C-NOMA with fixed power allocation (FPA) and fractional transmit power allocation (FTPA) schemes. Full article
(This article belongs to the Special Issue Computational Methods in Wireless Communication)
Show Figures

Figure 1

15 pages, 555 KB  
Article
Joint Antenna Selection and Transmit Power Optimization for UAV-Assisted Relaying in Cognitive Radio IoT Networks
by Dong-Woo Lim and Jae-Mo Kang
Mathematics 2025, 13(21), 3540; https://doi.org/10.3390/math13213540 - 4 Nov 2025
Viewed by 258
Abstract
In this paper, we study a cognitive relay Internet of Things (IoT) network aided by an unmanned aerial vehicle (UAV) equipped with multiple antennas. The UAV performs relaying for secondary communication under stringent interference constraints imposed by the primary network. To address the [...] Read more.
In this paper, we study a cognitive relay Internet of Things (IoT) network aided by an unmanned aerial vehicle (UAV) equipped with multiple antennas. The UAV performs relaying for secondary communication under stringent interference constraints imposed by the primary network. To address the outage probability floor problem caused by strong interference channels, we propose a novel joint antenna selection and transmit power optimization scheme for Rician fading channels. By using the time-sharing condition and the Lagrangian dual method, the nonconvex mixed-integer optimization problem is efficiently solved to obtain the optimal solution. Additionally, a closed-form asymptotic lower bound on the outage probability is derived for Rayleigh fading channels, providing valuable performance insights. Numerical results demonstrate that the proposed joint optimization scheme significantly outperforms existing works. Full article
(This article belongs to the Special Issue Computational Methods in Wireless Communication)
Show Figures

Figure 1

18 pages, 495 KB  
Article
Performance Analysis of Maximum Likelihood Detection in Cooperative DF MIMO Systems with One-Bit ADCs
by Tae-Kyoung Kim
Mathematics 2025, 13(15), 2361; https://doi.org/10.3390/math13152361 - 23 Jul 2025
Viewed by 635
Abstract
This paper investigates the error performance of cooperative decode-and-forward (DF) multiple-input multiple-output (MIMO) systems employing one-bit analog-to-digital converters (ADCs) over Rayleigh fading channels. In cooperative DF MIMO systems, detection errors at the relay may propagate to the destination, thereby degrading overall detection performance. [...] Read more.
This paper investigates the error performance of cooperative decode-and-forward (DF) multiple-input multiple-output (MIMO) systems employing one-bit analog-to-digital converters (ADCs) over Rayleigh fading channels. In cooperative DF MIMO systems, detection errors at the relay may propagate to the destination, thereby degrading overall detection performance. Although joint maximum likelihood detection can efficiently mitigate error propagation by leveraging probabilistic information from a source-to-relay link, its computational complexity is impractical. To address this issue, an approximate maximum likelihood (AML) detection scheme is introduced, which significantly reduces complexity while maintaining reliable performance. However, its analysis under one-bit ADCs is challenging because of its nonlinearity. The main contributions of this paper are summarized as follows: (1) a tractable upper bound on the pairwise error probability (PEP) of the AML detector is derived using Jensen’s inequality and the Chernoff bound, (2) the asymptotic behavior of the PEP is analyzed to reveal the achievable diversity gain, (3) the analysis shows that full diversity is attained only when symbol pairs in the PEP satisfy a sign-inverted condition and the relay correctly decodes the source symbol, and (4) the simulation results verify the accuracy of the theoretical analysis and demonstrate the effectiveness of the proposed analysis. Full article
(This article belongs to the Special Issue Computational Methods in Wireless Communication)
Show Figures

Figure 1

15 pages, 567 KB  
Article
Low-Complexity Relay Selection for Full-Duplex Random Relay Networks
by Jonghyun Bang and Taehyoung Kim
Mathematics 2025, 13(6), 971; https://doi.org/10.3390/math13060971 - 14 Mar 2025
Viewed by 654
Abstract
Full-duplex relay networks have been studied to enhance network performance under the assumption that the number and positions of relay nodes are fixed. To account for the practical randomness in the number and locations of relays, this paper investigates full-duplex random relay networks [...] Read more.
Full-duplex relay networks have been studied to enhance network performance under the assumption that the number and positions of relay nodes are fixed. To account for the practical randomness in the number and locations of relays, this paper investigates full-duplex random relay networks (FDRRNs) where all nodes are randomly distributed following a Poisson point process (PPP) model. In addition, we propose a low-complexity relay selection algorithm that constructs the candidate relay set while considering the selection diversity gain. Our simulation results demonstrate that, rather than simply increasing the number of candidate relay nodes, selecting an appropriate candidate relay set can achieve significant performance enhancement without unnecessarily increasing system complexity. Full article
(This article belongs to the Special Issue Computational Methods in Wireless Communication)
Show Figures

Figure 1

Back to TopTop