Searcharxiv⌕ Search

arXiv subjects

Mohamed H. Ahmed

Publications and source records attributed to Mohamed H. Ahmed.

12 recordsLinked to original sources

Threat-Aware Energy-Efficient Deployment for Dynamic UAV Networks: A Multi-Agent RL Approach

Ensuring operational safety in threat-prone environments remains a critical challenge for multi-UAV networks serving as aerial base stations. This paper proposes an efficient framework to maximize global energy efficiency (EE) while promoting safe operation through threat-aware clustering and reward-based safety enforcement. The proposed framework is executed in three steps. First, a threat-aware K-means (TAKM) algorithm determines the minimum required UAVs and computes safe initial placements. Second, an optimal matching stage assigns physical UAVs to these centroids to minimize energy expenditure. Third, a threat-aware multi-agent twin delayed deep deterministic policy gradient (MATD3) algorithm dynamically optimizes trajectories, power, and user associations. Simulation results show that the proposed framework achieves zero observed safety violations in the considered scenarios while achieving superior EE and faster convergence than other learning methods and non-clustering baselines. Compared to heuristic optimization, the proposed framework outperforms the greedy particle swarm optimization (GPSO) and achieves performance comparable to that of the optimized PSO (OPSO), while incurring significantly lower online deployment computational complexity. Furthermore, the proposed framework demonstrates effective generalization to unseen user distributions, large UAV fleets, and different threat geometries, while maintaining zero safety violations.

cs.IT↗

RIS-Assisted Physical Layer Security in Emerging RF and Optical Wireless Communication Systems: A Comprehensive Survey

Physical layer security (PLS) has received a growing interest from the research community for its ability to safeguard data confidentiality without relying on key distribution or encryption/decryption. However, the evolution towards the 5G technology and beyond poses new security challenges that must be addressed in order to fulfill the unprecedented performance requirements of future wireless networks. Among the potential enabling technologies, RIS has attracted extensive attention due to its ability to proactively and intelligently reconfigure the wireless propagation environment to combat dynamic wireless channel impairments. Consequently, the RIS technology can be adopted to improve the information-theoretic security of both RF and OWC systems. This survey paper provides a comprehensive overview of the information-theoretic security of RIS-based RF and optical systems. The article first discusses the fundamental concepts of PLS and RIS technologies, followed by their combination in both RF and OWC systems. Subsequently, some optimization techniques are presented in the context of the underlying system model, followed by an assessment of the impact of RIS-assisted PLS through a comprehensive performance analysis. Given that the computational complexity of future communication systems that adopt RIS-assisted PLS is likely to increase rapidly as the number of interactions between the users and infrastructure grows, ML is seen as a promising approach to address this complexity issue while sustaining or improving the network performance. A discussion of recent research studies on RIS-assisted PLS-based systems embedded with ML is presented. Furthermore, some important open research challenges are proposed and discussed to provide insightful future research directions, with the aim of moving a step closer towards the development and implementation of the forthcoming 6G wireless technology.

cs.IT↗

RIS-Aided Physical Layer Security Improvement in Underlay Cognitive Radio Networks

In this paper, a reconfigurable intelligent surface (RIS)-aided underlay cognitive radio network is investigated. An RIS is utilized to improve the secondary network (SN) reliability and robustness while simultaneously increasing the physical layer security of the primary network (PN). Toward this end, closedform expressions for the SN outage probability, PN secrecy outage probability, and PN probability of non-zero secrecy capacity are derived. To increase the eavesdropping signals of the PN, the eavesdropper uses two combining techniques, namely maximal ratio combining and selection combining. Furthermore, the advantages of the proposed system model are verified through numerical and simulation results.

eess.SP↗

Energy-Efficient Power Loading for OFDM-based Cognitive Radio Systems with Channel Uncertainties

In this paper, we propose a novel algorithm to optimize the energy-efficiency (EE) of orthogonal frequency division multiplexing-based cognitive radio systems under channel uncertainties. We formulate an optimization problem that guarantees a minimum required rate and a specified power budget for the secondary user (SU), while restricting the interference to primary users (PUs) in a statistical manner. The optimization problem is non-convex and it is transformed to an equivalent problem using the concept of fractional programming. Unlike all related works in the literature, we consider the effect of imperfect channel-stateinformation (CSI) on the links between the SU transmitter and receiver pairs and we additionally consider the effect of limited sensing capabilities of the SU. Since the interference constraints are met statistically, the SU transmitter does not require perfect CSI feedback from the PUs receivers. Simulation results sho w that the EE deteriorates as the channel estimation error increases. Comparisons with relevant works from the literature show that the interference thresholds at the PUs receivers can be severely exceeded and the EE is slightly deteriorated if the SU does no t account for spectrum sensing errors.

eess.SP↗

Rate-Interference Tradeoff in OFDM-based Cognitive Radio Networks

In cognitive radio (CR) networks, secondary users (SUs) are allowed to opportunistically access the primary users (PUs) spectrum to improve the spectrum utilization; however, this increases the interference levels at the PUs. In this paper, we consider an orthogonal frequency division multiplexing OFDM-based CR network and investigate the tradeoff between increasing the SU transmission rate (hence improving the spectrum utilization) and reducing the interference levels at the PUs. We formulate a new multiobjective optimization (MOOP) problem that jointly maximizes the SU transmission rate and minimizes its transmit power, while imposing interference thresholds to the PUs. Further, we propose an algorithm to strike a balance between the SU transmission rate and the interference levels to the PUs. The proposed algorithm considers the practical scenario of knowing partial channel state information (CSI) of the links between the SU transmitter and the PUs receivers. Simulation results illustrate the performance of the proposed algorithm and its superiority when compared to the work in the literature.

