發(fā)布時間：2018-03-04 09:21

  本文選題：混合頻譜共享　切入點：連續(xù)時間馬爾科夫鏈　出處：《吉林大學》2017年碩士論文　論文類型：學位論文

【摘要】：隨著無線設備越來越多,有限且珍貴的頻譜資源顯得越發(fā)不足,傳統(tǒng)的頻譜固定分配模式弊端越來越明顯。已被分配的固定頻譜頻段中有相當大部分的時間都處于空閑階段,而很多繼續(xù)使用頻段傳輸信息的設備卻無法使用,這對無線設備以及未來信息社會的發(fā)展造成了巨大的影響和限制。傳統(tǒng)頻譜分配的模式已經(jīng)不能滿足現(xiàn)階段社會以及科技發(fā)展的需要,因此,我們需要用更好的方式來解決頻譜匱乏以及利用率不高的問題。現(xiàn)階段理論上解決頻譜匱乏以及頻譜利用率不高的方法有很多種。比如使用競價博弈以提升頻譜共享的效率;也可以充分利用TV空白頻譜共享,并使用排隊論解決共享問題,這是在使用認知無線電探測頻譜后再擇機接入信道;在認知雙向中繼網(wǎng)絡中實施頻譜共享,由一個模擬網(wǎng)絡編碼策略實現(xiàn)一個二相頻譜共享協(xié)議。上述三種方法各有千秋。我們采用了另一種簡單有效的方法——動態(tài)頻譜接入網(wǎng)絡下混合頻譜共享�，F(xiàn)在已有使用連續(xù)時間馬爾科夫鏈聯(lián)合overlay與underlay的混合共享方案,該方案降低了主要用戶和次要用戶動態(tài)建模的復雜性。我們從2次要用戶網(wǎng)絡向3次要用戶網(wǎng)絡推導,進而擴展到多次要用戶網(wǎng)絡時該方案的模型。在此我們推導出這些狀態(tài)的穩(wěn)定概率并且通過使用香農信道容量計算出上述頻譜共享方案的吞吐量。通過比對,得出3次要用戶的混合方案吞吐量高于2次要用戶的混合方案吞吐量。同時,我們優(yōu)化該方案,對次要用戶引入期望數(shù)據(jù)速率以分配給次要用戶一個訪問概率,將得以使該方案可依據(jù)情況對系統(tǒng)的公平性做出調節(jié)。同時也展示了數(shù)字結果以驗證調節(jié)系統(tǒng)平衡性方案的性能,結果顯示當期望數(shù)據(jù)速率越高,次要用戶訪問概率越低。
[Abstract]:With the increasing number of wireless devices, limited and precious spectrum resources are becoming more and more inadequate, and the drawbacks of the traditional fixed spectrum allocation mode are becoming more and more obvious. And many of the devices that continue to use the frequency band to transmit information are not available. This has had a great impact on wireless devices and the development of the information society in the future. The traditional mode of spectrum allocation can no longer meet the needs of the current society and the development of science and technology. We need to solve the problem of spectrum scarcity and low efficiency in a better way. There are many ways to solve the problem of spectrum scarcity and low spectrum efficiency in theory at present, such as using bidding game to improve the efficiency of spectrum sharing; We can also make full use of TV blank spectrum sharing, and use queuing theory to solve the problem of sharing. This is to select a machine to access the channel after using cognitive radio to detect spectrum, and to implement spectrum sharing in cognitive bidirectional relay network. A two-phase spectrum sharing protocol is implemented by an analog network coding strategy. The three methods mentioned above have their own advantages and disadvantages. We have adopted another simple and effective method-hybrid spectrum sharing in dynamic spectrum access networks. There is a hybrid sharing scheme using continuous time Markov chain and overlay and underlay. This scheme reduces the complexity of dynamic modeling for primary and secondary users. In this paper, we derive the stability probability of these states and calculate the throughput of the spectrum sharing scheme by using Shannon channel capacity. The hybrid throughput of 3 secondary users is higher than that of 2 secondary users. At the same time, we optimize the scheme by introducing the expected data rate to the secondary users in order to assign a access probability to the secondary users. It will enable the scheme to adjust the fairness of the system according to the situation. At the same time, the digital results are shown to verify the performance of the balancing scheme. The result shows that the lower the access probability of the secondary user is, the higher the expected data rate is.
【學位授予單位】：吉林大學
【學位級別】：碩士
【學位授予年份】：2017
【分類號】：TN925

【相似文獻】

相關期刊論文 前10條

1 胡林;唐倫;陳前斌;李實秋;;認知無線網(wǎng)絡中基于博弈的頻譜共享[J];計算機應用研究;2009年12期

2 張晶;朱洪波;;混合式頻譜共享系統(tǒng)功率分配研究[J];電子與信息學報;2010年11期

3 王磊;鄭寶玉;崔景伍;岳文靜;;認知無線網(wǎng)絡中一種新的頻譜共享方法[J];信號處理;2011年07期

4 湯海冰;胡志剛;;認知無線網(wǎng)絡空閑頻譜共享的競爭與合作定價[J];系統(tǒng)工程與電子技術;2013年01期

5 周惟風;朱琦;;基于拍賣理論和補償激勵的頻譜共享新算法[J];通信學報;2011年10期

6 羅麗平;;改進的協(xié)作頻譜共享方案[J];計算機工程與應用;2011年30期

7 劉悅;翁麗萍;;授權的頻譜共享技術[J];電信網(wǎng)技術;2013年09期

8 李婷婷;陳志奎;劉e，

本文編號：1565070