YSYalcin Sadi

Yalcin Sadi

*This is an algorithmically generated author record based on publicly available information.

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


Yalcin Sadi has a total of 23 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Secure Multi-User ISAC Using Precoding-Aided GSSK With Full Antenna Activation

    by İbRahim Kahraman, Negin Kazemipourleilabadi, Sumeyra Hassan, Yalcin Sadi, Mutlu Koca, Erdal Panayirci, H. Vincent Poor

  • Interference Free Multi-User Coded ISAC With Physical Layer Security

    by Sumeyra Hassan, Negin Kazemipourleilabadi, Ibrahim Kahraman, Yalcin Sadi, Mutlu Koca, Erdal Panayirci, H. Vincent Poor

    This paper proposes a multi-user integrated sensing and communication (ISAC) framework based on coded generalized spatial shift keying (MU-CGSSK) that enables secure, interference-free downlink transmission alongside high-resolution radar sensing. The system adopts a separated deployment model, allowing simultaneous communication and sensing over a shared frequency band using co-located antenna arrays. A systematic linear block code is employed to generate structured antenna activation patterns that ensure low bit error rates and optimal MU separation. A key feature is the proposed two-stage physical layer security (PLS) scheme. In the first stage, a channel state information (CSI)-based precoder eliminates MU and radar-induced interference while generating implicit jamming against eavesdroppers. The second stage enhances confidentiality under partial CSI leakage by applying lightweight scrambling to antenna index mappings. An alternating optimization algorithm jointly designs the precoding vector and power allocation to maximize the achievable secrecy sum-rate. Simulation results demonstrate that the MU-CGSSK ISAC system achieves reliable MU communication, accurate multi-target detection using the MUSIC algorithm, and robust secrecy performance under asymmetric channel conditions.


  • Open Access

    Interference-Free RIS-Aided Cell-Free Massive MIMO with Physical Layer Security

    by Sumeyra Hassan, Bin Li, Yalcin Sadi, Erdal Panayirci, H. Vincent Poor

    In this paper, a reconfigurable intelligent surface (RIS) assisted cell free massive MIMO (CFmMIMO) framework is designed to enhance physical layer security (PLS) and mitigate multi user (MU) interference in next generation wireless networks. A channel state information (CSI) based precoder is designed at the access point (AP) to suppress MU interference, enabling interference free reception for the legitimate users. To further enhance secrecy performance, we formulate a joint optimization problem that maximizes the secrecy sum rate using an alternating optimization (AO) framework, which iteratively updates the active beamforming at the AP, user power allocation, and the RIS phase shift matrix. The highly nonconvex problem is addressed under the Riemannian manifold optimization (RMO) framework and solved using a Riemannian Conjugate Gradient (RCG) algorithm for RIS phase shift design. Simulation results verify that the proposed framework effectively enhances the secrecy sum rate and eliminates interference, demonstrating its potential for secure and scalable CFmMIMO networks in dense wireless environments.

  • Resource allocation for discrete rate multi-cell energy constrained communication networks

    by Muhammad Shahid Iqbal, Elif Dilek Salik, Yalcin Sadi, Sinem Coleri

  • Open Access

    Minimum Length Scheduling for Multi-Cell Full Duplex Wireless Powered Communication Networks

    by Muhammad Shahid Iqbal, Yalcin Sadi, Sinem Coleri

    Wireless powered communication networks (WPCNs) will be a major enabler of massive machine type communications (MTCs), which is a major service domain for 5G and beyond systems. These MTC networks will be deployed by using low-power transceivers and a very limited set of transmission configurations. We investigate a novel minimum length scheduling problem for multi-cell full-duplex wireless powered communication networks to determine the optimal power control and scheduling for constant rate transmission model. The formulated optimization problem is combinatorial in nature and, thus, difficult to solve for the global optimum. As a solution strategy, first, we decompose the problem into the power control problem (PCP) and scheduling problem. For the PCP, we propose the optimal polynomial time algorithm based on the evaluation of Perron–Frobenius conditions. For the scheduling problem, we propose a heuristic algorithm that aims to maximize the number of concurrently transmitting users by maximizing the allowable interference on each user without violating the signal-to-noise-ratio (SNR) requirements. Through extensive simulations, we demonstrate a 50% reduction in the schedule length by using the proposed algorithm in comparison to unscheduled concurrent transmissions.


  • Minimum Length Scheduling for Discrete-Rate Full-Duplex Wireless Powered Communication Networks

    by Muhammad Shahid Iqbal, Yalcin Sadi, Sinem Coleri

    Wireless powered communication networks (WPCNs) will act as a major enabler of massive machine type communications (MTCs), which is a major service domain for 5G and beyond systems. The MTC networks will be deployed by using low-power transceivers with finite discrete configurations. This paper considers minimum length scheduling problem for full-duplex WPCNs, where users transmit information to a hybrid access point at a rate chosen from a finite set of discrete-rate levels. The optimization problem considers energy causality, data and maximum transmit power constraints, and is proven to be NP-hard. As a solution strategy, we define the minimum length scheduling (MLS) slot, which is slot of minimum transmission completion time while starting transmission at anytime after the decision time. We solve the problem optimally for a given transmission order based on the optimality analysis of MLS slot. For the general problem, we categorize the problem based on whether the MLS slots of users overlap over time. We propose optimal algorithm for non-overlapping scenario by allocating the MLS slots, and a polynomial-time heuristic algorithm for overlapping scenario by allocating the transmission slot to the user with earliest MLS slot. Through simulations, we demonstrate significant gains of scheduling and discrete rate allocation.


  • Open Access

    Minimum Length Scheduling for Full Duplex Time-Critical Wireless Powered Communication Networks

    by Muhammad Shahid Iqbal, Yalcin Sadi, Sinem Coleri

    Radio frequency (RF) energy harvesting is key in attaining perpetual lifetime for time-critical wireless powered communication networks due to full control on energy transfer, far field region, small and low-cost circuitry. In this paper, we propose a novel minimum length scheduling problem to determine the optimal power control, time allocation and transmission schedule subject to data, energy causality and maximum transmit power constraints in a full-duplex wireless powered communication network. We first formulate the problem as a mixed integer non-linear programming problem and conjecture that the problem is NP-hard. As a solution strategy, we demonstrate that the power control and time allocation, and scheduling problems can be solved separately in the optimal solution. For the power control and time allocation problem, we derive the optimal solution by using Karush-Kuhn-Tucker conditions. For the scheduling, we introduce a penalty function allowing reformulation as a sum penalty minimization problem. Upon derivation of the optimality conditions based on the characteristics of the penalty function, we propose two polynomial-time heuristic algorithms and a reduced-complexity exact algorithm employing smart pruning techniques. Via extensive simulations, we illustrate that the proposed heuristic schemes outperform the previously proposed schemes for predetermined transmission order of users and achieve close-to-optimal solutions.

  • Minimum Length Scheduling for Full Duplex Time-Critical Wireless Powered Communication Networks

    by Muhammad Shahid Iqbal, Yalcin Sadi, Sinem Coleri

    Radio frequency (RF) energy harvesting is key in attaining perpetual lifetime for time-critical wireless powered communication networks (WPCNs) due to full control on energy transfer, far field region, small and low-cost circuitry. In this paper, we propose a novel minimum length scheduling problem to determine the optimal power control, time allocation and schedule subject to data, energy causality and maximum transmit power constraints in a full-duplex WPCN. We first formulate the problem as a mixed integer non-linear programming problem and conjecture that the problem is NP-hard. As a solution strategy, we demonstrate that the power control and time allocation, and the scheduling problems can be solved separately in the optimal solution. For the power control and time allocation problem, we derive the optimal solution by evaluating Karush-Kuhn-Tucker conditions. For the scheduling, we introduce a penalty function allowing reformulation of the problem as a sum penalty minimization problem. Upon derivation of the optimality conditions based on the characteristics of the penalty function, we propose two polynomial-time heuristic algorithms and a reduced-complexity exact algorithm employing smart pruning techniques. Via extensive simulations, we illustrate that the proposed heuristic schemes outperform the schemes for predetermined transmission order of users and achieve close-to-optimal solutions.


  • Open Access

    Optimal On-Off Transmission Schemes for Full Duplex Wireless Powered Communication Networks

    by Muhammad Shahid Iqbal, Yalcin Sadi, Sinem Coleri

    In this paper, we consider a full duplex wireless powered communication network where multiple users with radio frequency energy harvesting capability communicate to an energy broadcasting hybrid access point. We investigate the minimum length scheduling and sum throughput maximization problems considering on-off transmission scheme in which users either transmit at a constant power or remain silent. For minimum length scheduling problem, we propose a polynomial-time optimal scheduling algorithm. For sum throughput maximization, we first derive the characteristics of an optimal schedule and then to avoid intractable complexity, we propose a polynomial-time heuristic algorithm which is illustrated to perform nearly optimal through numerical analysis.

  • Open Access

    Throughput Maximization for Full Duplex Wireless Powered Communication Networks

    by Muhammad Shahid Iqbal, Yalcin Sadi, Sinem Coleri

    In this paper, we consider a full duplex wireless powered communication network where multiple users with RF energy harvesting capabilities communicate to a hybrid energy and information access point. An optimization framework is proposed with the objective of maximizing the sum throughput of the users subject to energy causality and maximum transmit power constraints considering a realistic energy harvesting model incorporating initial battery levels of the users. The joint optimization of power control, time allocation and scheduling is mathematically formulated as a mixed integer non linear programming problem which is hard to solve for a global optimum. The optimal power and time allocation and scheduling decisions are investigated separately based on the optimality analysis on the optimization variables. Optimal power and time allocation problem is proven to be convex for a given transmission order. Based on the derived optimality conditions, we propose a fast polynomial-time complexity heuristic algorithm. We illustrate that the proposed algorithm performs very close-to-optimal while significantly outperforming an equal time allocation based scheduling scheme.