arXiv subjects

Chinmoy Kundu

Publications and source records attributed to Chinmoy Kundu.

At least 19 recordsLinked to original sources

arXiv2026

Reinforcement Learning for Secrecy Optimization in Underwater Energy Harvesting Relay Network

This paper explores secure communication in an underwater energy-harvesting (EH) relay network that supports hybrid optical-acoustic transmission. The optical hop is modeled using a Gamma-Gamma turbulence channel with pointing errors and may occasionally be blocked by underwater obstacles. At the same time, an eavesdropper is assumed to monitor the acoustic hop, creating a secrecy concern. To address this, we formulate the relay power allocation problem as an infinite-horizon Markov decision process (MDP). A model-based reinforcement learning (RL) driven optimal power allocation (OPA) strategy is proposed to maximize long-term cumulative secrecy performance until the network stops functioning. To offer lower-complexity alternatives, we also develop a Greedy Algorithm (GA) and a Naive Algorithm (NA). Simulation results show that the RL based OPA adapts effectively to battery dynamics, varying channel conditions, and optical link availability, achieving the highest secure data transmission, while GA performs reasonably and NA performs poorly due to its short-sighted decisions.

eess.SP↗

arXiv2026

Secrecy Performance of a Keyhole-based Multi-user System with Multiple Eavesdroppers

This paper investigates the secrecy performance of a keyhole-aided multi-user communication network in the presence of multiple eavesdroppers. The communication happens through the same keyhole for legitimate users and eavesdroppers. In this context, the secrecy performance is evaluated for a user scheduling technique by obtaining the exact closed-form expression of secrecy outage probability (SOP). Further, a simplified asymptotic SOP expression is derived assuming high signal-to-noise ratio (SNR) scenario for a better understanding of the impact of system parameters. The effect of the keyhole parameters, number of users, number of eavesdroppers, and threshold secrecy rate on the SOP performance are also investigated for the considered system model. In the high-SNR regime, the asymptotic SOP saturates to a constant value and does not depend on the keyhole parameter and the channel parameter of the source-to-keyhole channel.

eess.SP↗

arXiv2026

Secure Energy Efficient Wireless Transmission: A Finite v/s Infinite-Horizon RL Solution

In this paper, a joint optimal allocation of transmit power at the source and jamming power at the destination is proposed to maximize the average secrecy energy efficiency (SEE) of a wireless network within a finite time duration. The destination transmits the jamming signal to improve secrecy by utilizing full-duplex capability. The source and destination both have energy harvesting (EH) capability with limited battery capacity. Due to the Markov nature of the system, the problem is formulated as a finite-horizon reinforcement learning (RL) problem. We propose the finite-horizon joint power allocation (FHJPA) algorithm for the finite-horizon RL problem and compare it with a low-complexity greedy algorithm (GA). An infinite-horizon joint power allocation (IHJPA) algorithm is also proposed for the corresponding infinite-horizon problem. A comparative analysis of these algorithms is carried out in terms of SEE, expected total transmitted secure bits, and computational complexity. The results show that the FHJPA algorithm outperforms the GA and IHJPA algorithms due to its appropriate modelling in finite horizon transmission. When the source node battery has sufficient energy, the GA can yield performance close to the FHJPA algorithm despite its low-complexity. When the transmission time horizon increases, the accuracy of the infinite-horizon model improves, resulting in a reduced performance gap between FHJPA and IHJPA algorithms. The computational time comparison shows that the FHJPA algorithm takes $16.6$ percent less time than the IHJPA algorithm.

eess.SP↗

arXiv2025

On Beamforming for Transmitter Location Privacy in MIMO Systems

In this paper, we introduce a beamforming framework to ensure transmitter location privacy against sensing-capable MIMO receivers. We propose a novel privacy metric called the direction-of-arrival obfuscation power ratio (DoA-OPR) to design the transmit beamformer. The design approach reshapes the angular power distribution observed at the receiver so that a false direction appears dominant without nulling the line-of-sight (LoS) component. We derive closed-form bounds on the feasible range of DoA-OPR via generalized eigenvalue analysis and formulate an achievable rate-maximization problem under the DoA-OPR constraint. The resulting problem is non-convex but can be efficiently solved using semidefinite relaxation, eigenmode selection, and optimal power allocation. Numerical results demonstrate that the proposed DoA-OPR-based beamformer achieves a trade-off between location privacy and communication rate. The proposed design attains higher achievable rates than existing LoS-nulling approaches while maintaining comparable location privacy. A suboptimal design strategy is also proposed with reduced complexity. It achieves a near-optimal communication rate with a reduction of nearly 85%.

