By Topic

Relaying Node Selection Algorithm Based on Channel Capacity for Cooperative System

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)
Weihao Xie ; Sch. of Commun. & Inf. Eng., Shanghai Univ., Shanghai ; Huimin Chen ; Zhuo Wu

Cooperative communication is a promising technique that uses many relaying nodes to combat channel fading. To achieve better communication and lower computational cost, some relays in good condition should be selected from all available relays. However, the original algorithm to select m' relays from m relays will need to compute C( m, m' )times, which has high complexity. In this paper, two lower complexity relay selection algorithms are proposed based on maximization of channel capacity for two-hop large scale non-regenerative relay system under the constraint of energy consumption. The simulation results show that the proposed two algorithms not only have almost the same channel capacity but have the lower computational complexity to the original algorithm when the selected relay nodes are same. These two algorithms also perform better than the way of random selection and direct transmission in channel capacity.

Published in:

2008 4th International Conference on Wireless Communications, Networking and Mobile Computing

Date of Conference:

12-14 Oct. 2008