Resource Allocation for Multi-Cell Full-Duplex Wireless Powered Communication Networks

dc.authorscopusid 59157821100
dc.authorscopusid 36844802900
dc.authorscopusid 57219549243
dc.authorscopusid 9133370600
dc.contributor.author Şadi, Yalçın
dc.contributor.author Sadi, Yalcin
dc.contributor.author Kazmi, Syed Adil Abbas
dc.contributor.author Coleri, Sinem
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 2024
dc.department Kadir Has University en_US
dc.department-temp [Iqbal, Muhammad Shahid] Natl Univ Technol, Dept Elect Engn, Islamabad, Pakistan; [Sadi, Yalcin] Kadir Has Univ, Dept Elect & Elect Engn, Istanbul, Turkiye; [Kazmi, Syed Adil Abbas] Opticoms GmbH, Munich, Germany; [Coleri, Sinem] Koc Univ, Dept Elect & Elect Engn, Istanbul, Turkiye en_US
dc.description.abstract Wireless powered communication networks (WPCNs) are crucial in achieving perpetual lifetime for the machine-type communication (MTC) and Internet of things (IoT) in fifth-generation (5G) communication and beyond networks. Practical WPCNs cover a broad region and have a significant number of sensors, requiring multi-cell deployment. We investigate the minimum length scheduling problem for a multi-cell full-duplex WPCNs to find the optimal power and schedule by considering the simultaneous transmission, maximum transmit power and energy causality constraints for the users. The optimization problem to minimize the schedule length is combinatorial, thus, difficult to find the global optimum solution. To overcome this, we divide the problem into two subproblems, i.e., power control problem (PCP) and the scheduling problem. Then, we present the optimal polynomial time algorithm for the PCP based on the use of the bisection method and evaluation of the Perron-Frobenius criteria. Then, by using the PCP solution, we calculate the optimal transmission time for the users that are scheduled by the scheduling algorithm. For the scheduling problem, we define a penalty function that represents the gain of simultaneous transmission over the individual transmission of the users and we show that the minimization of schedule length is similar to the minimization of sum of penalties. Following the optimum analysis of the proposed penalty metric, we present a heuristic algorithm that tries to minimize the sum penalties of the simultaneously transmitting users over the schedule. Through extensive simulations, we show significant gains of scheduling for concurrent transmissions over individual transmissions. en_US
dc.description.sponsorship Scientific and Technological Research Council of Turkey; [2247-A]; [121C314] en_US
dc.description.sponsorship Sinem Coleri acknowledges the support of the Scientific and Technological Research Council of Turkey 2247-A National Leaders Research Grant #\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\#$$\end{document} 121C314. en_US
dc.description.woscitationindex Science Citation Index Expanded
dc.identifier.citationcount 0
dc.identifier.doi 10.1186/s13638-024-02412-1
dc.identifier.issn 1687-1472
dc.identifier.issn 1687-1499
dc.identifier.issue 1 en_US
dc.identifier.scopus 2-s2.0-85213691726
dc.identifier.scopusquality Q2
dc.identifier.uri https://doi.org/10.1186/s13638-024-02412-1
dc.identifier.uri https://hdl.handle.net/20.500.12469/7115
dc.identifier.volume 2024 en_US
dc.identifier.wos WOS:001386412300001
dc.identifier.wosquality Q3
dc.language.iso en en_US
dc.publisher Springer en_US
dc.relation.publicationcategory Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı en_US
dc.rights info:eu-repo/semantics/openAccess en_US
dc.scopus.citedbyCount 0
dc.subject Rf Energy Harvesting en_US
dc.subject Wireless Powered Communication Networks en_US
dc.subject Multi-Cell Network en_US
dc.subject Scheduling en_US
dc.subject Power Control en_US
dc.title Resource Allocation for Multi-Cell Full-Duplex Wireless Powered 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