English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54371/62179 (87%)
Visitors : 8704648      Online Users : 129
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU 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
    National Tsing Hua University Institutional Repository > 電機資訊學院 > 資訊工程學系 > 博碩士論文  >  在異質蜂巢式網路的公平式頻段分配賽局


    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/86672


    Title: 在異質蜂巢式網路的公平式頻段分配賽局
    Authors: 王思平
    Wang, Szuping
    Description: GH02101062633
    碩士
    資訊工程學系
    Date: 2014
    Keywords: 異質蜂巢式網路;小型基地台;頻段分配;賽局理論
    Heterogeneous Cellular Networks;Small Cell;Spectrum Assignment;Game Theory
    Abstract: 隨著智慧型手機普及,穿戴式裝置也將掀起新一股風潮,而必須透過蜂巢式網路(或稱行動通訊網路,Cellular Networks)傳輸資料的需求也就隨之成指數型增長。而小型基地台(Small Cells)的誕生,被視為是用以紓解此一大量需求的一帖良藥。然而,關於小型基地台在頻段上的分配要如何進行,近年來的研究論文主要在於追求最大的傳輸容量(capacity)為主,忽略了蜂巢式網路中很重要的公平機制問題。因此,本論文提出基於賽局理論所發展出的分散式演算法,稱為公平式頻段分配賽局(Fair Spectrum Assignment Game, FSAG),以最大化最小使用者傳輸速率(User Data Rate),來解決此一問題。分散式演算法的做法也符合小型基地台在蜂巢式網路中必須有自主能力(Self-Organizing)的需求,並利用賽局理論以期降低不必要的資訊交換。最後的實驗結果顯示,在少數幾回合的賽局結果,便能呈現穩定狀態,而且執行公平式頻段分配賽局後所得到的最小使用者之傳輸速率與集中式演算法所算出的結果相去不遠。
    Network Capacity demand in cellular networks is explosively growing. The large Macrocells in combination with Small cells, which are named Heterogeneous Cellular Networks (HetNets), are introduced to increase network capacity. However, how to fairly assign spectrum to Small cells is neglected in HetNets. A heuristic fair spectrum assignment game (FSAG) is proposed to solve this problem by maximizing
    the minimum user data rate. FSAG is a distributed and game theoretical algorithm to t the self-organizing capability of HetNets. We conduct simulations for evaluating the stable state of distributed FSAG can be achieved in few rounds even in high Small cell density scenario. Moreover, simulation results present the minimum user data rate is close to the optimal solution by centralized calculating and the minimal user data rate is never zero, which means all users never starvation, while the average user data rate among all users in the network is not sacrificed.
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/86672
    Source: http://thesis.nthu.edu.tw/cgi-bin/gs/hugsweb.cgi?o=dnthucdr&i=sGH02101062633.id
    Appears in Collections:[資訊工程學系] 博碩士論文

    Files in This Item:

    File SizeFormat
    GH02101062633.pdf167KbAdobe PDF277View/Open


    在NTHUR中所有的資料項目都受到原著作權保護,僅提供學術研究及教育使用,敬請尊重著作權人之權益。若須利用於商業或營利,請先取得著作權人授權。
    若發現本網站收錄之內容有侵害著作權人權益之情事,請權利人通知本網站管理者(smluo@lib.nthu.edu.tw),管理者將立即採取移除該內容等補救措施。

    SFX Query

    與系統管理員聯絡

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