Tunghai University Institutional Repository:Item 310901/993
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 21921/27947 (78%)
造访人次 : 4204415      在线人数 : 327
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://140.128.103.80:8080/handle/310901/993


    题名: 具多個訊源-目地對之協力式無線網路中繼站選擇策略
    其它题名: Relay Node Selection Strategies for Cooperative Wireless Networks with Multiple Source-Destination Pairs
    作者: 侯享姍
    Hou, Hsiang-Shan
    贡献者: 溫志宏
    Wen, Jyh-Horng
    東海大學電機工程學系
    关键词: 固定式編碼後傳送;選擇性編碼後傳送;多輸入多輸出;通道狀態資訊;合作式通訊放大後傳送
    Cooperative communication;multiple input multiple output (MIMO);channel state information (CSI);amplify and forward (AF);selective decode and forward (SDF);fixed decode and forward (FDF)
    日期: 2010
    上传时间: 2011-01-20T02:56:32Z (UTC)
    摘要: 合作式通訊利用了空間多樣性的概念仿效了多輸入多輸出的通訊系統。利用中繼站的協助,使得傳輸資訊更為可靠、傳輸率更高。相較於多輸入多輸出的系統中,更能減少硬體設計上的複雜度及降低所需花費成本。因此,如何在網路中選擇中繼點成為了重要的一個議題。重要的一個議題。本論文中,我們考慮三種不同的中繼站傳送機制並提出在中繼站選擇的最佳化問題。在此分別使用固定式編碼後傳送、選擇性編碼後傳送及放大後傳送等機制。而在中繼站上會依據不同的來源-目的對,並利用已知的狀態通道狀態的資訊得到最大的吞吐量。為了求得最佳解,我們使用了暴力法以求得最佳的結果。雖然此方法能非常簡單地完成,但是電腦的計算複雜度卻會隨著網路中的中繼站數目增加而上升。因此,我們提出了具較低複雜度得次佳化中繼站選擇傳送方法。並且分析我們所提出的中繼站選擇策略。依據模擬的結果,我們得知所提出具較低複雜度的方法與暴力法相較之下有些許的效能改善。
    Cooperative communication is a promising technique for the current wireless network systems. In the cooperative wireless network system, the relays can form an antenna array to provide the spatially diversity gain by forwarding the source’s message to the destination similar to the multiple input multiple output (MIMO) technique. Although MIMO can also provide spatially diversity gain, the implementation cost and complexity of the device increase with the number of antennas. Hence, in this thesis, we study the relay selection strategy for the multiple source-destination pairs cooperative wireless networks to provide a reliable high data rate transmission.In the thesis, we consider three different forwarding schemes at relays to discuss the optimization problems with relay selection. The throughput behavior under fixed decode-and-forward (FDF), selective decode-and-forward (SDF), and amplify-and-forward (AF) scheme respectively, is studied. The issue about relay allocation to different source-destination pairs can be optimized based on the channel state information (CSI) under throughput maximization criterion. To obtain the solution of the proposed optimization problems, exhaustive search algorithm can be applied. Although the algorithm is straightforward, the computational complexity increases with the number of relays in the network. Hence, we further propose a low complexity suboptimal relay selection strategy for each forwarding scheme. Based on the simulation results, our proposed suboptimal strategies are proven to be lower complexity than the exhaustive search algorithms with slight performance loss.
    显示于类别:[電機工程學系所] 碩士論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML607检视/开启


    在THUIR中所有的数据项都受到原著作权保护.


    本網站之東海大學機構典藏數位內容,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