eess.SP↗

arXiv2025

Joint Transmit and Jamming Power Optimization for Secrecy in Energy Harvesting Networks: A Reinforcement Learning Approach

In this paper, we address the problem of joint allocation of transmit and jamming power at the source and destination, respectively, to enhance the long-term cumulative secrecy performance of an energy-harvesting wireless communication system until it stops functioning in the presence of an eavesdropper. The source and destination have energy-harvesting devices with limited battery capacities. The destination also has a full-duplex transceiver to transmit jamming signals for secrecy. We frame the problem as an infinite-horizon Markov decision process (MDP) problem and propose a reinforcement learning (RL)-based optimal joint power allocation (OJPA) algorithm that employs a policy iteration (PI) algorithm. Since the optimal algorithm is computationally expensive, we develop a low-complexity sub-optimal joint power allocation (SJPA) algorithm, namely, reduced state joint power allocation (RSJPA). Two other SJPA algorithms, the greedy algorithm (GA), and the naive algorithm (NA) are implemented as benchmarks. In addition, the OJPA algorithm outperforms the individual power allocation (IPA) algorithms termed individual transmit power allocation (ITPA) and individual jamming power allocation (IJPA), where the transmit and jamming powers, respectively, are optimized individually. The results show that the OJPA algorithm is also more energy efficient.Results also show that the OJPA algorithm significantly improves the secrecy performance compared to all SJPA algorithms. The OJPA algorithm also outperforms the secrecy performance of a genetic algorithm-based RL algorithm and a finite-horizon RL algorithm.The proposed RSJPA algorithm achieves nearly optimal performance with significantly less computational complexity marking it the balanced choice between the complexity and the performance.

eess.SP↗

arXiv2025

Opportunistic User Scheduling for Secure RIS-aided Wireless Communications

In this paper, we provide expressions for the secrecy outage probability (SOP) for suboptimal and optimal opportunistic scheduling schemes in a reconfigurable intelligent surface (RIS) aided {single antenna} system with multiple eavesdroppers in approximate closed form. A suboptimal scheduling (SS) scheme is analyzed, which is used when the channel state information (CSI) of the eavesdropping links is unavailable, and the optimal scheduling (OS) scheme is also analyzed, which is used when the global CSI is available. For each scheme, we provide a simplified expression for the SOP in the high signal-to-noise ratio (SNR) regime to demonstrate its behavior as a function of the key system parameters. At high SNR, the SOP saturates to a constant level which decreases exponentially with the number of RIS elements in the SS scheme and with the product of the number of RIS elements and the number of users in the OS scheme. We also show that the derived SOP of the SS scheme can directly provide the SOP for the best antenna-user pair scheduling scheme in a multiple antenna system. We compare the performance of the opportunistic user scheduling schemes with that of a non-orthogonal multiple access (NOMA) based scheduling scheme which chooses a pair of users in each time slot for scheduling and we show that the opportunistic schemes outperform the NOMA-based scheme. We also derive a closed-form expression for the SOP of a decode-and-forward (DF) relay-aided scheduling scheme in order to compare it with that of the RIS-aided system. It is found that the RIS-aided system outperforms the relay-aided systems when the number of RIS elements is sufficiently large. An increased number of RIS elements is required to outperform the relay-aided system at higher operating frequencies.

cs.IT↗

arXiv2024

Secrecy Analysis of CSI Ratio-Based Transmitter Selection with Unreliable Backhaul

This paper explores the secrecy performance of a multi-transmitter system with unreliable backhaul links. To improve secrecy, we propose a novel transmitter selection (TS) scheme that selects a transmitter with the maximum ratio of the destination channel power gain to the eavesdropping channel power gain. The backhaul reliability factor is incorporated with the distribution of the channel power gain through the utilization of a mixture distribution. We evaluate the non-zero secrecy rate (NZR) and the secrecy outage probability (SOP) as well as their asymptotes in two scenarios of backhaul activity knowledge, where it is available and where it is unavailable. The results illustrate that because of the unreliable backhaul, the proposed destination-to-eavesdropper channel power gain ratio-based TS scheme is constrained in terms of secrecy performance. However, performance enhancements are observed when the backhaul knowledge activity is utilized. Furthermore, the proposed scheme outperforms all the sub-optimal TS schemes and achieves nearly optimal performance without requiring noise power or the evaluation of the exact secrecy rate measurement.

cs.IT↗

arXiv2024

Multi-task Learning-based Joint CSI Prediction and Predictive Transmitter Selection for Security

In mobile communication scenarios, the acquired channel state information (CSI) rapidly becomes outdated due to fast-changing channels. Opportunistic transmitter selection based on current CSI for secrecy improvement may be outdated during actual transmission, negating the diversity benefit of transmitter selection. Motivated by this problem, we propose a joint CSI prediction and predictive selection of the optimal transmitter strategy based on historical CSI by exploiting the temporal correlation among CSIs. The proposed solution utilizes the multi-task learning (MTL) framework by employing a single Long Short-Term Memory (LSTM) network architecture that simultaneously learns two tasks of predicting the CSI and selecting the optimal transmitter in parallel instead of learning these tasks sequentially. The proposed LSTM architecture outperforms convolutional neural network (CNN) based architecture due to its superior ability to capture temporal features in the data. Compared to the sequential task learning models, the MTL architecture provides superior predicted secrecy performance for a large variation in the number of transmitters and the speed of mobile nodes. It also offers significant computational and memory efficiency, leading to a substantial saving in computational time by around 40 percent.

eess.SP↗

arXiv2023

Destination Scheduling for Secure Pinhole-Based Power-Line Communication

We propose an optimal destination scheduling scheme to improve the physical layer security (PLS) of a power-line communication (PLC) based Internet-of-Things system in the presence of an eavesdropper. We consider a pinhole (PH) architecture for a multi-node PLC network to capture the keyhole effect in PLC. The transmitter-to-PH link is shared between the destinations and an eavesdropper which correlates all end-to-end links. The individual channel gains are assumed to follow independent log-normal statistics. Furthermore, the additive impulsive noise at each node is modeled by an independent Bernoulli-Gaussian process. Exact computable expressions for the average secrecy capacity (ASC) and the probability of intercept (POI) performance over many different networks are derived. Approximate closed-form expressions for the asymptotic ASC and POI are also provided. We find that the asymptotic ASC saturates to a constant level as transmit power increases. We observe that the PH has an adverse effect on the ASC. Although the shared link affects the ASC, it has no effect on the POI. We show that by artificially controlling the impulsive to background noise power ratio and its arrival rate at the receivers, the secrecy performance can be improved.

cs.IT↗

arXiv2023

Secrecy of Opportunistic User Scheduling in RIS-Aided Systems: A Comparison with NOMA Scheduling

In this paper, we propose an opportunistic user scheduling scheme in a multi-user reconfigurable intelligent surface (RIS) aided wireless system to improve secrecy. We derive the secrecy outage probability (SOP) and its asymptotic expression in approximate closed form. The asymptotic analysis shows that the SOP does not depend on the transmitter-to-RIS distance and saturates to a fixed value depending on the ratio of the path loss of the RIS-to-destination and RIS-to-eavesdropper links and the number of users at high signal-to-noise ratio. It is shown that increasing the number of RIS elements leads to an exponential decrease in the SOP. We also compare our scheme with that of a non-orthogonal multiple access (NOMA) scheduling scheme, which chooses a pair of users to schedule in each time slot. The comparison shows that the SOP of all of the NOMA users is compromised, and that our proposed scheduling scheme has better performance.

cs.IT↗

arXiv2023

Transmitter Selection for Secrecy Against Colluding Eavesdroppers with Backhaul Uncertainty

