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

dc.authorscopusid59157821100
dc.authorscopusid57212084418
dc.authorscopusid36844802900
dc.authorscopusid9133370600
dc.authorwosidSalik, Elif/AAD-5661-2021
dc.authorwosidSadi, Yalcin/AAA-8692-2019
dc.contributor.authorIqbal, Muhammad Shahid
dc.contributor.authorSalik, Elif Dilek
dc.contributor.authorSadi, Yalcin
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; [Salik, Elif Dilek; Coleri, Sinem] Koc Univ, Dept Elect & Elect Engn, Istanbul, Turkiye; [Sadi, Yalcin] Kadir Has Univ, Dept Elect Engn, Istanbul, Turkiyeen_US
dc.description.abstractRadio 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.en_US
dc.description.sponsorshipTrkiye Bilimsel ve Teknolojik Arascedil;timath;rma Kurumu [117E241, 2247-A, 121c314\]; Scientific and Technological Research Council of Turkeyen_US
dc.description.sponsorshipSinem Coleri acknowledges the support of the Scientific and Technological Research Council of Turkey under Grant 117E241 and 2247-A National Leaders Research Grant #121c314\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\#121c314$$\end{document} and Ford Otosan. A preliminary version of the paper considering only part of the scheduling and rate control has appeared in [1].en_US
dc.description.woscitationindexScience Citation Index Expanded
dc.identifier.citation0
dc.identifier.doi10.1007/s11276-024-03879-y
dc.identifier.issn1022-0038
dc.identifier.issn1572-8196
dc.identifier.scopus2-s2.0-85212817439
dc.identifier.scopusqualityQ1
dc.identifier.urihttps://doi.org/10.1007/s11276-024-03879-y
dc.identifier.urihttps://hdl.handle.net/20.500.12469/7113
dc.identifier.wosWOS:001381641600001
dc.identifier.wosqualityQ2
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/closedAccessen_US
dc.subjectEnergy Harvestingen_US
dc.subjectMulti-Cell Networksen_US
dc.subjectWireless Powered Communication Networksen_US
dc.subjectDelay Minimizationen_US
dc.subjectSchedulingen_US
dc.titleResource Allocation for Discrete Rate Multi-Cell Energy Constrained Communication Networksen_US
dc.typeArticleen_US
dspace.entity.typePublication
relation.isAuthorOfPublication48050d4d-210f-4711-80cb-9a5efcde0b43
relation.isAuthorOfPublication.latestForDiscovery48050d4d-210f-4711-80cb-9a5efcde0b43

Files