University of Taipei:Item 987654321/15964
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 2052/17084 (12%)
Visitors : 3845234      Online Users : 886
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


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


    Title: Downlink Relay Selection Algorithm for Amplify-and-Forward Cooperative Communication Systems
    Authors: Yang, Cheng-Ying;楊政穎;Lin, Yi-Shan;Hwang, Min-Shiang
    Contributors: 臺北市立教育大學資訊科學系
    Keywords: relay selection;wireless networks;Amplify-and-Forward;cooperative communications
    Date: 2013-07
    Issue Date: 2017-07-31 13:34:35 (UTC+8)
    Abstract: In wireless networks, the cooperative relaying that provides a spatial diversity and improves the performance of system is a tendency in the future communications. There are three strategies in the cooperative communications. One is Amplify-and-Forward (AF) mode. Another is Decode-and-Forward (DF) mode and the other is Compress and Forward (CF) mode. Comparing with these three kind modes, AF mode is with the low complexity to implement. Consider the Raleigh fading environment where there are one information source, M relay stations and N destinations. The downlink signal includes two parts. One is from the source and the other comes from the relay stations. In order to achieve the maximum throughput in the system, it should obtain the maximum mutual information between the source and the destination. Hence, how to select an optimal relay station is important in the cooperative communications. This project proposes a relay selection algorithm with Amplify-and-Forward mode employed. The optimal selection scheme is based on the exhaustive search method. It is easy to be realized with a high computational complexity. In order to reduce the computational complexity, the relay station selection scheme with a maximum mutual information finding is proposed. With different relay station selection schemes, the performances are given for comparison.
    Relation: 2013 Seventh International Conference on Complex, Intelligent, and Software Intensive Systems,P.331-334
    Appears in Collections:[Department of Computer Science] Proceedings

    Files in This Item:

    There are no files associated with this item.



    All items in uTaipei are protected by copyright, with all rights reserved.


    如有問題歡迎與系統管理員聯繫
    02-23113040轉2132
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback