發(fā)布時間：2018-05-24 10:49

  本文選題：認(rèn)知無線電 + 頻譜分配　； 參考：《哈爾濱工業(yè)大學(xué)》2016年博士論文

【摘要】：隨著無線通信技術(shù)的快速發(fā)展和無線用戶數(shù)量的逐漸增長,用戶對頻譜的需要量越來越大,頻譜資源緊張成為目前無線電管理中一個嚴(yán)峻的問題。目前,認(rèn)知無線電靜態(tài)頻譜分配技術(shù)缺乏靈活性,導(dǎo)致頻譜利用率低、引發(fā)頻譜浪費。動態(tài)頻譜分配技術(shù)是在保證授權(quán)用戶正常通信的前提下,分析周圍無線環(huán)境,對空閑頻譜進(jìn)行二次利用,從而更加有效地使用有限的頻譜資源,緩解了無線通信需求與頻譜資源之間的矛盾。因此動態(tài)頻譜分配技術(shù)在無線通信領(lǐng)域有非常廣闊的應(yīng)用前景,已成為認(rèn)知無線電系統(tǒng)中研究熱點。本文主要以圖論和博弈相關(guān)理論為基礎(chǔ),利用最優(yōu)化方法研究認(rèn)知無線電中頻譜分配問題,具體研究內(nèi)容如下:本文分別對認(rèn)知無線電中圖論和博弈論的頻譜分配算法進(jìn)行了詳細(xì)的分析和研究,充分考慮了系統(tǒng)公平、瓶頸認(rèn)知用戶效用和用戶間的決策干擾對聯(lián)合頻譜分配性能的影響。本文主要圍繞聯(lián)合分配算法步驟、分配性能的分析和仿真來展開。此外,為了降低認(rèn)知用戶彼此的競爭和減少對授權(quán)用戶的影響,本文還用可靠性理論描述一個信道是否能夠被認(rèn)知用戶所使用以及被連續(xù)使用一段時間的概率,進(jìn)而提出空域、時域和頻域三維聯(lián)合頻譜分配算法,從時域、頻域和空域進(jìn)行分析。本文在圖論和博弈論相關(guān)理論的基礎(chǔ)上,提出了四種頻譜分配算法,并分析了算法的有效性。本文提出的具體四個創(chuàng)新點分別是:在圖論的基礎(chǔ)上,針對目前僅適用協(xié)作式最大化最小帶寬標(biāo)準(zhǔn)的并行算法,存在的認(rèn)知用戶公平性低,瓶頸用戶效用不高的問題,本文提出了縱向聯(lián)合并行的頻譜分配算法。計算子圖標(biāo)號時采用協(xié)作式最大化最小帶寬和協(xié)作式最大化比例公平兩種不同的標(biāo)準(zhǔn),分析了不同的比例因子對系統(tǒng)公平的影響。根據(jù)最佳的比例因子取值,部分信道運用協(xié)作式最大化最小帶寬標(biāo)準(zhǔn)分配,在分配這些信道的同時,再對剩余的信道運用協(xié)作式最大化比例公平標(biāo)準(zhǔn)進(jìn)行分配,并計算各個認(rèn)知用戶使用頻譜的標(biāo)號。仿真結(jié)果表明縱向聯(lián)合并行算法的系統(tǒng)公平比已有的并行算法有了明顯的改善,瓶頸認(rèn)知用戶信道容量也得到了較大程度的提高�？v向聯(lián)合并行算法兼顧了系統(tǒng)公平和瓶頸認(rèn)知用戶效用的同時,又有效控制了通信開銷。在博弈論的基礎(chǔ)上,本文提出了新的非合作博弈的頻譜分配算法,克服了用戶間決策的干擾影響。在實際的認(rèn)知無線電通信中,多用戶需要共享頻譜,認(rèn)知用戶之間不進(jìn)行相互協(xié)作。本文提出新的非合作博弈的頻譜分配算法,研究了多個認(rèn)知用戶彼此方案關(guān)系,最大化自身的吞吐量。仿真結(jié)果表明,新的非合作博弈的頻譜分配可以使認(rèn)知用戶和授權(quán)用戶共享信道,在滿足干擾功率約束條件下,認(rèn)知用戶之間進(jìn)行博弈從而實現(xiàn)合理的功率分配。新的非合作博弈的頻譜分配算法的穩(wěn)定認(rèn)知用戶速率大于傳統(tǒng)的非合作博弈算法和下墊式共享的算法,仿真驗證了本文提出算法的有效性。從實際應(yīng)用出發(fā),本文提出了基于圖論和博弈論的頻譜分配算法。其克服了圖論算法不符合實際頻譜效用的問題,也克服了博弈論算法從頻譜共享池中獲取頻譜的比較困難的問題。本文首先應(yīng)用圖論算法進(jìn)行快速的預(yù)分配頻譜,該算法同時為再次分配保證了公平性,然后用博弈論思想優(yōu)化初次分配的信道,完成認(rèn)知用戶之間的頻譜再次分配,基于圖論和博弈論的頻譜分配算法充分利用了圖論和博弈論的優(yōu)點。仿真結(jié)果表明基于博弈論和圖論的頻譜分配算法可以使頻譜資源被充分利用,在傳輸功率的約束下,每個認(rèn)知用戶優(yōu)化自身的效用(速率),合理的分配發(fā)送功率,基于圖論和博弈論的頻譜分配算法相比于單一博弈算法,在使用的信道上可以被分配更多的發(fā)送功率,同時效用也得到了提高,聯(lián)合算法的總效用大于單一博弈論算法的總效用,通過仿真驗證了基于圖論和博弈論的頻譜分配算法的有效性。此外,從空域、時域和頻域三個方面,本文提出了空域、時域和頻域三維聯(lián)合頻譜分配算法。采用可靠性理論描述一個信道是否能夠被認(rèn)知用戶所使用及被連續(xù)使用一段時間的概率,降低了認(rèn)知用戶彼此的競爭并減少對授權(quán)用戶的影響,從而保證認(rèn)知無線電系統(tǒng)正常通信。仿真結(jié)果表明,當(dāng)主用戶數(shù)固定時,隨著認(rèn)知用戶的增加,空域、時域和頻域三維聯(lián)合算法的傳輸數(shù)據(jù)量和系統(tǒng)的總吞吐量優(yōu)于貪婪算法和二維算法,當(dāng)認(rèn)知用戶數(shù)固定時,隨著主用戶的增加,系統(tǒng)可傳輸數(shù)據(jù)量和系統(tǒng)總吞吐量的趨勢隨著該算法空閑的主用戶數(shù)量的增多而提高,空域、時域和頻域三維聯(lián)合算法好于二維算法和貪婪算法。有助于減少認(rèn)知用戶對授權(quán)用戶的干擾,同時也降低認(rèn)知用戶彼此的競爭,且空域、時域和頻域三維聯(lián)合算法的系統(tǒng)總吞吐量明顯優(yōu)于另外兩種算法,仿真結(jié)果表明所提算法的有效性。
[Abstract]:With the rapid development of wireless communication technology and the increasing number of wireless users, the demand for the spectrum is becoming more and more large. The shortage of spectrum resources has become a serious problem in radio management. At present, the static spectrum allocation technology of cognitive radio is lack of flexibility, which leads to the low spectrum utilization and causes the waste of spectrum. On the premise of guaranteeing the normal communication of authorized users, the spectrum allocation technology analyzes the surrounding wireless environment and uses the free spectrum for two times, thus more effectively uses the limited spectrum resources and alleviates the contradiction between the demand of wireless communication and the spectrum resources. Therefore, the dynamic spectrum allocation technology has a very wide range in the field of wireless communication. The prospect of application has become a hot spot in cognitive radio system. Based on graph theory and game theory, this paper studies the problem of spectrum allocation in cognitive radio. The specific research contents are as follows: This paper analyzes the spectrum allocation algorithm of graph theory and game theory in cognitive radio in detail. In this paper, the effect of system fairness, bottleneck cognitive user utility and decision interference between users on the performance of the joint spectrum allocation is considered. This paper mainly focuses on the analysis and Simulation of the joint allocation algorithm steps and distribution performance. In addition, in order to reduce the competition between the cognitive users and reduce the impact on the authorized users, this paper also introduces the results. The reliability theory is used to describe the probability that a channel can be used by the cognitive users and is used for a period of time. Then the spatial, time-domain and frequency domain combined spectrum allocation algorithms are proposed, which are analyzed from the time domain, frequency domain and space domain. Based on the theory of graph theory and game theory, four kinds of spectrum allocation are proposed in this paper. The effectiveness of the algorithm is analyzed, and the four specific innovation points proposed in this paper are: on the basis of graph theory, in view of the parallel algorithm which only applies the minimum bandwidth standard of cooperative maximization, the existing problem of low cognitive user fairness and poor utility of bottleneck users, this paper proposes a longitudinal joint parallel spectrum allocation calculation. Method. When calculating the sub icon number, two different standards are adopted for the cooperative maximization minimum bandwidth and the cooperative maximization proportional fairness. The effect of the different proportion factors on the system fairness is analyzed. According to the optimal proportion factor, the partial channel is allocated by the cooperative maximum minimum band width standard, while the channels are allocated. Then the remaining channels are allocated by the cooperative maximization proportional fair standard, and the frequency spectrum of each cognitive user is calculated. The simulation results show that the system fairness of the longitudinal joint parallel algorithm has been obviously improved compared with the existing parallel algorithm, and the bottleneck cognition user channel capacity has also been greatly improved. On the basis of game theory, this paper proposes a new spectrum allocation algorithm for non cooperative game on the basis of game theory, and overcomes the interference effect of decision making between users. In actual cognitive radio communication, multi users need to share the spectrum and recognize the spectrum. In this paper, a new spectrum allocation algorithm for non cooperative game is proposed in this paper to study the relationship between multiple cognitive users and maximize their throughput. The simulation results show that the spectrum allocation of the new non cooperative game can enable the cognitive users and the authorized users to share the channel and satisfy the interference power constraints. Under the condition, the cognitive users play a game to achieve a reasonable power allocation. The stable cognitive user rate of the new non cooperative game spectrum allocation algorithm is greater than the traditional non cooperative game algorithm and the underlying sharing algorithm. The simulation proves the effectiveness of the proposed algorithm. The spectrum allocation algorithm of game theory and game theory overcomes the problem that the graph theory does not conform to the actual spectrum utility. It also overcomes the problem that the game theory algorithm is difficult to obtain the spectrum from the spectrum sharing pool. First, the graph theory algorithm is used to make the fast preallocation of the spectrum, and the algorithm guarantees the fairness for the redistribution at the same time, and then the algorithm is used to ensure the fairness of the algorithm. The game theory is used to optimize the channel for the initial distribution, and the spectrum allocation between cognitive users is completed. The spectrum allocation algorithm based on graph theory and game theory makes full use of the advantages of graph theory and game theory. The simulation results show that spectrum allocation algorithm based on game theory and graph theory can make the spectrum resources fully utilized and transmit power. Under the constraint, each cognitive user optimizes its own utility (rate) and distributes the transmission power reasonably. The spectrum allocation algorithm based on graph theory and game theory can be allocated more transmission power than single game algorithm on the channel used, and the utility is also improved. The total utility of the joint algorithm is larger than the single game theory. The effectiveness of the spectrum allocation algorithm based on graph theory and game theory is verified by simulation. In addition, from three aspects of space, time domain and frequency domain, this paper proposes a spatial, time domain and frequency domain three dimensional joint spectrum allocation algorithm. The reliability theory is used to describe whether a channel can be used by the cognitive users and is used continuously. The probability of a period of time reduces the competition between the cognitive users and reduces the impact on the authorized users, thus ensuring the normal communication of the cognitive radio system. The simulation results show that the volume of data and the total throughput of the system are better than that of the cognitive users when the number of users is fixed, with the increase of the cognitive users. The greedy algorithm and the two-dimensional algorithm, when the number of cognitive users is fixed, with the increase of the main user, the system can transmit the amount of data and the total system throughput with the increase of the number of idle main users of the algorithm. Space, time domain and frequency domain three dimensional joint algorithm is better than the two-dimensional algorithm and greedy algorithm. The interference of the users is authorized and the competition between the cognitive users is also reduced, and the total throughput of the spatial domain, the time domain and the frequency domain three dimensional joint algorithm is obviously superior to the other two algorithms. The simulation results show the effectiveness of the proposed algorithm.
【學(xué)位授予單位】：哈爾濱工業(yè)大學(xué)
【學(xué)位級別】：博士
【學(xué)位授予年份】：2016
【分類號】：TN925

