Cart (Loading....) | Create Account
Close category search window
 

On Relay Assignment in Network-Coded Cooperative Systems

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
$31 $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)
Xuehua Zhang ; Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, QC, Canada ; Ghrayeb, A. ; Hasna, M.

We consider in this paper relay assignment for cooperative systems with multiple two-way relay channels. The nodes corresponding to one two-way relay channel (henceforth referred to as pair) communicate with each other through a relay. The relays use network coding to simultaneously transmit the signals corresponding to the pairs they are assigned to. We propose two relay assignment schemes. One scheme considers all possible relay assignment permutations and selects the one that yields the best performance, and the other one considers only a subset of these permutations and selects the best one. The advantage of the latter is that it results in a significant reduction in computational complexity, in addition to making the analysis more tractable. We analyze the performance of these schemes over asymmetric independent Rayleigh fading channels. We also consider semi-symmetric and symmetric channels as special cases. We derive closed-form expressions for the end-to-end bit error rate performance for all scenarios and show that the full diversity order is achieved, which is the number of available relays. We present several examples to verify the theoretical results.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:10 ,  Issue: 3 )

Date of Publication:

March 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.