Resource Allocation for Discrete Rate Multi-Cell Energy Constrained Communication Networks

dc.authorscopusid 59157821100
dc.authorscopusid 57212084418
dc.authorscopusid 36844802900
dc.authorscopusid 9133370600
dc.authorwosid Salik, Elif/AAD-5661-2021
dc.authorwosid Sadi, Yalcin/AAA-8692-2019
dc.contributor.author Şadi, Yalçın
dc.contributor.author Iqbal, M.S.
dc.contributor.author Salik, E.D.
dc.contributor.author Sadi, Y.
dc.contributor.author Coleri, S.
dc.contributor.other Electrical-Electronics Engineering
dc.date.accessioned 2025-01-15T21:37:53Z
dc.date.available 2025-01-15T21:37:53Z
dc.date.issued 2025
dc.department Kadir Has University en_US
dc.department-temp [Iqbal M.S.] Department of Electrical Engineering, National University of Technology, Islamabad, Pakistan; [Salik E.D.] Department of Electrical and Electronics Engineering, Koc University, Istanbul, Turkey; [Sadi Y.] Department of Electrical Engineering, Kadir Has University, Istanbul, Turkey; [Coleri S.] Department of Electrical and Electronics Engineering, Koc University, Istanbul, Turkey en_US
dc.description.abstract Radio frequency energy harvesting is a promising technique to extend the lifetime of wireless powered communication networks (WPCNs) due to its controllability. In this paper, we consider a novel discrete rate based multi-cell WPCN, where multiple hybrid access points (HAPs) transmit energy to the users and users harvest this energy for the information transmission by using a transmission rate selected from a finite set of discrete rate levels. We formulate an optimization problem to minimize the schedule length through optimal rate allocation and scheduling of the users while considering the traffic demand, energy causality and interference constraints. The problem is mixed integer non-linear programming problem. Initially, we investigate the problem for non-simultaneous and simultaneous transmission considering both predetermined and variable transmission rates. We propose optimal and heuristic algorithms for all these categories by using optimality analysis, Perron-Frobenius conditions and iterative improvement of the total schedule length. Then, for the general problem, we propose heuristic algorithm based on the maximization of the number of concurrently transmitting users within each time slot by considering the maximum allowed interference level of the users. Via extensive simulations, we demonstrate significant improvement in schedule length through rate selection and proper scheduling of concurrently transmitting users. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024. en_US
dc.description.sponsorship Ford Otomotiv Sanayi; 2247-A National Leaders Research Grant and Ford Otosan; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu, TÜBİTAK, (117E241, 2247-A, 121c314); Türkiye Bilimsel ve Teknolojik Araştırma Kurumu, TÜBİTAK en_US
dc.description.woscitationindex Science Citation Index Expanded
dc.identifier.citationcount 0
dc.identifier.doi 10.1007/s11276-024-03879-y
dc.identifier.endpage 2315 en_US
dc.identifier.issn 1022-0038
dc.identifier.issue 3 en_US
dc.identifier.scopus 2-s2.0-105001076499
dc.identifier.scopusquality Q1
dc.identifier.startpage 2295 en_US
dc.identifier.uri https://doi.org/10.1007/s11276-024-03879-y
dc.identifier.volume 31 en_US
dc.identifier.wos WOS:001381641600001
dc.identifier.wosquality Q2
dc.language.iso en en_US
dc.publisher Springer en_US
dc.relation.ispartof Wireless Networks en_US
dc.relation.publicationcategory Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı en_US
dc.rights info:eu-repo/semantics/closedAccess en_US
dc.scopus.citedbyCount 0
dc.subject Delay Minimization en_US
dc.subject Energy Harvesting en_US
dc.subject Multi-Cell Networks en_US
dc.subject Scheduling en_US
dc.subject Wireless Powered Communication Networks en_US
dc.title Resource Allocation for Discrete Rate Multi-Cell Energy Constrained Communication Networks en_US
dc.type Article en_US
dc.wos.citedbyCount 0
dspace.entity.type Publication
relation.isAuthorOfPublication 48050d4d-210f-4711-80cb-9a5efcde0b43
relation.isAuthorOfPublication.latestForDiscovery 48050d4d-210f-4711-80cb-9a5efcde0b43
relation.isOrgUnitOfPublication 12b0068e-33e6-48db-b92a-a213070c3a8d
relation.isOrgUnitOfPublication.latestForDiscovery 12b0068e-33e6-48db-b92a-a213070c3a8d

Files