【相似文獻(xiàn)】

相關(guān)期刊論文 前10條

1 張麗影;曾志文;陳志剛;鄺祝芳;;認(rèn)知無線網(wǎng)絡(luò)中基于約束算子的二進(jìn)制粒子群頻譜分配算法[J];小型微型計算機(jī)系統(tǒng);2013年06期

2 李岳洪;萬頻;王永華;鄧欽;楊健;;改進(jìn)的細(xì)菌覓食算法求解認(rèn)知無線網(wǎng)絡(luò)頻譜分配問題[J];計算機(jī)科學(xué);2013年08期

3 陳劍;吳建平;李賀武;;基于用戶分配和負(fù)載的頻譜分配算法[J];軟件學(xué)報;2013年07期

4 陳年生;;基于雙向拍賣的多目標(biāo)頻譜分配算法[J];上海電機(jī)學(xué)院學(xué)報;2013年04期

5 謝健驪;李翠然;趙佳穎;;基于均衡價格的認(rèn)知無線網(wǎng)絡(luò)頻譜分配算法[J];鐵道學(xué)報;2014年01期

6 李方偉;王程;朱江;;一種基于逢低買入的頻譜分配機(jī)制[J];計算機(jī)應(yīng)用研究;2014年02期

7 馮春燕;郭義武;薛鈺;郭彩麗;;授權(quán)鏈路保護(hù)的頻譜分配算法[J];電子科技大學(xué)學(xué)報;2008年06期

