中国韩国日本在线观看免费,A级尤物一区,日韩精品一二三区无码,欧美日韩少妇色

當(dāng)前位置:主頁 > 科技論文 > 信息工程論文 >

接觸可預(yù)測的認(rèn)知自組織網(wǎng)絡(luò)動態(tài)多路徑機(jī)會路由模型及其穩(wěn)定性度量

發(fā)布時間:2018-11-06 15:38
【摘要】:隨著無線通信技術(shù)的迅猛發(fā)展,可用的頻譜資源變得越來越緊張,尤其是隨著無線局域網(wǎng)、無線個域網(wǎng)和無線城域網(wǎng)等技術(shù)的高速發(fā)展,目前的寬帶無線應(yīng)用技術(shù)已無法滿足人們的需求。目前的頻譜分配體制造成了網(wǎng)絡(luò)使用方式僵化、無線頻譜規(guī)劃緊張,難以滿足未來網(wǎng)絡(luò)通信技術(shù)智能化、泛在化、融合化的發(fā)展趨勢。作為認(rèn)知無線電技術(shù)與自組織網(wǎng)絡(luò)結(jié)合的認(rèn)知自組織網(wǎng)絡(luò),采用頻譜共享的認(rèn)知無線電系統(tǒng),使網(wǎng)絡(luò)從靜態(tài)工作模式發(fā)展到動態(tài)自適應(yīng)模式,在一定程度上解決了頻譜資源短缺的問題,提高了網(wǎng)絡(luò)對環(huán)境的適應(yīng)能力。然而,在認(rèn)知自組織網(wǎng)絡(luò)中,網(wǎng)絡(luò)拓?fù)渚哂袝r變性,容易形成網(wǎng)絡(luò)孤島,進(jìn)而導(dǎo)致認(rèn)知節(jié)點(diǎn)之間的鏈路頻繁的斷開,需要中繼節(jié)點(diǎn)以多跳存儲攜帶轉(zhuǎn)發(fā)、接觸關(guān)系預(yù)測的方式將數(shù)據(jù)包以動態(tài)機(jī)會路由模式轉(zhuǎn)發(fā)至目的節(jié)點(diǎn)。因此,本文采用接觸可預(yù)測的方法描述不同網(wǎng)絡(luò)孤島間SU節(jié)點(diǎn)間接觸關(guān)系,基于接觸可預(yù)測的認(rèn)知自組織網(wǎng)絡(luò)的特性,有針對性地開展了以下研究工作:1、在接觸可預(yù)測的認(rèn)知自組織網(wǎng)絡(luò)可用頻譜與網(wǎng)絡(luò)拓?fù)鋾r變性的前提下,提出了一種動態(tài)多路徑機(jī)會路由選擇算法-SefRoute。通過利用電磁場中電場線的分布,初步確定多條不相交路徑的軌跡,結(jié)合社交網(wǎng)絡(luò)中相關(guān)知識,構(gòu)造出節(jié)點(diǎn)之間相遇概率的函數(shù),通過機(jī)會連接率將多元社交關(guān)系中的中心性、相似性與信任度三個重要因素與節(jié)點(diǎn)相遇概率結(jié)合在一起。結(jié)合認(rèn)知自組織網(wǎng)絡(luò)自身的特性構(gòu)造出三個重要因素的相關(guān)函數(shù),最終在多條不相交路徑軌跡的基礎(chǔ)上確定多路徑機(jī)會路由。仿真結(jié)果表明所提SefRoute算法在成功傳輸率、時延等方面均有很好的性能。2、定義了一種鏈路穩(wěn)定度指標(biāo)的度量方法,結(jié)合路徑穩(wěn)定度與業(yè)務(wù)類型優(yōu)先級別提出多路徑路由動態(tài)速率分配算法?紤]用戶不同類型業(yè)務(wù)的性能參數(shù),引入流量感知因子,在保證不同類型業(yè)務(wù)對流量需求的基礎(chǔ)上,將路徑穩(wěn)定性因子考慮在內(nèi),利用數(shù)學(xué)工具-非合作微分博弈建立多路徑路由動態(tài)的速率分配模型。構(gòu)造最優(yōu)問題并得到最優(yōu)解,仿真分析表明,該算法在不同業(yè)務(wù)對QoS(服務(wù)質(zhì)量)需求方面有很好的性能。
[Abstract]:With the rapid development of wireless communication technology, the available spectrum resources become increasingly tight, especially with the rapid development of wireless local area network, wireless personal area network and wireless metropolitan area network. The current broadband wireless application technology has been unable to meet the needs of people. The current spectrum allocation system has resulted in rigid network usage and tight wireless spectrum planning, which makes it difficult to meet the development trend of intelligent, ubiquitous and integrated network communication technology in the future. As a combination of cognitive radio technology and ad hoc network, the cognitive ad hoc network uses spectrum sharing cognitive radio system to develop the network from static mode to dynamic adaptive mode. To some extent, the shortage of spectrum resources is solved, and the adaptability of network to environment is improved. However, in cognitive ad hoc networks, the network topology is time-varying, which is easy to form a network island, which leads to frequent disconnection of links between cognitive nodes, which requires relay nodes to be stored and forwarded in multiple hops. Contact relationship prediction forwards packets to the destination node in dynamic opportunity routing mode. Therefore, the contact predictability method is used to describe the contact relationship between SU nodes in different network islands. Based on the characteristics of the contact-predictable cognitive ad hoc networks, the following research works are carried out: 1. In this paper, a dynamic multipath opportunistic routing algorithm, SefRoute., is proposed on the premise of the temporal variability of the available spectrum and the topology of the cognitive ad hoc networks. By using the distribution of electric field lines in the electromagnetic field, the locus of several disjoint paths is preliminarily determined, and the function of the probability of meeting between nodes is constructed by combining the relevant knowledge in the social network, and the centrality of the multivariate social relations is determined by the chance connection rate. Three important factors of similarity and trust are combined with the encounter probability of nodes. Based on the characteristics of cognitive ad hoc networks, the correlation functions of three important factors are constructed. Finally, the opportunity routing of multiple paths is determined on the basis of multiple disjoint paths. The simulation results show that the proposed SefRoute algorithm has good performance in the aspects of successful transmission rate and delay. Combining path stability with traffic type priority, a dynamic rate allocation algorithm for multipath routing is proposed. Considering the performance parameters of different types of services and introducing a traffic awareness factor, the path stability factor is taken into account on the basis of ensuring the traffic requirements of different types of services. A dynamic rate allocation model of multipath routing is established by using non-cooperative differential game, which is a mathematical tool. The optimal problem is constructed and the optimal solution is obtained. The simulation results show that the algorithm has good performance in different traffic requirements for QoS (quality of Service).
【學(xué)位授予單位】:河北工程大學(xué)
【學(xué)位級別】:碩士
【學(xué)位授予年份】:2017
【分類號】:TN925