Due to the exponential growth of interconnected devices and reduced cell coverage, beyond fifth-generation networks will be dense. Thus, instead of wired backhaul, wireless backhaul will be cost-effective and flexible. For security in multi-transmitter systems, sub-optimal and optimal transmitter selection schemes exist. However, including backhaul activity knowledge available (BKA) and backhaul activity knowledge unavailable (BKU) cases and transmitter selection schemes, there is no generalized secrecy analysis method. Moreover, evaluation of the ergodic secrecy rate (ESR) of the optimal selection schemes is impossible using existing solution approaches. To address these, we propose two sub-optimal and optimal transmitter selection schemes for a small-cell multi-transmitter system in BKU or BKA cases in the presence of multiple colluding eavesdroppers. We derive the distribution of the ratio of the destination channel SNR and eavesdropping channel SNR, thereby providing different secrecy performance metrics uniformly irrespective of selection schemes and BKU or BKA cases. Simplified asymptotic expressions are provided to elucidate the influence of the system parameters and of the backhaul reliability. We observe that the secrecy performance improves when the knowledge of backhaul link activity is utilized, and the improvement is most noticeable when the backhaul is highly unreliable. We also observe that while the secrecy performance degrades with an increasing number of eavesdroppers, neither the asymptotic saturation value of the secrecy outage probability nor the rate of improvement of the ESR with signal-to-noise-ratio depends on the number of eavesdroppers.

cs.IT↗

arXiv2022

Transmitter Selection for Secrecy in Frequency-Selective Fading with Multiple Eavesdroppers and Wireless Backhaul Links

This paper investigates the secrecy performance of sub-optimal transmitter selection (SS) and optimal selection (OS) schemes in a system comprising multiple transmitters, multiple eavesdroppers, and a single destination in frequency-selective fading channels with single carrier cyclic prefix modulation. Considering unreliable backhaul links between the access point and the transmitters, we analyze secrecy performance in two scenarios: when backhaul activity knowledge is available (KA) and when backhaul activity knowledge is unavailable (KU). Closed-form expressions for the secrecy outage probability (SOP) and ergodic secrecy rate (ESR) are derived. We also provide the corresponding asymptotic expressions when the backhaul links are unreliable as well as when the backhaul links are active in both KA and KU scenarios. We show that in the backhaul KA scenario, the asymptotic SOP and the slope of the ESR are governed by the number of transmitters and the backhaul reliability factor. In contrast, only the backhaul reliability factor influences these two parameters in the backhaul KU scenario. These parameters are independent of the number of eavesdroppers in both backhaul KA and KU scenarios. We also observe that the secrecy diversity order of both selection schemes is identical when all backhaul links are active.

cs.IT↗

arXiv2022

Ergodic Secrecy Rate of Optimal Source-Destination Pair Selection in Frequency-Selective Fading

Node selection is a simple technique to achieve diversity and thereby enhance the physical layer security in future wireless communication systems which require low complexity. High-speed data transmission often encounters frequency selective fading. In this context, we evaluate the exact closed-form expression for the ergodic secrecy rate (ESR) of the optimal source-destination pair selection scheme with single-carrier cyclic-prefix modulation, where the destination and eavesdropper channels both exhibit independent frequency selective fading with an arbitrary number of multipath components. A simplified analysis in the high-SNR scenario along with an asymptotic analysis is also provided. We also derive and compare the corresponding results for the sub-optimal source-destination pair selection scheme. We show that our analysis produces the corresponding ESR results under narrowband independent Nakagami-$m$ fading channel with any arbitrary integer parameter $m$. The effect of transmitters, destination and eavesdropping paths correlation on the ESR is also demonstrated. Our solution approach is general and can be used to find the ESR of a wider variety of transmitter selection schemes.

cs.IT↗

arXiv2022

Optimal Friendly Jamming and Transmit Power Allocation in RIS-assisted Secure Communication

This paper analyzes the secrecy performance of a reconfigurable intelligent surface (RIS) assisted wireless communication system with a friendly jammer in the presence of an eavesdropper. The friendly jammer enhances the secrecy by introducing artificial noise towards the eavesdropper without degrading the reception at the destination. Approximate secrecy outage probability (SOP) is derived in closed form. We also provide a simpler approximate closed-form expression for the SOP in order to understand the effect of system parameters on the performance and to find the optimal power allocation for the transmitter and jammer. The optimal transmit and jamming power allocation factor is derived by minimizing the SOP assuming a total power constraint. It is shown that the SOP performance is significantly improved by the introduction of the jammer and a gain of approximately $3$ dB is achieved at an SOP of $10^{-4}$ by optimally allocating power compared to the case of equal power allocation.