8 Serena chan;宋笑亭;;美國國防部共享頻譜接入(上)[J];中國無線電;2008年03期

9 王坤;董淑福;劉杰;;基于用戶需求和等待時間的改進(jìn)型頻譜分配算法[J];科學(xué)技術(shù)與工程;2012年22期

10 歌曉;;頻譜高速公路讓信息暢行無阻[J];上海信息化;2013年05期

相關(guān)會議論文 前6條

1 鄭曉明;何廷潤;;3G頻譜分配:市場化的經(jīng)濟(jì)法則[A];2002’中國通信學(xué)會無線及移動通信委員會學(xué)術(shù)年會論文集[C];2002年

2 朱麗姣;侯維剛;郭磊;;可伸縮光網(wǎng)絡(luò)中路由與頻譜分配算法[A];第十七屆全國青年通信學(xué)術(shù)年會論文集[C];2012年

3 趙濱;馬鍇;關(guān)新平;;區(qū)分信道的認(rèn)知無線電網(wǎng)絡(luò)頻譜分配算法研究[A];第二十九屆中國控制會議論文集[C];2010年

4 章堅武;趙琪;鄒婧媛;;改進(jìn)的認(rèn)知無線電圖著色頻譜分配算法[A];2009年中國高校通信類院系學(xué)術(shù)研討會論文集[C];2009年

