發(fā)布時(shí)間：2018-06-20 02:13

  本文選題：認(rèn)知網(wǎng)絡(luò) + 頻譜感知��； 參考：《西安電子科技大學(xué)》2016年博士論文

【摘要】：在過去的二十年間,通信技術(shù)的發(fā)展突飛猛進(jìn),越來越多的新型通信產(chǎn)品出現(xiàn)在人們的日常生活之中。特別是無線網(wǎng)絡(luò)的普及,使得人們的學(xué)習(xí)、工作,娛樂變得更加便利。同時(shí),人們對無線頻譜資源的需求也越來越高,在一些開放使用的非授權(quán)頻段上,頻譜資源總是“供不應(yīng)求”。然而,現(xiàn)行的頻譜分配政策采用固定的頻譜劃分原則,無論授權(quán)頻段上用戶的使用效率如何低下,非授權(quán)用戶都不得使用空閑的頻譜資源。在不重新劃分頻譜資源的情況下,為了解決頻譜資源“匱乏”和固定頻段利用率低下之間的矛盾,需要一種新的頻譜共享技術(shù)來平衡頻譜資源的使用。在這種需求的指引下,認(rèn)知無線電技術(shù)應(yīng)運(yùn)而生。認(rèn)知無線電設(shè)備的普及有利于提升頻譜資源的使用效率,并解決授權(quán)頻段與非授權(quán)頻段使用不均的矛盾。與傳統(tǒng)無線通信網(wǎng)絡(luò)不同,認(rèn)知網(wǎng)絡(luò)是動(dòng)態(tài)、異構(gòu)的通信網(wǎng)絡(luò),這些特性使得將認(rèn)知網(wǎng)絡(luò)實(shí)用化面臨著諸多挑戰(zhàn)。論文針對認(rèn)知網(wǎng)絡(luò)中的協(xié)作頻譜感知、次用戶的鏈路初始化以及頻譜分配等方面展開研究,提出了一系列面向認(rèn)知網(wǎng)絡(luò)關(guān)鍵技術(shù)的解決方案。下面,將本文的主要工作概括如下：為獲得準(zhǔn)確的頻譜感知結(jié)果,對協(xié)作頻譜感知方法進(jìn)行研究,提出了基于可靠判決的協(xié)作頻譜感知算法。首先,根據(jù)本地判決結(jié)果的可靠性隨接收信噪比而提升的特點(diǎn),計(jì)算使用單門限判決的信噪比分界線。在信噪比較高的情況下,為簡化本地判決過程,僅用單門限進(jìn)行判決。在信噪比較低的情況下,為提高判決的準(zhǔn)確性,用雙門限進(jìn)行判決。如果能量累積統(tǒng)計(jì)量位于可信區(qū)間內(nèi),將判決結(jié)果直接輸出至融合中心；如果能量累積統(tǒng)計(jì)量位于擬信區(qū)間內(nèi),先由最佳單門限得到本地判決結(jié)果,然后用接收信號的對數(shù)似然比對判決結(jié)果進(jìn)行驗(yàn)證,通過驗(yàn)證的判決結(jié)果被發(fā)送至融合中心。為保證系統(tǒng)的檢測性能,將以往判決經(jīng)驗(yàn)作為現(xiàn)有檢測結(jié)果的合并權(quán)重,得出最終的感知結(jié)果。為解決認(rèn)知網(wǎng)絡(luò)非對稱模型中次用戶的鏈路初始化問題,對發(fā)射機(jī)和接收機(jī)的信道交會方法進(jìn)行研究,提出了基于認(rèn)知網(wǎng)絡(luò)非對稱模型的交會算法。首先,對異步時(shí)隙通信系統(tǒng)進(jìn)行分析。根據(jù)素?cái)?shù)模序列的交會性,提出使不同類型基本序列長度互質(zhì)的有限索數(shù)集劃分方法。然后,發(fā)射機(jī)與接收機(jī)根據(jù)可用信道集自適應(yīng)地定義基本序列長度。該方法可減少信道跳轉(zhuǎn)序列中冗余,縮短交會時(shí)間。為提高序列的使用效率,提出使用“空白”時(shí)隙進(jìn)行頻譜感知以及交會的分配策略。為解決認(rèn)知網(wǎng)絡(luò)對稱模型中次用戶的鏈路初始化問題,對具有交會能力的通用信道跳轉(zhuǎn)序列生成方法進(jìn)行研究,提出基于認(rèn)知網(wǎng)絡(luò)對稱模型的交會算法。首先,對不同跳轉(zhuǎn)步長的序列交會性進(jìn)行分析,然后根據(jù)跳轉(zhuǎn)步長對基本序列分類。在次用戶具有對等的可用信道集時(shí),通過ID序列連接不同類型的基本序列組成跳轉(zhuǎn)序列單元。ID序列的唯一、可辯性使跳轉(zhuǎn)序列單元成為滿足異步交會條件的基本單位。在次用戶具有不對等的可用信道集時(shí),通過改變基本序列產(chǎn)生參數(shù),使交會信道在可用信道集中輪換,確保次用戶在一個(gè)循環(huán)周期內(nèi)發(fā)生有保證的交會。為了提高序列的使用效率,提出序列的“空白”時(shí)隙進(jìn)行頻譜感知以及交會的分配策略。為解決次用戶配備多認(rèn)知設(shè)備時(shí)的鏈路初始化問題,對具有交會能力的并行信道跳轉(zhuǎn)序列構(gòu)造方法進(jìn)行研究,提出面向多認(rèn)知設(shè)備的交會算法。首先,對用于多認(rèn)知設(shè)備的交會模式進(jìn)行分析,證明長度不同的快-慢基本序列組之間的交會性。然后,利用可用信道集直接生成并行跳轉(zhuǎn)序列組。通過分析交會時(shí)間與基本序列長度以及快-慢序列分配參數(shù)之間的關(guān)系,提出基本序列優(yōu)化分配策略,進(jìn)一步縮短多認(rèn)知設(shè)備的交會時(shí)間。為及時(shí)獲得授權(quán)信道狀態(tài)信息,在交會序列中加入“感知”時(shí)隙,使信道跳轉(zhuǎn)序列不但能保證交會,并且還可用于周期性頻譜感知。為提高頻譜分配效率,提出基于擬態(tài)物理學(xué)優(yōu)化的并行頻譜分配算法。首先,對集中式頻譜分配場景進(jìn)行分析,通過定義干擾距離建立干擾圖模型。以最大化網(wǎng)絡(luò)吞吐量為目標(biāo),對分配向量的優(yōu)化分配方案進(jìn)行求解。由于難以獲得最優(yōu)的分配結(jié)果,利用擬態(tài)物理學(xué)優(yōu)化方法搜索次優(yōu)解。通過分解搜索空間,將分配向量分解為一組子向量,同時(shí)對所有分配子向量展開并行搜索。迭代搜索得到優(yōu)化的分配結(jié)果,并將其組合生成優(yōu)化解。為提高搜索效率,對群初始化方法進(jìn)行改進(jìn)。通過減少可行解中的隨機(jī)操作提高初始群的適應(yīng)度,使后續(xù)搜索從較高的“起點(diǎn)”開始。為提高分配的公平性,對去干擾約束操作進(jìn)行改進(jìn),使所有分配維度都有平等參與信道分配的機(jī)會。為防止迭代搜索過程中發(fā)生粒子過早聚集,導(dǎo)致次優(yōu)解陷入局部最優(yōu)解,將多樣性控制機(jī)制引入擬態(tài)物理學(xué)優(yōu)化方法。在粒子運(yùn)動(dòng)過程中,對種群內(nèi)粒子間的距離進(jìn)行測量,用方向函數(shù)控制粒子群的“收縮”與“擴(kuò)張”。
[Abstract]:In the past twenty years, the development of communication technology has developed rapidly. More and more new communication products have appeared in people's daily life. In particular, the popularity of wireless networks makes people's learning, work and entertainment more convenient. At the same time, the demand for wireless spectrum resources is becoming higher and higher, in some open use. The spectrum resource is always "short of supply" in unauthorized frequency bands. However, the current spectrum allocation policy adopts the fixed spectrum partitioning principle. The unauthorized users are not allowed to use free spectrum resources regardless of the user's inefficient use in the authorized frequency band. In order to solve the spectrum resources without remarking the frequency division spectrum resources, the spectrum resources are not reclassified. The contradiction between "lack" and the low utilization rate of fixed frequency band requires a new spectrum sharing technology to balance the use of spectrum resources. Under the guidance of this demand, cognitive radio technology emerges as the times require. The popularization of cognitive radio is beneficial to improve the efficiency of spectrum resources, and to solve the frequency and unauthorized frequency bands of authorization. Unlike traditional wireless communication networks, unlike the traditional wireless communication networks, the cognitive network is a dynamic, heterogeneous communication network. These characteristics make the application of cognitive networks facing many challenges. This paper presents a series of research on cooperative spectrum sensing, link initialization and spectrum allocation in cognitive networks. To solve the key technology of cognitive network, the main work of this paper is summarized as follows: in order to obtain accurate spectrum sensing results, the cooperative spectrum sensing method is studied, and a cooperative spectrum sensing algorithm based on reliable decision is proposed. First, the reliability of the local decision results is improved with the signal to noise ratio of the receiver. In the case of high signal-to-noise comparison, in order to simplify the local decision process, only a single threshold is used to make a decision. In the case of low signal-to-noise comparison, a two door limit is used to improve the verdict of the decision. If the energy accumulation statistic is located in the confidence interval, the decision result is direct. Output to the fusion center; if the energy accumulation statistic is located in the quasi letter interval, the local decision result is obtained by the best single threshold, then the result of the log likelihood ratio of the received signal is verified, and the verdict result is sent to the fusion center. In order to solve the link initialization problem in the asymmetric model of cognitive network, the channel rendezvous method of the transmitter and receiver is studied and the intersection algorithm based on the asymmetric model of cognitive network is proposed to solve the link initialization problem in the asymmetric model of cognitive network. According to the rendezvous of the prime module sequence, a finite cable number set division method is proposed to make each type of basic sequence length mutually qualitative. Then, the transmitter and receiver define the basic sequence length adaptively according to the available channel set. This method can reduce the redundancy and shorten the meeting time in the channel jump sequence. In order to improve the use efficiency of the sequence, the method is proposed. In order to solve the link initialization problem of the secondary users in the cognitive network symmetry model, this paper studies the generation method of the common channel jump sequence generating method with rendezvous ability, and proposes a rendezvous algorithm based on the cognitive network symmetry model. First, the sequence of different jump step length. The rendezvous is analyzed, and then the basic sequence is classified according to the jump step. When the secondary user has the equal available channel set, the.ID sequence of the jump sequence unit is composed of different types of basic sequences connected by the ID sequence. The plea makes the jump sequence unit become the basic unit to meet the condition of the different step rendezvous. In an unequal channel set, by changing the basic sequence to produce parameters, the intersection channel is rotated in the available channel, ensuring that the secondary user has a guaranteed intersection within a cycle. In order to improve the efficiency of the sequence, the "blank" time slot in the sequence is introduced into the spectrum sensing and the rendezvous allocation strategy. The problem of link initialization when the sub user is equipped with multiple cognitive devices, research on the construction method of the parallel channel jump sequence with rendezvous ability, and propose a rendezvous algorithm for multiple cognitive devices. First, the intersection mode of the multi cognitive equipment is analyzed to prove the rendezvous between the fast slow basic sequence groups with different length. Then, the parallel jump sequence group is generated directly by using the available channel set. By analyzing the relationship between the intersection time and the basic sequence length and the fast slow sequence distribution parameters, the basic sequence optimization allocation strategy is proposed to further shorten the intersection time of the multi cognitive equipment, and to get the authorized channel state information in time and join the rendezvous sequence in the rendezvous sequence. "Perception" time slot makes the channel jump sequence not only to guarantee the intersection, but also can be used for periodic spectrum sensing. In order to improve the efficiency of the spectrum distribution, a parallel spectrum allocation algorithm based on physical physics optimization is proposed. Firstly, the centralized spectrum allocation scene is analyzed, and the interference distance is established to establish an interference map model. With the goal of network throughput, the optimal allocation scheme of distribution vectors is solved. Due to the difficulty of obtaining the optimal distribution results, the optimal solution of the physical physics is used to search the suboptimal solution. By decomposing the search space, the distribution vector is decomposed into a group of subvectors, and all the sub vectors are searched in parallel. The iterative search is optimized. In order to improve the efficiency of the search, to improve the search efficiency, improve the group initialization method, improve the fitness of the initial group by reducing the random operation in the feasible solution, and make the follow-up search start from the higher "starting point". In order to improve the fairness of the allocation, the operation of the interference constraint is improved and all the allocation is made. All dimensions have equal opportunity to participate in channel allocation. In order to prevent the premature aggregation of particles in the iterative search process, the suboptimal solution falls into the local optimal solution, and the diversity control mechanism is introduced into the state physics optimization method. In the particle motion process, the distance between particles in the population is measured and the particle swarm is controlled by the direction function. "Contraction" and "expansion".
【學(xué)位授予單位】：西安電子科技大學(xué)
【學(xué)位級別】：博士
【學(xué)位授予年份】：2016
【分類號】：TN925