eess.SP↗

A Novel Algorithm for Rate/Power Allocation in OFDM-based Cognitive Radio Systems with Statistical Interference Constraints

In this paper, we adopt a multiobjective optimization approach to jointly optimize the rate and power in OFDM-based cognitive radio (CR) systems. We propose a novel algorithm that jointly maximizes the OFDM-based CR system throughput and minimizes its transmit power, while guaranteeing a target bit error rate per subcarrier and a total transmit power threshold for the secondary user (SU), and restricting both co-channel and adjacent channel interferences to existing primary users (PUs) in a statistical manner. Since the interference constraints are met statistically, the SU transmitter does not require perfect channel-state-information (CSI) feedback from the PUs receivers. Closed-form expressions are derived for bit and power allocations per subcarrier. Simulation results illustrate the performance of the proposed algorithm and compare it to the case of perfect CSI. Further, the results show that the performance of the proposed algorithm approaches that of an exhaustive search for the discrete global optimal allocations with significantly reduced computational complexity.

eess.SP↗

A Novel Algorithm for Joint Bit and Power Loading for OFDM Systems with Unknown Interference

In this paper, a novel low complexity bit and power loading algorithm is formulated for orthogonal frequency division multiplexing (OFDM) systems operating in fading environments and in the presence of unknown interference. The proposed non-iterative algorithm jointly maximizes the throughput and minimizes the transmitted power, while guaranteeing a target bit error rate (BER) per subcarrier. Closed-form expressions are derived for the optimal bit and power distributions per subcarrier. The performance of the proposed algorithm is investigated through extensive simulations. A performance comparison with the algorithm in [1] shows the superiority of the proposed algorithm with reduced computational effort.

eess.SP↗

Optimal Bit and Power Loading for OFDM Systems with Average BER and Total Power Constraints

In this paper, a novel joint bit and power loading algorithm is proposed for orthogonal frequency division multiplexing (OFDM) systems operating in fading environments. The algorithm jointly maximizes the throughput and minimizes the transmitted power, while guaranteeing a target average bit error rate (BER) and meeting a constraint on the total transmit power. Simulation results are described that illustrate the performance of the proposed scheme and demonstrate its superiority when compared to the algorithm in [1].

eess.SP↗

Constrained Joint Bit and Power Allocation for Multicarrier Systems

This paper proposes a novel low complexity joint bit and power suboptimal allocation algorithm for multicarrier systems operating in fading environments. The algorithm jointly maximizes the throughput and minimizes the transmitted power, while guaranteeing a target bit error rate (BER) per subcarrier and meeting a constraint on the total transmit power. Simulation results are described that illustrate the performance of the proposed scheme and demonstrate its superiority when compared to the algorithm in [4] with similar or reduced computational complexity. Furthermore, the results show that the performance of the proposed suboptimal algorithm approaches that of an optimal exhaustive search with significantly lower computational complexity.

eess.SP↗

Joint Optimization of Bit and Power Loading for Multicarrier Systems

In this letter, a novel low complexity bit and power loading algorithm is formulated for multicarrier communication systems. The proposed algorithm jointly maximizes the throughput and minimizes the transmit power through a weighting coefficient $α$, while meeting constraints on the target bit error rate (BER) per subcarrier and on the total transmit power. The optimization problem is solved by the Lagrangian multiplier method if the initial $α$ causes the transmit power not to violate the power constraint; otherwise, a bisection search is used to find the appropriate $α$. Closed-form expressions are derived for the close-to-optimal bit and power allocations per subcarrier, average throughput, and average transmit power. Simulation results illustrate the performance of the proposed algorithm and demonstrate its superiority with respect to existing allocation algorithms. Furthermore, the results show that the performance of the proposed algorithm approaches that of the exhaustive search for the discrete optimal allocations.

eess.SP↗

Throughput Analysis of Network Coding in Multi-Hop Wireless Mesh Networks Using Queueing Theory

In recent years, a significant amount of research has been conducted to explore the benefits of network coding in different scenarios, from both theoretical and simulation perspectives. In this paper, we utilize queueing theory to propose an analytical framework for bidirectional unicast flows in multi-hop wireless mesh networks, and study throughput of inter-flow network coding. We analytically determine performance metrics such as the probability of successful transmission in terms of collision probability, and feedback mechanism and retransmission. Regarding the coding process, our model uses a multi-class queueing network where coded packets are separated from native packets and have a non-preemptive higher priority over native packets, and both queues are in a stable state. Finally, we use simulations to verify the accuracy of our analytical model.

cs.NI↗

A Two-Phase Power Allocation Scheme for CRNs Employing NOMA

In this paper, we consider the power allocation (PA) problem in cognitive radio networks (CRNs) employing nonorthogonal multiple access (NOMA) technique. Specifically, we aim to maximize the number of admitted secondary users (SUs) and their throughput, without violating the interference tolerance threshold of the primary users (PUs). This problem is divided into a two-phase PA process: a) maximizing the number of admitted SUs; b) maximizing the minimum throughput among the admitted SUs. To address the first phase, we apply a sequential and iterative PA algorithm, which fully exploits the characteristics of the NOMA-based system. Following this, the second phase is shown to be quasiconvex and is optimally solved via the bisection method. Furthermore, we prove the existence of a unique solution for the second phase and propose another PA algorithm, which is also optimal and significantly reduces the complexity in contrast with the bisection method. Simulation results verify the effectiveness of the proposed two-phase PA scheme.

cs.IT↗