本文關(guān)鍵詞：基于優(yōu)先級隊列的協(xié)作認(rèn)知頻譜共享　出處：《西安電子科技大學(xué)》2014年碩士論文　論文類型：學(xué)位論文

  更多相關(guān)文章： 協(xié)作認(rèn)知無線網(wǎng)絡(luò) 頻譜共享 優(yōu)先級隊列 時延

【摘要】：隨著無線通信需求的高速增長,頻譜資源的稀缺與實際頻譜固定分配機制造成的頻譜總體利用率偏低之間的矛盾成為制約未來移動通信快速發(fā)展的瓶頸。認(rèn)知無線電(Cognitive Radio,CR)技術(shù)能主動感知無線通信環(huán)境,動態(tài)地接入未被主用戶(Primary User,PU)使用的空閑頻段,為解決上述矛盾開辟了一條嶄新的途徑。然而,頻譜資源的動態(tài)性和復(fù)雜性為CR系統(tǒng)的設(shè)計實現(xiàn)帶來了挑戰(zhàn)。本文針對協(xié)作認(rèn)知無線網(wǎng)絡(luò)(CCRN)提出了一種基于優(yōu)先級隊列的兩級中心協(xié)作頻譜共享方案(PQTL-CSS)。通過招募認(rèn)知用戶作為中繼,協(xié)助完成授權(quán)通信,并將傳統(tǒng)的數(shù)據(jù)協(xié)作拓展至管理協(xié)作,由協(xié)作認(rèn)知節(jié)點協(xié)調(diào)其它認(rèn)知節(jié)點的接入,形成由主用戶和協(xié)作認(rèn)知節(jié)點構(gòu)成的兩級中心管理結(jié)構(gòu)。在保障主用戶最高優(yōu)先級的同時,作為對認(rèn)知節(jié)點協(xié)助授權(quán)業(yè)務(wù)傳輸?shù)幕貓?賦予其高于非協(xié)作認(rèn)知節(jié)點的信道接入權(quán)限。所提機制可以很好的解決協(xié)作認(rèn)知節(jié)點與非協(xié)作認(rèn)知節(jié)點的資源分配問題,以及在業(yè)務(wù)隨機性較強的情況下實現(xiàn)多種類型節(jié)點的動態(tài)、高效頻譜共享。協(xié)議研究了協(xié)作認(rèn)知無線網(wǎng)絡(luò)中不同類型用戶的數(shù)據(jù)傳輸,提出一種基于請求許可差的接入?yún)f(xié)議;考慮了網(wǎng)絡(luò)拓?fù)浜屯ㄐ胚^程的動態(tài)特性對系統(tǒng)的影響,主用戶可周期性地發(fā)起中繼選擇過程對信道進行檢測,能夠根據(jù)網(wǎng)絡(luò)狀況對認(rèn)知中繼節(jié)點進行更新,這樣可以在網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)以及通信過程發(fā)生變化時,通過協(xié)作認(rèn)知用戶的更新保證較好的數(shù)據(jù)傳輸性能。接下來,論文將設(shè)計的協(xié)議應(yīng)用到了認(rèn)知戰(zhàn)術(shù)網(wǎng)絡(luò),并針對該網(wǎng)絡(luò)的特點對協(xié)議進行了相應(yīng)的修改。論文對不同類型用戶的時延性能進行了理論分析與數(shù)值仿真,并對不同類型用戶的吞吐量性能進行了數(shù)值仿真。結(jié)果表明,所提PQTL-CSS能夠在業(yè)務(wù)隨機性較強的情況下,實現(xiàn)多種類型節(jié)點的動態(tài)、高效頻譜共享,且中繼協(xié)作節(jié)點的時延比傳統(tǒng)方法要低。
[Abstract]:With the rapid growth of wireless communication demand. The contradiction between the scarcity of spectrum resources and the low overall spectrum efficiency caused by the actual fixed spectrum allocation mechanism has become a bottleneck restricting the rapid development of mobile communications in the future. Cognitive Radio. The CRT technology can actively perceive the wireless communication environment and dynamically access the idle frequency band not used by the primary user. It opens up a new way to solve these contradictions. The dynamic and complexity of spectrum resources bring challenges to the design and implementation of CR system. In this paper, a two-level cooperative spectrum sharing scheme based on priority queue (PQTL-CSS) is proposed. Cognitive users are recruited as relays. Assist to complete the authorized communication and extend the traditional data collaboration to management collaboration. The cooperative cognitive node coordinates the access of other cognitive nodes. A two-level central management structure consisting of primary users and cooperative cognitive nodes is formed, which ensures the highest priority of primary users and provides a return for the cognitive nodes to assist in the transmission of authorized services. The proposed mechanism can solve the problem of resource allocation between cooperative cognitive nodes and non-cooperative cognitive nodes. And the dynamic and efficient spectrum sharing of many kinds of nodes is realized under the condition of strong randomness of service. The protocol studies the data transmission of different types of users in cooperative cognitive wireless networks. An access protocol based on request permission difference is proposed. Considering the influence of the network topology and the dynamic characteristics of the communication process on the system, the primary user can periodically initiate the relay selection process to detect the channel, and can update the cognitive relay nodes according to the network conditions. In this way, when the network topology and communication process changes, the update of cooperative cognitive users can ensure better data transmission performance. Next, the proposed protocol is applied to cognitive tactical networks. The protocol is modified according to the characteristics of the network. The delay performance of different types of users is analyzed theoretically and numerically simulated in this paper. Numerical simulation of throughput performance of different types of users is carried out. The results show that the proposed PQTL-CSS can realize the dynamic performance of various types of nodes under the condition of strong randomness of service. Efficient spectrum sharing and delay of relay cooperative nodes are lower than traditional methods.
【學(xué)位授予單位】：西安電子科技大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TN925

【共引文獻】

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

1 程卓;認(rèn)知差分跳頻通信網(wǎng)絡(luò)抗干擾技術(shù)研究[D];華中科技大學(xué);2010年

2 張立;認(rèn)知無線電網(wǎng)絡(luò)MAC層關(guān)鍵技術(shù)及安全認(rèn)證研究[D];上海大學(xué);2010年

3 張偉青;認(rèn)知無線網(wǎng)絡(luò)資源管理的研究[D];華南理工大學(xué);2011年

4 魏飛;認(rèn)知MIMO網(wǎng)絡(luò)資源分配關(guān)鍵技術(shù)研究[D];南京郵電大學(xué);2013年

5 趙明;感知網(wǎng)絡(luò)中的動態(tài)頻譜共享理論與算法研究[D];北京郵電大學(xué);2013年

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

1 李安寧;認(rèn)知無線電頻譜分配和決策引擎算法研究[D];哈爾濱工程大學(xué);2013年

2 黃焱;認(rèn)知無線網(wǎng)絡(luò)中路由關(guān)鍵問題的研究[D];黑龍江大學(xué);2014年

，

本文編號：1416560