【相似文獻(xiàn)】

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

1 滑楠;曹志剛;;無線認(rèn)知網(wǎng)絡(luò)概念與實(shí)例研究[J];計(jì)算機(jī)工程與應(yīng)用;2009年02期

2 劉超;王海濤;;網(wǎng)絡(luò)發(fā)展的一種新動(dòng)向——認(rèn)知網(wǎng)絡(luò)[J];數(shù)據(jù)通信;2009年02期

3 邵飛;汪李峰;伍春;;基于認(rèn)知層的認(rèn)知網(wǎng)絡(luò)結(jié)構(gòu)及其認(rèn)知方法[J];北京工業(yè)大學(xué)學(xué)報(bào);2009年09期

4 陳錚;張勇;滕穎蕾;羅希;;認(rèn)知網(wǎng)絡(luò)概述[J];無線通信技術(shù);2009年04期

5 雷宜海;;認(rèn)知網(wǎng)絡(luò)概述[J];電信快報(bào);2010年04期

6 沙智;;淺析認(rèn)知網(wǎng)絡(luò)的關(guān)鍵技術(shù)及其多方面應(yīng)用[J];知識經(jīng)濟(jì);2010年07期

7 王琪;;認(rèn)知網(wǎng)絡(luò)概念及技術(shù)要求[J];洛陽師范學(xué)院學(xué)報(bào);2010年05期

