Greedy Algorithm Applied Relay Selection for Cooperative Communication Systems in Amplify-and-Forward Mode

uTaipei > College of Science > Department of Computer Science > Periodical Articles > Item 987654321/15982

Please use this identifier to cite or link to this item: http://utaipeir.lib.utaipei.edu.tw/dspace/handle/987654321/15982

Title:	Greedy Algorithm Applied Relay Selection for Cooperative Communication Systems in Amplify-and-Forward Mode
Authors:	Yang, Cheng-Ying;楊政穎;Lin, Yi-Shan;Wen, Jyh-Horng
Contributors:	臺北市立大學資訊科學系
Keywords:	Amplify-and-forward mode;cooperative communication;exhaustive search;greedy algorithm;relay selection
Date:	2014-03
Issue Date:	2017-07-31 13:35:06 (UTC+8)
Abstract:	Using a relaying system to provide spatial diversity and improve the system performance is a tendency in the wireless cooperative communications. Amplify-and-forward(AF) mode with a low complexity is easy to be implemented. Under the consideration of cooperative communication systems, the scenario includes one information source, M relay stations and N destinations. This work proposes a relay selection algorithm in the Raleigh fading channel. Based on the exhaustive search method, easily to realize, the optimal selection scheme can be found with a highly complicated calculation. In order to reduce the computational complexity, an approximate optimal solution with a greedy algorithm applied for the relay station selection is proposed. With different situations of the communication systems, the performance evaluation obtained by both the proposed algorithm and the exhaustive search algorithm are given for comparison. It shows the proposed algorithm could provide a solution approach to the optimal one.
Relation:	Journal of Electronic Science and Technology
Appears in Collections:	[Department of Computer Science] Periodical Articles

Files in This Item:

There are no files associated with this item.

Loading...