本文選題：認(rèn)知無(wú)線(xiàn)網(wǎng)絡(luò)　切入點(diǎn)：潛博弈　出處：《哈爾濱工業(yè)大學(xué)》2017年碩士論文

【摘要】：近年來(lái),傳統(tǒng)無(wú)線(xiàn)網(wǎng)絡(luò)技術(shù)正逐漸難以滿(mǎn)足爆發(fā)式增長(zhǎng)的通信需求。而以頻譜為代表的無(wú)線(xiàn)類(lèi)資源正變得越來(lái)越稀缺緊張,認(rèn)知無(wú)線(xiàn)網(wǎng)絡(luò)技術(shù)正逐漸受到人們的普遍關(guān)注。博弈論作為研究具有競(jìng)爭(zhēng)現(xiàn)象的理論和方法,已經(jīng)在解決認(rèn)知無(wú)線(xiàn)網(wǎng)絡(luò)中的資源分配相關(guān)問(wèn)題中發(fā)揮著重要作用。潛博弈作為一種特殊類(lèi)型的博弈,相比較于其他類(lèi)型博弈,其具備有限遞增屬性、納什均衡的存在性和唯一性等諸多良好屬性。本課題主要利用潛博弈理論解決認(rèn)知無(wú)線(xiàn)網(wǎng)絡(luò)技術(shù)中的與信道選擇相關(guān)的兩個(gè)關(guān)鍵問(wèn)題——頻譜分配和廣播重傳。頻譜分配作為認(rèn)知無(wú)線(xiàn)網(wǎng)絡(luò)中的關(guān)鍵技術(shù),已知的潛博弈模型在設(shè)計(jì)效用函數(shù)和潛在函數(shù)時(shí)只考慮了用戶(hù)之間相互干擾這一主要因素。本文在已有模型的基礎(chǔ)上進(jìn)行改進(jìn),綜合考慮了干擾量和吞吐量這兩個(gè)因素來(lái)設(shè)計(jì)新的效用函數(shù)和潛在函數(shù),并給出了新的潛博弈模型PG-TI。在PG-TI基礎(chǔ)上設(shè)計(jì)出基于新的潛博弈模型的頻譜分配算法PG-TIA。仿真實(shí)驗(yàn)結(jié)果表明,本文提出的PG-TIA算法具有良好的收斂性,而且能夠有效增大系統(tǒng)吞吐量、降低系統(tǒng)總的傳輸功率,并表現(xiàn)出良好的算法公平性。廣播重傳是認(rèn)知無(wú)線(xiàn)網(wǎng)絡(luò)數(shù)據(jù)包廣播過(guò)程中必須要考慮到的問(wèn)題,其目的是為了實(shí)現(xiàn)可靠的數(shù)據(jù)傳輸。而廣播重傳發(fā)生時(shí),用戶(hù)如何選擇合適的信道進(jìn)行重傳操作決定著重傳的效率和質(zhì)量。本文設(shè)計(jì)了一種基于潛博弈的廣播重傳模型PG-BR。在該模型中,設(shè)計(jì)了兩種廣播重傳的協(xié)議機(jī)制來(lái)避免“沖突”問(wèn)題,并針對(duì)不同申請(qǐng)使用信道的用戶(hù)情況設(shè)定了優(yōu)先級(jí)。在效用函數(shù)和潛在函數(shù)設(shè)計(jì)中綜合考慮了能耗和干擾兩大因素。并提出了一種新的基于潛博弈的廣播重傳算法PG-BRA。仿真實(shí)驗(yàn)結(jié)果表明,本文提出的PG-BRA算法能夠增大數(shù)據(jù)包可達(dá)率、減少數(shù)據(jù)包平均重傳次數(shù)、降低平均時(shí)延和降低系統(tǒng)總的傳輸功率。
[Abstract]:In recent years, the traditional wireless network technology is gradually unable to meet the explosive growth of communication needs. The wireless resources, represented by the spectrum, are becoming increasingly scarce. Cognitive wireless network technology is getting more and more attention. Game theory is a theory and method to study the phenomenon of competition. The latent game, as a special type of game, has the attribute of limited increment, compared with other types of game, which plays an important role in solving the problem of resource allocation in cognitive wireless network. The existence and uniqueness of Nash equalization and many other good properties. This paper mainly uses the latent game theory to solve the two key problems related to channel selection in cognitive wireless network technology: spectrum allocation and broadcast retransmission. Spectrum assignment is a key technology in cognitive wireless networks. In the design of utility function and potential function, the known latent game model only takes into account the main factor of user interference. A new utility function and a potential function are designed by considering both interference and throughput factors. A new latent game model PG-TI. a spectrum allocation algorithm PG-TIA-based on the basis of PG-TI is designed. The simulation results show that the proposed PG-TIA algorithm has good convergence and can effectively increase the system throughput. Reducing the total transmission power of the system and showing good algorithm fairness. Broadcast retransmission is a problem that must be considered in the process of packet broadcast in cognitive wireless networks. The aim is to achieve reliable data transmission. And when broadcast retransmission occurs, In this paper, a broadcast retransmission model PG-BRbased on latent game is designed. Two protocol mechanisms for broadcast retransmission are designed to avoid "conflict". In addition, the priority is set for users applying for different channels. Two factors, energy consumption and interference, are considered in the design of utility function and potential function. A new broadcast retransmission algorithm based on latent game is proposed. Method PG-BRA.The simulation results show that, The proposed PG-BRA algorithm can increase the reachability of data packets, reduce the average number of retransmissions, reduce the average delay and reduce the total transmission power of the system.
【學(xué)位授予單位】：哈爾濱工業(yè)大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2017
【分類(lèi)號(hào)】：TN92

【參考文獻(xiàn)】

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

1 章?lián)P;周正;石磊;李斌;李德建;;基于嚴(yán)格勢(shì)博弈的干擾對(duì)齊[J];北京郵電大學(xué)學(xué)報(bào);2013年02期

2 楊光;蔚承建;王開(kāi);胡恒愷;;圖形著色問(wèn)題的分布式勢(shì)博弈算法[J];計(jì)算機(jī)工程;2012年23期

3 樊帥;張林;王耀希;任勇;;無(wú)線(xiàn)多跳網(wǎng)絡(luò)基于位勢(shì)博弈的傳輸調(diào)度方法[J];計(jì)算機(jī)應(yīng)用研究;2012年03期

4 盧冀;肖嵩;吳成柯;;一種基于機(jī)會(huì)式網(wǎng)絡(luò)編碼的高效廣播重傳方法[J];電子與信息學(xué)報(bào);2011年04期

5 郝丹丹;鄒仕洪;程時(shí)端;;開(kāi)放式頻譜系統(tǒng)中啟發(fā)式動(dòng)態(tài)頻譜分配算法[J];軟件學(xué)報(bào);2008年03期

6 廖楚林;陳R，

本文編號(hào)：1658617