8 劉琪;周正;王樹彬;;主用戶鏈路深度衰落下的認(rèn)知網(wǎng)絡(luò)中繼[J];高技術(shù)通訊;2010年03期

9 ;“認(rèn)知網(wǎng)絡(luò)”正文通知[J];通信學(xué)報(bào);2011年01期

10 王健;趙國生;孫廣路;趙中楠;;面向服務(wù)性能的認(rèn)知網(wǎng)絡(luò)理論及形式化建模方法[J];哈爾濱理工大學(xué)學(xué)報(bào);2014年01期

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

1 吳繼寶;;認(rèn)知網(wǎng)絡(luò)端到端QoS技術(shù)研究[A];江蘇省電子學(xué)會2010年學(xué)術(shù)年會論文集[C];2010年

2 高春蓉;賁可榮;;一種基于Agent的認(rèn)知網(wǎng)絡(luò)節(jié)點(diǎn)模型[A];第13屆中國系統(tǒng)仿真技術(shù)及其應(yīng)用學(xué)術(shù)年會論文集[C];2011年

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

1 劉舒祺;基于QoS度量的移動(dòng)認(rèn)知網(wǎng)絡(luò)路由決策[D];蘇州大學(xué);2016年

2 鐘鳴;面向認(rèn)知網(wǎng)絡(luò)的鏈路初始化與頻譜分配技術(shù)研究[D];西安電子科技大學(xué);2016年

