Publication:
Scheduling and relay selection for full-duplex wireless powered cooperative communication networks

dc.contributor.departmentDepartment of Electrical and Electronics Engineering
dc.contributor.departmentN/A
dc.contributor.departmentN/A
dc.contributor.kuauthorErgen, Sinem Çöleri
dc.contributor.kuauthorKazmi, Syed Adil Abbas
dc.contributor.kuauthorIqbal, Muhammad Shahid
dc.contributor.kuprofileFaculty Member
dc.contributor.kuprofilePhD Student
dc.contributor.kuprofilePhD Student
dc.contributor.otherDepartment of Electrical and Electronics Engineering
dc.contributor.schoolcollegeinstituteCollege of Engineering
dc.contributor.schoolcollegeinstituteGraduate School of Sciences and Engineering
dc.contributor.schoolcollegeinstituteGraduate School of Sciences and Engineering
dc.contributor.yokid7211
dc.contributor.yokidN/A
dc.contributor.yokidN/A
dc.date.accessioned2024-11-10T00:08:28Z
dc.date.issued2020
dc.description.abstractIn this manuscript, we consider a full-duplex wireless powered cooperative communication system where the users communicate with a hybrid access point through relays. We formulate an optimization problem with the objective to minimize the total transmission time through user scheduling and relay selection while considering the traffic demand, energy causality and initial battery levels of the users. The formulated optimization problem is a mixed integer non-linear programming problem, hence difficult to solve for the global optimal solution. As a solution strategy, we decompose the problem into sub problems: time allocation, scheduling and relay selection. In the time allocation problem; the schedule and relays are assumed to be pre-known, we derive the optimal solution by using the optimality analysis. For the scheduling problem; we assume that users know their relays, we determine the optimal schedule. For the relay selection problem; users transmit their information in a pre-determined order, we determine the optimal relays for each user. For the overall scheduling and relay selection problem, we propose a heuristic algorithm which iteratively determines the scheduling and relay selection in polynomial time by using the optimal solutions of the individual relay selection and scheduling problems. Through simulations, we demonstrate that the scheduling length can be significantly reduced through proper scheduling and relay selection. The proposed algorithm performs very close to the optimal solution for different maximum user transmit power, network densities, initial battery levels and hybrid access point power levels.
dc.description.indexedbyScopus
dc.description.openaccessYES
dc.description.publisherscopeInternational
dc.identifier.doi10.1109/ICCC51575.2020.9345137
dc.identifier.isbn9781-7281-8635-1
dc.identifier.linkhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85101703215&doi=10.1109%2fICCC51575.2020.9345137&partnerID=40&md5=a89d6c52badd9b1b099637c20a2911d4
dc.identifier.scopus2-s2.0-85101703215
dc.identifier.urihttps://dx.doi.org/10.1109/ICCC51575.2020.9345137
dc.identifier.urihttps://hdl.handle.net/20.500.14288/16958
dc.keywordsRelay selection
dc.keywordsScheduling
dc.keywordsTotal time minimization
dc.keywordsWireless powered cooperative communication network Electric batteries
dc.keywordsHeuristic algorithms
dc.keywordsInteger programming
dc.keywordsIterative methods
dc.keywordsNonlinear programming
dc.keywordsOptimal systems
dc.keywordsPolynomial approximation
dc.keywordsScheduling
dc.keywordsGlobal optimal solutions
dc.keywordsMixed integer non-linear programming problems
dc.keywordsOptimal solutions
dc.keywordsOptimality analysis
dc.keywordsOptimization problems
dc.keywordsScheduling problem
dc.keywordsSolution strategy
dc.keywordsTotal transmission
dc.keywordsCooperative communication
dc.languageEnglish
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.source2020 IEEE 6th International Conference on Computer and Communications, ICCC 2020
dc.subjectTelecommunications
dc.titleScheduling and relay selection for full-duplex wireless powered cooperative communication networks
dc.typeConference proceeding
dspace.entity.typePublication
local.contributor.authorid0000-0002-7502-3122
local.contributor.authorid0000-0002-7518-5551
local.contributor.authorid0000-0003-1826-8737
local.contributor.kuauthorErgen, Sinem Çöleri
local.contributor.kuauthorKazmi, Syed Adil Abbas
local.contributor.kuauthorIqbal, Muhammad Shahid
relation.isOrgUnitOfPublication21598063-a7c5-420d-91ba-0cc9b2db0ea0
relation.isOrgUnitOfPublication.latestForDiscovery21598063-a7c5-420d-91ba-0cc9b2db0ea0

Files