基于博弈論的預(yù)測預(yù)約路由算法研究與實現(xiàn)
[Abstract]:With the development of science and technology, wireless network, with its independence, mobility and distribution, is gradually replacing the traditional wired network in the work and life of people. And wireless ad-organization network has gradually become a hot topic in the field of network research. As the price of mobility and independence, node devices in wireless networks, especially in wireless ad hoc networks, are usually limited by computing power, storage capacity, battery capacity, and so on. Compared with node devices in fixed networks, mobile nodes are more motivated to refuse to provide network services to other nodes for selfish purposes. This selfish behavior has a negative impact on the overall performance of the network, and often limits the normal operation of the nodes themselves. In order to reduce the influence of selfishness of wireless nodes, researchers have introduced the idea of game theory into the research of routing protocols. By setting up reasonable incentive and restriction mechanisms, game routing algorithm can effectively eliminate the motivation of selfish behavior of nodes and force nodes to participate in normal network cooperation. Based on the related concepts of Nash solution in game theory and some ideas of Ad hoc VCG algorithm, a predictive reservation routing algorithm based on game theory is proposed in this paper. This algorithm improves the efficiency of routing by reducing the difficulty and computational complexity of obtaining trust, and limits the selfish behavior of nodes by introducing predictive reservation mechanism. Compared with the VCG algorithm and the LSTOP algorithm, the simulation results show that the proposed algorithm not only provides higher packet delivery rate than the VCG algorithm, but also achieves better end-to-end transmission performance than the LSTOP algorithm. On the other hand, because of the independence of the prediction algorithm in the routing algorithm, the routing performance can be adjusted by replacing the prediction algorithm, thus bringing more flexible routing function. Finally, the predictive reservation routing algorithm based on game theory is implemented in the demo system.
【學(xué)位授予單位】:西安電子科技大學(xué)
【學(xué)位級別】:碩士
【學(xué)位授予年份】:2014
【分類號】:TN929.5;O225
【共引文獻】
相關(guān)期刊論文 前10條
1 韓松;王威;楊建軍;何洲汀;;混凝土裂縫寬度預(yù)測模型研究[J];四川建筑科學(xué)研究;2011年03期
2 韓凈,侯宜祥;基于改進遺傳算法的電網(wǎng)無功優(yōu)化[J];安徽電氣工程職業(yè)技術(shù)學(xué)院學(xué)報;2004年01期
3 賈德香;韓凈;;基于改進BP網(wǎng)絡(luò)的電力系統(tǒng)超短期負荷預(yù)測[J];安徽電氣工程職業(yè)技術(shù)學(xué)院學(xué)報;2008年03期
4 黃己立,雷聲;滲氮反應(yīng)過程控制數(shù)學(xué)模型的研究[J];安徽建筑工業(yè)學(xué)院學(xué)報(自然科學(xué)版);2005年03期
5 霍惠玉;張鷹;金鑫;石宇;;BP神經(jīng)網(wǎng)絡(luò)在需水預(yù)測中的應(yīng)用[J];安徽農(nóng)業(yè)科學(xué);2006年21期
6 馬銳,劉玉樹,杜彥輝;基于ART2神經(jīng)網(wǎng)絡(luò)的入侵檢測方法[J];北京理工大學(xué)學(xué)報;2004年08期
7 喬立山,王玉蘭,曾錦光;實驗數(shù)據(jù)處理中曲線擬合方法探討[J];成都理工大學(xué)學(xué)報(自然科學(xué)版);2004年01期
8 李武林;郝玉潔;;BP網(wǎng)絡(luò)隱節(jié)點數(shù)與計算復(fù)雜度的關(guān)系[J];成都信息工程學(xué)院學(xué)報;2006年01期
9 汪文雄;李啟明;;基于利益相關(guān)者多方滿意的城市交通PPP項目特許價格調(diào)整模型研究[J];重慶大學(xué)學(xué)報(社會科學(xué)版);2010年03期
10 陳敏,劉君;BP網(wǎng)絡(luò)的改進及其應(yīng)用[J];湖南文理學(xué)院學(xué)報(自然科學(xué)版);2005年02期
相關(guān)碩士學(xué)位論文 前10條
1 宋家勇;安林煤礦炮放面礦壓顯現(xiàn)規(guī)律及頂煤冒放性預(yù)測研究[D];河南理工大學(xué);2010年
2 朱正強;車標(biāo)識別的關(guān)鍵技術(shù)研究[D];遼寧師范大學(xué);2010年
3 饒裕平;基于視頻的森林火災(zāi)識別方法研究[D];浙江農(nóng)林大學(xué);2010年
4 易鑫;功能陶瓷精密CMP拋光工藝參數(shù)決策優(yōu)化的研究[D];湘潭大學(xué);2010年
5 馬媛媛;基于紋理分類的圖像檢索技術(shù)研究[D];河南理工大學(xué);2010年
6 韓世濤;寧夏太陽能資源評估分析[D];蘭州大學(xué);2010年
7 江治;基于復(fù)雜背景下的車牌識別系統(tǒng)[D];華東師范大學(xué);2010年
8 李宗坤;QCM氣體傳感器的研究及其在安全檢測中的應(yīng)用[D];天津理工大學(xué);2010年
9 陳小強;神經(jīng)網(wǎng)絡(luò)方法在灌區(qū)需水量預(yù)測中的應(yīng)用研究[D];新疆農(nóng)業(yè)大學(xué);2010年
10 陳星毅;基于人體心血管生理的頸部服裝壓力舒適性研究[D];江南大學(xué);2010年
,本文編號:2420186
本文鏈接:http://sikaile.net/kejilunwen/wltx/2420186.html