Tunghai University Institutional Repository:Item 310901/1505
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 21921/27947 (78%)
造访人次 : 4247159      在线人数 : 464
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/1505


    题名: 應用於正交分頻多工系統群播服務之資源分配研究
    其它题名: Research on Resource Allocation for Multicast Services in OFDM ystems
    作者: 蘇介清
    Su, Chieh-Ching
    贡献者: 溫志宏
    Wen, Jyh-Horng
    東海大學電機工程學系
    关键词: 通達率;位元載入;資源分配;群播;正交分頻多工;低複雜度;公平性
    low-complexity;throughput;bit loading;resource allocation;multicast;OFDM;fairness
    日期: 2009
    上传时间: 2011-02-25T03:16:45Z (UTC)
    摘要: 最近針對群播服務滿足多媒體負載的需求在資源分配上已被廣泛地研究。動態資源分配是能在保證使用者服務品質之下大幅度改善下一代無線系統效能的一個關鍵技術,然而,目前大多數的資源分配演算法被限制在單播負載上。在本篇論文中,我們考慮在一個群播正交分頻多工系統中,分別對不同的最佳化準則,提升系統通達率。首先,我們考慮在一個總功率的限制下,最大化系統的通達率。其次,則考慮另一個最佳化準則,為在群組間的比例公平性與總功率的限制下,最大化系統的通達率。?了要解決上述最佳化問題,我們可以利用整數規劃獲得最佳解。然而,使用整數規劃求解,往往具有高的計算複雜度。因此,我們提出一個具有低計算複雜度的次佳化演算法。首先,該演算法透過所有群組中的用戶的通道品質資訊,?群組們分配子通道。緊接著,則對每一個子通道分配功率提升系統的通達率。數據分析展現針對通達率最大化和比例式公平性所提出的資源分配機制將大幅度勝過傳統群播傳輸機制,最佳化方法和啟發式方法的解之間差距小於5%。
    Recently, there has extensive research on resource allocation schemes for multicast services that would satisfy the requirements of multimedia traffic. Dynamic resource allocation is a key techniques that can significantly improve the performance of the next generation wireless systems under guaranteed QoS to user. Most of the current resource allocation algorithms are, however, limited to unicast traffics. In this thesis, we considered separately the different optimal scheme to promote the system throughput in the multicast OFDM systems. First, we considered the scheme of maximum throughput (MT) under the constraint of total power. Next, that considered another optimal scheme for MT under the constraint of total power and proportional fairness (PF). To solve the optimal problem, we can utilize the integer programming (IP) to obtain the optimal solution. However, which used the IP to solve, often had high computational complexity. Therefore, we proposed the suboptimal algorithm that has the low-complexity. First, the algorithm that assigned the sub-channels to the groups by all groups of the users of the channel information. Then, each sub-channel assigned power to promote the system throughput. Numerical results show that the proposed resource allocation scheme for both MT and PF significantly outperform the conventional multicast transmission scheme. The difference optimum and heuristic solutions is less than 5%.
    显示于类别:[電機工程學系所] 碩士論文

    文件中的档案:

    档案 大小格式浏览次数
    097THU00442004-004.PDF1194KbAdobe PDF781检视/开启


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


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

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