【參考文獻(xiàn)】

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

1 劉春陽;朱琦;;認(rèn)知無線電中視頻通信功率速率聯(lián)合控制算法[J];南京郵電大學(xué)學(xué)報(自然科學(xué)版);2016年01期

2 鄭巍;潘倩;鄧宇凡;;移動社交網(wǎng)絡(luò)中基于共同鄰居網(wǎng)絡(luò)中心度的鏈路預(yù)測方法[J];計算機(jī)應(yīng)用研究;2016年09期

3 王貽彬;倪衛(wèi)明;;認(rèn)知無線電中基于博弈論方法的聯(lián)合功率速率控制[J];計算機(jī)工程;2014年09期

4 許瑞琛;蔣挺;;基于POMDP的認(rèn)知無線電自適應(yīng)頻譜感知算法[J];通信學(xué)報;2013年06期

5 ZHAO Yuan;JIN Shun-fu;TIAN Nai-shuo;;Non-saturated throughput analysis of IEEE 802.11-based cognitive radio networks[J];The Journal of China Universities of Posts and Telecommunications;2012年06期

6 王苗苗;李世銀;肖淑艷;孫科建;崔磊;;基于改進(jìn)D-S證據(jù)理論的認(rèn)知無線電頻譜感知算法[J];電訊技術(shù);2012年08期

7 楊雙懋;郭偉;唐偉;;一種最大化網(wǎng)絡(luò)吞吐量的認(rèn)知無線Ad Hoc網(wǎng)絡(luò)跨層優(yōu)化算法[J];計算機(jī)學(xué)報;2012年03期

8 關(guān)宏博;張廣春;;認(rèn)知無線電中基于博弈論的聯(lián)合功率和速率控制算法[J];計算機(jī)科學(xué);2011年S1期

9 俎云霄;周杰;;基于組合混沌遺傳算法的認(rèn)知無線電資源分配[J];物理學(xué)報;2011年07期

10 顧金媛;章國安;包志華;;認(rèn)知無線Mesh網(wǎng)絡(luò)聯(lián)合多路徑路由和信道分配策略[J];計算機(jī)科學(xué);2011年05期



本文編號:2314703

資料下載
論文發(fā)表

本文鏈接:http://www.lk138.cn/kejilunwen/xinxigongchenglunwen/2314703.html


Copyright(c)文論論文網(wǎng)All Rights Reserved | 網(wǎng)站地圖 |

版權(quán)申明:資料由用戶0a5ee***提供,本站僅收錄摘要或目錄,作者需要刪除請E-mail郵箱bigeng88@qq.com