5 沈嘉;王軍;李少謙;;認(rèn)知無線電網(wǎng)絡(luò)基于配對算法的頻譜分配策略[A];2008年中國西部青年通信學(xué)術(shù)會議論文集[C];2008年

6 宋琦軍;張濤;;頻譜管理領(lǐng)域面臨的挑戰(zhàn)及對策[A];第十五屆全國電磁兼容學(xué)術(shù)會議論文集[C];2005年

相關(guān)重要報紙文章 前10條

1 張虹;國際頻譜政策新走向[N];人民郵電;2006年

2 本報記者 盧子月;頻譜分配受關(guān)注[N];通信產(chǎn)業(yè)報;2012年

3 本報記者 盧子月;得頻譜得未來[N];通信產(chǎn)業(yè)報;2013年

4 宋穎;利用市場手段加速頻譜轉(zhuǎn)讓[N];人民郵電;2013年

5 ;頻譜資源共享面臨挑戰(zhàn)[N];中國電子報;2013年

6 本報記者 盧子月;管好頻率 管好臺站 管好秩序[N];通信產(chǎn)業(yè)報;2011年

7 李亮　記者 黃超 某集團(tuán)軍司令部通信處長 李占良;演習(xí)之前分“頻譜”[N];解放軍報;2009年

8 本報記者 盧子月;科學(xué)規(guī)劃TD—LTE頻譜[N];通信產(chǎn)業(yè)報;2012年

