Department of Electrical and Electronics Engineering2024-11-0920209783-0306-1745-50302-974310.1007/978-3-030-61746-2_192-s2.0-85093819511N/Ahttps://hdl.handle.net/20.500.14288/13133We consider a relay based full-duplex wireless powered cooperative communication network which consists of a hybrid access point (HAP), N users and K decode-and-forward relays with energy harvesting capability. We propose an optimization framework for relay selection with the objective of minimizing the total transmission time subject to energy causality and user traffic demand constraints. The formulated optimization problem is a mixed integer non-linear programming problem, which is difficult to solve for the global optimal solution in polynomial-time. As a solution strategy, we decompose the proposed optimization problem into two sub-problems: time allocation problem and relay selection problem. We derive the optimal solution of the time allocation problem by using convex optimization techniques. For the relay selection problem, based on the optimality analysis, we propose a polynomial-time heuristic algorithm, which minimizes the total transmission time by allocating the best relay to each user. Through simulations, we illustrate that the proposed algorithm outperforms the conventional predetermined relay allocation scheme and performs very close to the optimal solution for different network densities, HAP power values, and initial battery levels.Decode-and-forwardSplitting factorEnergy harvestingConference proceedinghttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85093819511&doi=10.1007%2f978-3-030-61746-2_19&partnerID=40&md5=5aeea5b3496d286cb6eb17c0e096ce12N/A4510