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

dc.authorscopusid59157821100
dc.authorscopusid36844802900
dc.authorscopusid57219549243
dc.authorscopusid9133370600
dc.contributor.authorIqbal, Muhammad Shahid
dc.contributor.authorSadi, Yalcin
dc.contributor.authorKazmi, Syed Adil Abbas
dc.contributor.authorColeri, Sinem
dc.date.accessioned2025-01-15T21:37:53Z
dc.date.available2025-01-15T21:37:53Z
dc.date.issued2024
dc.departmentKadir Has Universityen_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, Turkiyeen_US
dc.description.abstractWireless 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.sponsorshipScientific and Technological Research Council of Turkey; [2247-A]; [121C314]en_US
dc.description.sponsorshipSinem 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.woscitationindexScience Citation Index Expanded
dc.identifier.citation0
dc.identifier.doi10.1186/s13638-024-02412-1
dc.identifier.issn1687-1472
dc.identifier.issn1687-1499
dc.identifier.issue1en_US
dc.identifier.scopus2-s2.0-85213691726
dc.identifier.scopusqualityQ2
dc.identifier.urihttps://doi.org/10.1186/s13638-024-02412-1
dc.identifier.urihttps://hdl.handle.net/20.500.12469/7115
dc.identifier.volume2024en_US
dc.identifier.wosWOS:001386412300001
dc.identifier.wosqualityQ3
dc.institutionauthorŞadi, Yalçın
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subjectRf Energy Harvestingen_US
dc.subjectWireless Powered Communication Networksen_US
dc.subjectMulti-Cell Networken_US
dc.subjectSchedulingen_US
dc.subjectPower Controlen_US
dc.titleResource Allocation for Multi-Cell Full-Duplex Wireless Powered Communication Networksen_US
dc.typeArticleen_US
dspace.entity.typePublication
relation.isAuthorOfPublication48050d4d-210f-4711-80cb-9a5efcde0b43
relation.isAuthorOfPublication.latestForDiscovery48050d4d-210f-4711-80cb-9a5efcde0b43

Files