Abstract
In this paper, we investigate an auction based energy efficient link selection scheme in buffer-aided relay networks. The problem of link selection and power allocation is formulated as a Constrained Markov Decision Process (CMDP) problem, which is decomposed into two local CMDP problems at the relay node and the source node through auction method. The optimal link selection solution is determined by minimizing the power expenditure with respect to the instantaneous channel state information (CSI) and queue state information (QSI) in each time-slot. Stochastic approximation and the value function approximation approaches are employed to solve the local CMDP problems. Simulations demonstrate the theoretical solutions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