3 李婕;認(rèn)知網(wǎng)絡(luò)中基于網(wǎng)絡(luò)狀態(tài)和行為預(yù)測的路由及數(shù)據(jù)分發(fā)算法研究[D];東北大學(xué);2015年

4 胡罡;無線認(rèn)知網(wǎng)絡(luò)頻譜感知與接入關(guān)鍵技術(shù)研究[D];國防科學(xué)技術(shù)大學(xué);2010年

5 馮光升;面向認(rèn)知網(wǎng)絡(luò)的自適應(yīng)QoS感知與配置方法[D];哈爾濱工程大學(xué);2009年

6 亓?xí)x;基于貝葉斯網(wǎng)絡(luò)的認(rèn)知網(wǎng)絡(luò)QoS自主控制技術(shù)研究[D];南京郵電大學(xué);2013年

7 陳少磊;無速率碼的編譯碼及其在中繼與認(rèn)知網(wǎng)絡(luò)中的應(yīng)用[D];浙江大學(xué);2013年

8 梁偉;認(rèn)知網(wǎng)絡(luò)的接入選擇與擁塞控制研究[D];南京郵電大學(xué);2011年

9 陳亮;認(rèn)知網(wǎng)絡(luò)中頻譜管理與流量調(diào)度關(guān)鍵技術(shù)研究[D];北京郵電大學(xué);2012年

