Şadi, Yalçın
Loading...
Name Variants
ŞADI, Yalçın
Şadi,Y.
Sadi,Y.
Yalçın Şadi
ŞADI, YALÇIN
Şadi, Y.
Sadi, Y.
Y. Sadi
Yalçın ŞADI
YALÇIN ŞADI
Sadi,Yalcin
S., Yalcin
Sadi, Yalçın
Şadi, Yalçın
Yalçın Sadi
Sadi Y.
Ş., Yalçın
Y. Şadi
Şadi, YALÇIN
Sadi, Yalcin
Yalcin, Sadi
S.,Yalcin
Şadi Y.
Şadi, Yalçın
Şadi,Y.
Sadi,Y.
Yalçın Şadi
ŞADI, YALÇIN
Şadi, Y.
Sadi, Y.
Y. Sadi
Yalçın ŞADI
YALÇIN ŞADI
Sadi,Yalcin
S., Yalcin
Sadi, Yalçın
Şadi, Yalçın
Yalçın Sadi
Sadi Y.
Ş., Yalçın
Y. Şadi
Şadi, YALÇIN
Sadi, Yalcin
Yalcin, Sadi
S.,Yalcin
Şadi Y.
Şadi, Yalçın
Job Title
Dr. Öğr. Üyesi
Email Address
yalcin.sadi@khas.edu.tr
Main Affiliation
Electrical-Electronics Engineering
Status
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID
Scholarly Output
28
Articles
11
Citation Count
148
Supervised Theses
4
6 results
Scholarly Output Search Results
Now showing 1 - 6 of 6
Article Citation - WoS: 14Citation - Scopus: 22Qos-Constrained Semi-Persistent Scheduling of Machine-Type Communications in Cellular Networks(IEEE, 2019) Karadağ, Göksu; Şadi, Yalçın; Gül, Recep; Sadi, Yalçın; Ergen, Sinem ColeriThe dramatic growth of machine-to-machine (M2M) communication in cellular networks brings the challenge of satisfying the quality of service (QoS) requirements of a large number of M2M devices with limited radio resources. In this paper we propose an optimization framework for the semi-persistent scheduling of M2M transmissions based on the exploitation of their periodicity with the goal of reducing the overhead of the signaling required for connection initiation and scheduling. The goal of the optimization problem is to minimize the number of frequency bands used by the M2M devices to allow fair resource allocation of newly joining M2M and human-to-human communications. The constraints of the problem are delay and periodicity requirements of the M2M devices. We first prove that the optimization problem is NP-hard and then propose a polynomial-time heuristic algorithm employing a fixed priority assignment according to the QoS characteristics of the devices. We show that this heuristic algorithm provides an asymptotic approximation ratio of 2.33 to the optimal solution for the case where the delay tolerances of the devices are equal to their periods. Through extensive simulations we demonstrate that the proposed algorithm performs better than the existing algorithms in terms of frequency band usage and schedulability.Article Citation - WoS: 35Citation - Scopus: 37Joint Optimization of Wireless Network Energy Consumption and Control System Performance in Wireless Networked Control Systems(IEEE-INST Electrical Electronics Engineers Inc, 2017) Şadi, Yalçın; Ergen, Sinem ColeriCommunication system design for wireless networked control systems requires satisfying the high reliability and strict delay constraints of control systems for guaranteed stability with the limited battery resources of sensor nodes despite the wireless networking induced non-idealities. These include non-zero packet error probability caused by the unreliability of wireless transmissions and non-zero delay resulting from packet transmission and shared wireless medium. In this paper we study the joint optimization of control and communication systems incorporating their efficient abstractions practically used in real-world scenarios. The proposed framework allows including any non-decreasing function of the power consumption of the nodes as the objective any modulation scheme and any scheduling algorithm. We first introduce an exact solution method based on the analysis of the optimality conditions and smart enumeration techniques. Then we propose two polynomial-time heuristic algorithms based on intelligent search space reduction and smart searching techniques. Extensive simulations demonstrate that the proposed algorithms perform very close to optimal and much better than previous algorithms at much smaller runtime for various scenarios.Master Thesis Semi Persistent Radio Resource Allocation for Machine Type Communications in 5g and Beyond Cellular Networks(Kadir Has Üniversitesi, 2018) Haj Hussıen, Zaid; Şadi, Yalçın; Şadi, YalçınThe fast growth of machine-to-machine (M2M) communications in cellular networks brings the challenge of satisfying diverse Quality-of-Service (QoS) requirements of massive number of machine type communications (MTC) devices with limited radio resources. in this study we first introduce the minimum bandwidth resource allocation problem for M2M communications in 5G and beyond cellular networks. NP-hardness of the problem is proven. Then we propose a fast and efficient polynomial-time algorithm exploiting the periodicity of the MTC traffic based on persistent resource allocation. We prove a mathematical performance result for this algorithm considering a special case of the problem. We elaborate on the expected flexible physical layer structure and study its possible effects on our algorithm. Simulations show that the proposed algorithm outperforms the previously proposed clustering-based radio resource algorithms significantly and performs very close to optimal.Book Part Citation - WoS: 8Citation - Scopus: 8Minimum Length Scheduling for Discrete Rate Based Full Duplex Wireless Powered Communication Networks(Springer, 2019) Iqbal, Muhammad Shahid; Şadi, Yalçın; Şadı, Yalçın; Ergen, Sinem ColeriIn this study, we consider a wireless powered communication network where multiple users with radio frequency energy harvesting capabilities communicate to a hybrid energy and information access point in full duplex mode. We characterize an optimization framework for minimum length scheduling to determine the optimal rate adaptation and transmission scheduling subject to energy causality and traffic demand constraints of the users considering discrete-rate transmission model. We first formulate the problem as a mixed integer nonlinear programming problem which is hard to solve for a global optimum in polynomial-time. Then, based on an analysis on the characteristics of the optimal solution, we derive optimality conditions for rate adaptation and scheduling using which we propose a fast polynomial-time complexity heuristic algorithm. We illustrate through numerical analysis that the proposed algorithm performs very close to optimal for various network scenarios.Conference Object Citation - WoS: 1Citation - Scopus: 14Flexible Radio Resource Allocation for Machine Type Communications in 5g Cellular Networks(Institute of Electrical and Electronics Engineers Inc., 2018) Hussien, Zaid Haj; Şadi, Yalçın; Şadi, YalçınThe fast growth of machine-to-machine (M2M) communications in cellular networks brings the challenge of satisfying diverse Quality-of-Service (QoS) requirements of massive number of machine type communications (MTC) devices with limited radio resources. In this study we first introduce the minimum bandwidth resource allocation problem for M2M communications in 5G and beyond cellular networks. NP-hardness of the problem is proven. Then we propose a fast and efficient polynomial-time algorithm exploiting the periodicity of the MTC traffic based on persistent resource allocation. We prove a mathematical performance result for this algorithm considering a special case of the problem. Simulations show that the proposed algorithm outperforms the previously proposed clustering based radio resource algorithm significantly and performs very close to optimal. © 2018 IEEE.Master Thesis Quality of Service Constrained Scheduling for Massive M2m Communications in Future Cellular Networks(Kadir Has Üniversitesi, 2018) Mohemine, Muhammad Abdul; Şadi, Yalçın; Şadi, YalçınRadio resource allocation for massive M2M communications is one of the key problems in next generation cellular networks. Satisfying strict and very diverse quality-of-service requirements increases the hardness of this problem. in this thesis flexible scheduling problem for massive M2M communications is solved considering the physical layer architecture of 5G cellular networks. First envisioned physical layer architectures and waveforms proposed for 5G are investigated and a physical layer architecture model that will allow flexible resource allocation is proposed. Then a flexible radio resource allocation algorithm is proposed based on this model. The performance of the algorithm is shown through extensive simulations.