cs.IT↗

arXiv2021

Incremental Relaying for Power Line Communication: Performance Analysis and Power Allocation

In this paper, incremental decode-and-forward (IDF) and incremental selective decode-and-forward (ISDF) relaying are proposed to improve the spectral efficiency of power line communication. Contrary to the traditional decode-and-forward (DF) relaying, IDF and ISDF strategies utilize the relay only if the direct link ceases to attain a certain information rate, thereby improving the spectral efficiency. The path gain through the power line is assumed to be log-normally distributed with high distance-dependent attenuation and the additive noise is from a Bernoulli-Gaussian process. Closed-form expressions for the outage probability, and approximate closed-form expressions for the end-to-end average channel capacity and the average bit error rate for binary phase-shift keying are derived. Furthermore, a closed-form expression for the fraction of times the relay is in use is derived as a measure of the spectral efficiency. Comparative analysis of IDF and ISDF with traditional DF relaying is presented. It is shown that IDF is a specific case of ISDF and can obtain optimal spectral efficiency without compromising the outage performance. By employing power allocation to minimize the outage probability, it is realized that the power should be allocated in accordance with the inter-node distances and channel parameters.

eess.SP↗

arXiv2021

Secrecy Outage Probability of Cognitive Small-Cell Network with Unreliable Backhaul Connections

In this paper, we investigate the secrecy performance of underlay cognitive small-cell radio network with unreliable backhaul connections. The secondary cognitive small-cell transmitters are connected to macro base station by wireless backhaul links. The small-cell network is sharing the same spectrum with the primary network ensuring that a desired outage probability constraint in the primary network is always satisfied. We propose an optimal transmitter selection (OTS) scheme for small-cell network to transfer information to the destination. The closed-form expression of secrecy outage probability are derived. Our result shows that increasing the primary transmitter's transmit power and the number of small-cell transmitter can improve the system performance. The backhaul reliability of secondary and the desired outage probability of the primary also have significant impact on the system.

eess.SP↗

arXiv2021

Ergodic Secrecy Rate of Optimal Source Selection in a Multi-Source System with Unreliable Backhaul

The use of multiple source nodes with wireless backhaul is considered for secrecy enhancement through source node selection in future wireless networks. The ergodic secrecy rate (ESR) of {optimal source node selection in the presence of multiple eavesdroppers} over independent non-identically distributed (INID) Rayleigh fading channels is evaluated in closed-form. At high signal-to-noise ratio (SNR), {the ESR is expressed as a simple weighted summation where each term relates to the contribution of an individual source and eavesdropper}. An asymptotic analysis shows the effect of the system parameters and backhaul reliability on the performance. {The proposed method can provide a generalized solution for the ESR of optimal \textit{transmit antenna} selection in multi-antenna systems, optimal \textit{source node} selection, and optimal \textit{relay selection} with or without unreliable backhaul.

eess.SP↗

arXiv2021

Secrecy Outage of Dual-hop Regenerative Multi-relay System with Relay Selection

Relay selection is considered to enhance the secrecy of a dual-hop regenerative multi-relay system with an eavesdropper. Without assuming perfect decoding at the relays, the secrecy outage probability of a single relay system is obtained first. Secrecy outage of optimal, traditional and suboptimal relay selection schemes is then evaluated. To reduce the power consumption, partial relay selection schemes based only on either of the source-relay or relay-destination instantaneous channel state information (ICSI) are introduced. Its secrecy outage is evaluated and compared with the other schemes. Secrecy outage of all the selection schemes are obtained in closed-form. An optimal relay selection scheme is proposed using secrecy outage which does not require any ICSI. Asymptotic and diversity gain analysis of the secrecy outage is presented when source-relay and relay-destination average SNRs are same or different. We observe that the improvement in eavesdropper link quality affects the secrecy outage more when required secrecy rate is low as compared to the case when rate is high. We also observe that relay selection improves performance more when number of relays are more. It is important to note that either of the source-relay or the relay-destination link quality can equally limit the secrecy outage performance even if the other link quality is infinitely good.

eess.SP↗