By Topic

Power Allocation for Multiuser Cooperative Communication Networks Under Relay-Selection Degree Bounds

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Haoran Fang ; Department of Information Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong ; Xingqin Lin ; Tat M. Lok

This paper considers the joint power-allocation and relay-selection problems in multiuser cooperative communication networks, where one user can only seek a limited number of relays for cooperation. This relay-selection degree bound is of practical significance. The goal is to optimize the relay selection and power allocation in a distributed manner while respecting certain users' quality-of-service (QoS) requirements. This problem is challenging due to its combinatorial nature, even from a centralized perspective, let alone distributed algorithms (or protocols). For this joint optimization problem with inherent combinatorial nature, this paper resorts to a layering approach. Specifically, the optimal power allocation for a fixed but arbitrary relay-selection configuration is carried out in the physical layer while the relay selection is done in the media access control (MAC) layer. The general idea is to run distributed relay-selection schemes based on a time-reversible Markov chain over a distributed power-allocation algorithm in the physical layer. It turns out that these methods can approximately solve this joint power allocation and the relay-selection problem with a certain performance guarantee. More importantly, the resulting solution can be implemented in a distributed manner. Numerical results are also presented to demonstrate the performance of the algorithms.

Published in:

IEEE Transactions on Vehicular Technology  (Volume:61 ,  Issue: 7 )