10 李丹丹;認(rèn)知網(wǎng)絡(luò)中具有自主學(xué)習(xí)特征的智能QoS保障機(jī)制研究[D];北京交通大學(xué);2013年

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

1 郭苑;基于業(yè)務(wù)的認(rèn)知網(wǎng)絡(luò)健康度評價(jià)體系研究[D];南京郵電大學(xué);2011年

2 季麗娟;認(rèn)知網(wǎng)絡(luò)中動(dòng)態(tài)調(diào)度機(jī)理研究[D];上海交通大學(xué);2015年

3 簡洪浩;干擾對齊方法在認(rèn)知網(wǎng)絡(luò)的應(yīng)用研究[D];上海交通大學(xué);2015年

4 陳錚;認(rèn)知網(wǎng)絡(luò)的網(wǎng)絡(luò)架構(gòu)及行為模型研究[D];北京郵電大學(xué);2011年

5 董紅軍;面向認(rèn)知網(wǎng)絡(luò)的仿真平臺的研究與實(shí)現(xiàn)[D];吉林大學(xué);2012年

6 陶瑩;無線認(rèn)知網(wǎng)絡(luò)中資源優(yōu)化研究[D];大連理工大學(xué);2012年

7 楊超;認(rèn)知網(wǎng)絡(luò)多維資源管理技術(shù)[D];西安電子科技大學(xué);2012年

8 翁乾村;認(rèn)知網(wǎng)絡(luò)端到端態(tài)勢評估與預(yù)測技術(shù)研究[D];南京郵電大學(xué);2013年

9 王欣楠;認(rèn)知網(wǎng)絡(luò)中網(wǎng)絡(luò)資源分配管理與演示系統(tǒng)設(shè)計(jì)與實(shí)現(xiàn)[D];西安電子科技大學(xué);2013年

10 孟祥燕;認(rèn)知網(wǎng)絡(luò)多維資源管理數(shù)據(jù)庫的設(shè)計(jì)與實(shí)現(xiàn)[D];西安電子科技大學(xué);2014年

，

本文編號：2042456