Sürdürülebilir Yeşil Kampüs Koleksiyonu / Sustainable Green Campus Collection
Permanent URI for this collectionhttps://hdl.handle.net/11147/7755
Browse
2 results
Search Results
Article Citation - WoS: 3Citation - Scopus: 3Channel and Queue Aware Joint Relay Selection and Resource Allocation for Miso-Ofdma Based User-Relay Assisted Cellular Networks(Springer Verlag, 2018) Baştürk, İlhan; Özbek, BernaUser-relay assisted orthogonal frequency division multiple access (OFDMA) networks are cost-effective solutions to meet the growing capacity and coverage demands of the next generation cellular networks. These networks can be used with multiple antennas technology in order to obtain a diversity gain to combat signal fading and to obtain more capacity gain without increasing the bandwidth or transmit power. Efficient relay selection and resource allocation are crucial in such a multi-user, multi-relay and multi-antenna environment to fully exploit the benefits of the combination of user-relaying and multiple antennas technology. Thus, we propose a channel and queue aware joint relay selection and resource allocation algorithm for multiple-input single-output (MISO)-OFDMA based user-relay assisted downlink cellular networks. Since, the proposed algorithm is not only channel but also queue-aware, the system resources are allocated efficiently among the users. The proposed algorithm for the MISO-OFDMA based user-relay assisted scheme is compared to existing MISO-OFDMA based non-relaying and fixed relay assisted schemes and it is also compared with the existing single-input single-output (SISO)-OFDMA based user-relay assisted scheme. Simulation results revealed that the proposed scheme outperforms the existing schemes in terms of cell-edge users’ total data rate, average backlog and average delay.Conference Object Citation - Scopus: 2Resource Allocation Algorithm for a Relational Join Operator in Grid Systems(Association for Computing Machinery (ACM), 2012) Çokuslu, Deniz; Hameurlain, Abdelkader; Erciyeş, Kayhan; Morvan, FranckGrid systems become very popular during the last decade because of their rapidly increasing computational capabilities. On the other hand, the advances on different domains cause enormous increase in the scale of the manipulated data. This issue augments the importance of distributed query processing and causes researchers to port their underlying environment onto the grid systems. However the dynamicity, heterogeneity and large scale characteristics of grid systems pose new problems for the distributed query processing domain. Resource allocation for query processing in grid systems is one of these problems, which attracts many researchers' attention. In this paper, we propose a new resource allocation algorithm for one relational join operator in a query considering characteristics of the grid systems. We provide theoretical analyses of the proposed algorithm and we consolidate analyses with the simulations. Copyright © 2012 ACM.