9 四川通信設(shè)計院副總工程師 程德杰;450M頻譜更有可為[N];通信產(chǎn)業(yè)報;2013年

10 金耀星;創(chuàng)新管理方式 解決頻譜供需矛盾[N];人民郵電;2013年

相關(guān)博士學(xué)位論文 前10條

1 周雄;基于博弈的Femtocell網(wǎng)絡(luò)頻譜資源管理[D];華南理工大學(xué);2015年

2 郁小松;靈活柵格光網(wǎng)絡(luò)中頻譜工程與調(diào)控技術(shù)研究[D];北京郵電大學(xué);2015年

3 殷聰;認(rèn)知無線電中頻譜聚合技術(shù)及其資源調(diào)度的公平性研究[D];哈爾濱工業(yè)大學(xué);2015年

4 張龍;認(rèn)知無線電網(wǎng)絡(luò)MAC層頻譜感知與頻譜接入問題研究[D];中國科學(xué)技術(shù)大學(xué);2015年

5 張雷;認(rèn)知無線網(wǎng)絡(luò)頻譜接入策略及性能分析[D];東南大學(xué);2016年

6 謝玉鵬;認(rèn)知無線電系統(tǒng)中聯(lián)合頻譜分配算法研究[D];哈爾濱工業(yè)大學(xué);2016年

7 董蓓;基于進(jìn)化學(xué)習(xí)的無線通信網(wǎng)絡(luò)資源分配問題研究[D];西安電子科技大學(xué);2015年

8 馮心欣;異構(gòu)環(huán)境下用戶參與決策的認(rèn)知頻譜接入策略研究[D];上海交通大學(xué);2015年

9 查淞;寬帶頻譜壓縮感知算法研究[D];國防科學(xué)技術(shù)大學(xué);2014年

10 何慶;基于認(rèn)知無線網(wǎng)絡(luò)的頻譜資源管理研究[D];武漢大學(xué);2010年

相關(guān)碩士學(xué)位論文 前10條

1 趙海洋;基于改進(jìn)量子遺傳算法的認(rèn)知無線電頻譜分配研究[D];燕山大學(xué);2015年

2 顏少波;基于分簇的寬帶頻譜壓縮感知技術(shù)研究[D];昆明理工大學(xué);2015年

3 喻正坤;認(rèn)知無線電網(wǎng)絡(luò)中頻譜切換與頻譜分配技術(shù)的研究[D];昆明理工大學(xué);2015年

4 張丹丹;異構(gòu)傳輸信道訪問策略的離散時域性能研究[D];燕山大學(xué);2015年

5 劉曉鈺;基于圖著色理論的認(rèn)知無線電網(wǎng)絡(luò)頻譜分配算法研究[D];遼寧師范大學(xué);2015年

6 趙彪;認(rèn)知無線網(wǎng)絡(luò)中時域機(jī)會頻譜接入策略研究[D];解放軍信息工程大學(xué);2014年

7 張林;基于拍賣的動態(tài)頻譜分配技術(shù)研究[D];南京大學(xué);2013年

8 趙康;靈活光網(wǎng)絡(luò)路由與頻譜分配算法的研究[D];南京郵電大學(xué);2015年

9 張娜娃;能耗和QoS均衡的靈活光網(wǎng)絡(luò)路由和頻譜分配算法研究[D];河北工程大學(xué);2016年

10 謝冰;異構(gòu)認(rèn)知無線網(wǎng)絡(luò)頻譜資源分配研究[D];吉林大學(xué);2016年

，

本文編號：1928779