Zouheir Rezki
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Zouheir Rezki has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Mohamed-Slim Alouini
King Abdullah University of Science and Technology
18 shared publications - Anas Chaaban
School of Engineering, University of British Columbia, Kelowna, BC V1V 1V7, Canada
8 shared publications - Hamid R. Sadjadpour
University of California at Santa Cruz
8 shared publications - Mohammad Moltafet
Department of Electrical and Computer Engineering, University of California at Santa Cruz, Santa Cruz, CA, USA
7 shared publications - Morteza Soltani
Department of Electrical and Computer Engineering University of Idaho Moscow Idaho USA
4 shared publications - Zain Ali
College of Science and Engineering, Hamad bin Khalifa University, Doha, Qatar
3 shared publications
Latest Publications
- Open Access
- 26 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 1703-1705
WiP: Using Explainability to Enhance Wireless System Security
- 26 October 2026
- Published by Association for Computing Machinery (ACM)
- p. 1703-1705
Open AccessWiP: Using Explainability to Enhance Wireless System Security
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 7, 14703-14723
Cross-Layer Fingerprinting for Wireless Network Security
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 7, 14703-14723
Open AccessCross-Layer Fingerprinting for Wireless Network Security
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15, 6138-6142
Age-Aware Channel Estimation for Short-Packet Communications: An LSTM-Based Framework
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 15, 6138-6142
Age-Aware Channel Estimation for Short-Packet Communications: An LSTM-Based Framework
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- p. 1
OFDM Channel Estimation Leveraging Time–Frequency Correlation Using an LSTM-Based Framework
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- p. 1
Open AccessOFDM Channel Estimation Leveraging Time–Frequency Correlation Using an LSTM-Based Framework
- Open Access
Multi-Source M/G/1/1 Queues with Probabilistic Preemption
We consider a multi-source status update system consisting of multiple independent sources, a single server, and a single sink. Each source generates packets according to a Poisson process, and packets are served according to a general service time distribution. The system has a capacity of one packet, i.e., no waiting buffer, and is modeled as a multi-source M/G/1/1 queueing system. We introduce a probabilistically preemptive packet management policy, under which an existing packet from the same source in the system is replaced by an arriving packet with a fixed probability. We derive the moment generating functions (MGFs) of the age of information (AoI) and peak AoI (PAoI) for each source under this policy. Numerical results demonstrate the effectiveness of the proposed packet management policy.
Open AccessMulti-Source M/G/1/1 Queues with Probabilistic Preemption
We consider a multi-source status update system consisting of multiple independent sources, a single server, and a single sink. Each source generates packets according to a Poisson process, and packets are served according to a general service time distribution. The system has a capacity of one packet, i.e., no waiting buffer, and is modeled as a multi-source M/G/1/1 queueing system. We introduce a probabilistically preemptive packet management policy, under which an existing packet from the same source in the system is replaced by an arriving packet with a fixed probability. We derive the moment generating functions (MGFs) of the age of information (AoI) and peak AoI (PAoI) for each source under this policy. Numerical results demonstrate the effectiveness of the proposed packet management policy.
- 4 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP, 1
An Unconditionally Secure Encryption Scheme for IoBT Networks
We consider an Internet of Battlefield Things (IoBT) system consisting of multiple devices that want to securely communicate with each other during a mission in the presence of an adversary with unbounded computational power. The adversary has complete access to listen/read the ciphertext without tampering with the communication line. We provide an unconditionally secure encryption scheme to exchange messages among devices in the system. The main idea behind the scheme is to provide secret keys to exchange messages using a random binary matrix that is securely shared among all the devices, and pair-wise random secret keys established between each pair of devices attempting to communicate before the mission. The scheme is implemented by using finite group modular addition. We show that the scheme is absolutely semantically secure, i.e., the scheme guarantees that an adversary with unbounded computational power cannot get even one bit of information about a message, except for an exponentially small probability in a security parameter. Besides that, we show that even if the random binary matrix is revealed to the adversary, the provided scheme is computationally secure against the key recovery attack.
- 4 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP, 1
An Unconditionally Secure Encryption Scheme for IoBT Networks
We consider an Internet of Battlefield Things (IoBT) system consisting of multiple devices that want to securely communicate with each other during a mission in the presence of an adversary with unbounded computational power. The adversary has complete access to listen/read the ciphertext without tampering with the communication line. We provide an unconditionally secure encryption scheme to exchange messages among devices in the system. The main idea behind the scheme is to provide secret keys to exchange messages using a random binary matrix that is securely shared among all the devices, and pair-wise random secret keys established between each pair of devices attempting to communicate before the mission. The scheme is implemented by using finite group modular addition. We show that the scheme is absolutely semantically secure, i.e., the scheme guarantees that an adversary with unbounded computational power cannot get even one bit of information about a message, except for an exponentially small probability in a security parameter. Besides that, we show that even if the random binary matrix is revealed to the adversary, the provided scheme is computationally secure against the key recovery attack.
- Open Access
An Unconditionally Secure Encryption Scheme for IoBT Networks
We consider an Internet of Battlefield Things (IoBT) system consisting of multiple devices that want to securely communicate with each other during a mission in the presence of an adversary with unbounded computational power. The adversary has complete access to listen/read the ciphertext without tampering with the communication line. We provide an unconditionally secure encryption scheme to exchange messages among devices in the system. The main idea behind the scheme is to provide secret keys to exchange messages using a random binary matrix that is securely shared among all the devices, and pair-wise random secret keys established between each pair of devices attempting to communicate before the mission. The scheme is implemented by using finite group modular addition. We show that the scheme is absolutely semantically secure, i.e., the scheme guarantees that an adversary with unbounded computational power cannot get even one bit of information about a message, except for an exponentially small probability in a security parameter. Besides that, we show that even if the random binary matrix is revealed to the adversary, the provided scheme is computationally secure against the key recovery attack.
Open AccessAn Unconditionally Secure Encryption Scheme for IoBT Networks
We consider an Internet of Battlefield Things (IoBT) system consisting of multiple devices that want to securely communicate with each other during a mission in the presence of an adversary with unbounded computational power. The adversary has complete access to listen/read the ciphertext without tampering with the communication line. We provide an unconditionally secure encryption scheme to exchange messages among devices in the system. The main idea behind the scheme is to provide secret keys to exchange messages using a random binary matrix that is securely shared among all the devices, and pair-wise random secret keys established between each pair of devices attempting to communicate before the mission. The scheme is implemented by using finite group modular addition. We show that the scheme is absolutely semantically secure, i.e., the scheme guarantees that an adversary with unbounded computational power cannot get even one bit of information about a message, except for an exponentially small probability in a security parameter. Besides that, we show that even if the random binary matrix is revealed to the adversary, the provided scheme is computationally secure against the key recovery attack.
- Open Access
- 4 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Machine Learning in Communications and Networking
- Vol. 2, 1661-1677
Optimizing Power Allocation in HAPs Assisted LEO Satellite Communications
The next generation of communication devices will require robust connectivity for millions of ground devices such as sensors or mobile devices in remote or disaster-stricken areas to be connected to the network. Non-terrestrial network (NTN) nodes can play a vital role in fulfilling these requirements. Specifically, low-earth orbiting (LEO) satellites have emerged as an efficient and cost-effective technique to connect devices over long distances through space. However, due to their low power and environmental limitations, LEO satellites may require assistance from aerial devices such as high-altitude platforms (HAPs) or unmanned aerial vehicles to forward their data to the ground devices. Moreover, the limited power available at the NTNs makes it crucial to utilize available resources efficiently. In this paper, we present a model in which a LEO satellite communicates with multiple ground devices with the help of HAPs that relay LEO data to the ground devices. We formulate the problem of optimizing power allocation at the LEO satellite and all the HAPs to maximize the sum-rate of the system. To take advantage of the benefits of free-space optical (FSO) communication in satellites, we consider the LEO transmitting data to the HAPs on FSO links, which are then broadcast to the connected ground devices on radio frequency channels. We transform the complex non-convex problem into a convex form and compute the Karush-Kuhn-Tucker (KKT) conditions-based solution of the problem for power allocation at the LEO satellite and HAPs. Then, to reduce computation time, we propose a soft actor-critic (SAC) reinforcement learning (RL) framework that provides the solution in significantly less time while delivering comparable performance to the KKT scheme. Our simulation results demonstrate that the proposed solutions provide excellent performance and are scalable to any number of HAPs and ground devices in the system.
- 4 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Machine Learning in Communications and Networking
- Vol. 2, 1661-1677
Open AccessOptimizing Power Allocation in HAPs Assisted LEO Satellite Communications
The next generation of communication devices will require robust connectivity for millions of ground devices such as sensors or mobile devices in remote or disaster-stricken areas to be connected to the network. Non-terrestrial network (NTN) nodes can play a vital role in fulfilling these requirements. Specifically, low-earth orbiting (LEO) satellites have emerged as an efficient and cost-effective technique to connect devices over long distances through space. However, due to their low power and environmental limitations, LEO satellites may require assistance from aerial devices such as high-altitude platforms (HAPs) or unmanned aerial vehicles to forward their data to the ground devices. Moreover, the limited power available at the NTNs makes it crucial to utilize available resources efficiently. In this paper, we present a model in which a LEO satellite communicates with multiple ground devices with the help of HAPs that relay LEO data to the ground devices. We formulate the problem of optimizing power allocation at the LEO satellite and all the HAPs to maximize the sum-rate of the system. To take advantage of the benefits of free-space optical (FSO) communication in satellites, we consider the LEO transmitting data to the HAPs on FSO links, which are then broadcast to the connected ground devices on radio frequency channels. We transform the complex non-convex problem into a convex form and compute the Karush-Kuhn-Tucker (KKT) conditions-based solution of the problem for power allocation at the LEO satellite and HAPs. Then, to reduce computation time, we propose a soft actor-critic (SAC) reinforcement learning (RL) framework that provides the solution in significantly less time while delivering comparable performance to the KKT scheme. Our simulation results demonstrate that the proposed solutions provide excellent performance and are scalable to any number of HAPs and ground devices in the system.
- 16 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 13 (8) , 2090-2094
End-to-End Learning Framework for Space Optical Communications in Non-Differentiable Poisson Channel
This letter studies an autoencoder (AE) model for point-to-point space optical communications (SOC) in the presence of an intensity modulation and direct detection setting wherein the optical link is modeled by a Poisson channel model. While the Poisson channel is a realistic channel model in SOC, its non-differentiable nature poses challenges when applied to deep learning. In this letter, a novel non-gradient-based optimization framework has been applied to estimating the channel gradient, addressing the non-differentiability of Poisson channels. Furthermore, our AE incorporates normalization layers in both encoders and decoders for input data standardization and efficient training convergence. The incorporation of the hyper-tuning optimization algorithm alongside the AE enhances the performance of the standard AE. This improvement stems from the effective minimization of the error cost function through gradient descent. The numerical results demonstrate that the proposed AE outperforms both state-of-the-art learning frameworks and model-based schemes in bit error rate (BER) performance within the Poisson channel.
- 16 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 13 (8) , 2090-2094
End-to-End Learning Framework for Space Optical Communications in Non-Differentiable Poisson Channel
This letter studies an autoencoder (AE) model for point-to-point space optical communications (SOC) in the presence of an intensity modulation and direct detection setting wherein the optical link is modeled by a Poisson channel model. While the Poisson channel is a realistic channel model in SOC, its non-differentiable nature poses challenges when applied to deep learning. In this letter, a novel non-gradient-based optimization framework has been applied to estimating the channel gradient, addressing the non-differentiability of Poisson channels. Furthermore, our AE incorporates normalization layers in both encoders and decoders for input data standardization and efficient training convergence. The incorporation of the hyper-tuning optimization algorithm alongside the AE enhances the performance of the standard AE. This improvement stems from the effective minimization of the error cost function through gradient descent. The numerical results demonstrate that the proposed AE outperforms both state-of-the-art learning frameworks and model-based schemes in bit error rate (BER) performance within the Poisson channel.
- Open Access
- 18 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Machine Learning in Communications and Networking
- Vol. 2, 580-595
Multi-Agent Double Deep Q-Learning for Fairness in Multiple-Access Underlay Cognitive Radio Networks
Underlay Cognitive Radio (CR) systems were introduced to resolve the issue of spectrum scarcity in wireless communication. In CR systems, an unlicensed Secondary Transmitter (ST) shares the channel with a licensed Primary Transmitter (PT). Spectral efficiency of the CR systems can be further increased if multiple STs share the same channel. In underlay CR systems, the STs are required to keep interference at a low level to avoid outage at the primary system. The restriction on interference in underlay CR prevents some STs from transmitting while other STs may achieve high data rates, thus making the underlay CR network unfair. In this work, we consider the problem of achieving fairness in the rates of the STs. The considered optimization problem is non-convex in nature. The conventional iteration-based optimizers are time-consuming and may not converge when the considered problem is non-convex. To deal with the problem, we propose a deep-Q reinforcement learning (DQ-RL) framework that employs two separate deep neural networks for the computation and estimation of the Q-values which provides a fast solution and is robust to channel dynamic. The proposed technique achieves near optimal values of fairness while offering primary outage probability of less than 4%. Further, increasing the number of STs results in a linear increase in the computational complexity of the proposed framework. A comparison of several variants of the proposed scheme with the optimal solution is also presented. Finally, we present a novel cumulative reward framework and discuss how the combined-reward approach improves the performance of the communication system.
- 18 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Machine Learning in Communications and Networking
- Vol. 2, 580-595
Open AccessMulti-Agent Double Deep Q-Learning for Fairness in Multiple-Access Underlay Cognitive Radio Networks
Underlay Cognitive Radio (CR) systems were introduced to resolve the issue of spectrum scarcity in wireless communication. In CR systems, an unlicensed Secondary Transmitter (ST) shares the channel with a licensed Primary Transmitter (PT). Spectral efficiency of the CR systems can be further increased if multiple STs share the same channel. In underlay CR systems, the STs are required to keep interference at a low level to avoid outage at the primary system. The restriction on interference in underlay CR prevents some STs from transmitting while other STs may achieve high data rates, thus making the underlay CR network unfair. In this work, we consider the problem of achieving fairness in the rates of the STs. The considered optimization problem is non-convex in nature. The conventional iteration-based optimizers are time-consuming and may not converge when the considered problem is non-convex. To deal with the problem, we propose a deep-Q reinforcement learning (DQ-RL) framework that employs two separate deep neural networks for the computation and estimation of the Q-values which provides a fast solution and is robust to channel dynamic. The proposed technique achieves near optimal values of fairness while offering primary outage probability of less than 4%. Further, increasing the number of STs results in a linear increase in the computational complexity of the proposed framework. A comparison of several variants of the proposed scheme with the optimal solution is also presented. Finally, we present a novel cumulative reward framework and discuss how the combined-reward approach improves the performance of the communication system.