天堂国产午夜亚洲专区-少妇人妻综合久久蜜臀-国产成人户外露出视频在线-国产91传媒一区二区三区

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

面向MAENT的信任度計(jì)算方法與路由協(xié)議研究

發(fā)布時(shí)間:2019-06-07 15:36
【摘要】:移動(dòng)自組織網(wǎng)絡(luò)(Mobile Ad Hoc Network,MANET)中信任度計(jì)算與路由方法是該領(lǐng)域的重要關(guān)鍵技術(shù)。由于傳統(tǒng)的中心安全控制策略很難應(yīng)用于分布式網(wǎng)絡(luò)中,有研究提出采用數(shù)字簽名、認(rèn)證技術(shù)、密鑰管理技術(shù)等,實(shí)現(xiàn)接入控制和數(shù)據(jù)機(jī)密性、不可否認(rèn)性、完整性、實(shí)時(shí)性驗(yàn)證。由于優(yōu)先信任的限制,基于驗(yàn)證和訪問控制的傳統(tǒng)安全機(jī)制不能解決網(wǎng)絡(luò)內(nèi)部攻擊問題,需采用節(jié)點(diǎn)間相互信任合作檢測(cè)并分離出違規(guī)節(jié)點(diǎn)。建立如分級(jí)混合體系結(jié)構(gòu),采用如基于令牌的合作增強(qiáng)機(jī)制、基于多項(xiàng)式機(jī)密共享的普遍健壯性服務(wù)、基于節(jié)點(diǎn)間信任值策略等,來解決網(wǎng)絡(luò)內(nèi)部攻擊。這對(duì)網(wǎng)絡(luò)中數(shù)據(jù)傳輸效率有至關(guān)重要的影響,在保證網(wǎng)絡(luò)成本較低的情況下,提高路由算法的效率有著重要的意義。由于MANET的無線性、多跳性等特點(diǎn),它更容易遭到各種惡意攻擊,從而影響數(shù)據(jù)傳輸可靠性。已有研究提出了多種方法計(jì)算網(wǎng)絡(luò)節(jié)點(diǎn)之間信任度,以達(dá)到節(jié)點(diǎn)間數(shù)據(jù)交互更可靠的目的,但提出的方法大多都沒有全面考慮分布式特性。且由于MANET的高度動(dòng)態(tài)性,使得其路由算法必須較快適應(yīng)頻繁的網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu)變化,且能最大限度節(jié)約網(wǎng)絡(luò)資源。針對(duì)信任度計(jì)算問題,本文提出了一種分布式自適應(yīng)信任度計(jì)算方法(DATEA)。利用節(jié)點(diǎn)間通信數(shù)據(jù)包數(shù)量計(jì)算通信信任,并根據(jù)其值的趨勢(shì)進(jìn)行預(yù)測(cè),結(jié)合歷史值和預(yù)測(cè)值計(jì)算得出的結(jié)果更具有實(shí)時(shí)性;利用節(jié)點(diǎn)剩余能量計(jì)算能量信任;對(duì)于在彼此通信半徑范圍內(nèi)的節(jié)點(diǎn)對(duì),考慮公共鄰居對(duì)目的端的推薦值,并評(píng)估推薦值的推薦可靠性和推薦相似性;提出自適應(yīng)權(quán)值的方法,自適應(yīng)調(diào)整直接信任和推薦信任的比例,計(jì)算出單跳節(jié)點(diǎn)間的綜合直接信任?紤]傳播距離因素,依據(jù)節(jié)點(diǎn)之間直接、推薦信任,計(jì)算出多跳節(jié)點(diǎn)之間的間接信任。實(shí)驗(yàn)仿真表明,本文提出的算法能更有效的避免惡意節(jié)點(diǎn)攻擊,計(jì)算得出節(jié)點(diǎn)之間的直接、間接信任更符合客觀實(shí)際情況。針對(duì)MANET中路由問題,本文研究了最優(yōu)鏈路狀態(tài)路由協(xié)議(Optimized Link State Routing)中的多點(diǎn)中繼技術(shù)(Multi-Point Relay),改進(jìn)傳統(tǒng)量子遺傳算法,并結(jié)合OLSR的特點(diǎn)提出一種新的路由算法QG-OLSR。優(yōu)化MPR集合的選取,克服傳統(tǒng)方法選取MPR集合的不足,并證明了該算法的全局性收斂性和最優(yōu)解的特點(diǎn),提升了路由協(xié)議的傳輸性能。實(shí)驗(yàn)仿真說明了新算法的可行性和適用性,并證明了新算法擁有較好的執(zhí)行性能。
[Abstract]:Trust degree computing and routing in mobile ad hoc network (Mobile Ad Hoc Network,MANET) is an important key technology in this field. Because the traditional central security control strategy is difficult to be applied to distributed networks, some studies have proposed the use of digital signature, authentication technology, key management technology and so on to achieve access control and data confidentiality, non-repudiation, integrity. Real-time verification. Due to the limitation of priority trust, the traditional security mechanism based on verification and access control can not solve the problem of network internal attacks, so it is necessary to use mutual trust cooperation between nodes to detect and separate the illegal nodes. The hierarchical hybrid architecture is established, the cooperative enhancement mechanism based on token, the universal robustness service based on multinomial secret sharing, and the trust value strategy between nodes are used to solve the network internal attacks. This has a very important impact on the efficiency of data transmission in the network, and it is of great significance to improve the efficiency of the routing algorithm under the condition of ensuring the low cost of the network. Because of its non-linearity, multi-hop and other characteristics, MANET is more vulnerable to various malicious attacks, thus affecting the reliability of data transmission. Many methods have been proposed to calculate the trust between network nodes in order to achieve the purpose of more reliable data exchange between nodes, but most of the proposed methods do not take into account the distributed characteristics in an all-round way. Because of the highly dynamic nature of MANET, its routing algorithm must adapt to frequent network topology changes quickly, and can save network resources to the greatest extent. In order to solve the problem of trust degree calculation, a distributed adaptive trust calculation method (DATEA). Is proposed in this paper. The communication trust is calculated by the number of communication packets between nodes, and the results calculated by combining the historical value and the predicted value are more real-time, and the energy trust is calculated by using the residual energy of the node. For the node pairs in the range of communication radius, the recommended value of the public neighbor to the destination is considered, and the recommended reliability and similarity of the recommended value are evaluated. In this paper, an adaptive weight method is proposed, which adaptively adjusts the ratio of direct trust to recommended trust, and calculates the comprehensive direct trust between single hop nodes. Considering the propagation distance factor, the indirect trust between multi-hop nodes is calculated according to the direct and recommended trust between nodes. The experimental results show that the algorithm proposed in this paper can avoid malicious node attacks more effectively, and the direct and indirect trust between nodes is more in line with the objective reality. In order to solve the routing problem in MANET, this paper studies the multi-point relay technology in optimal link-state routing protocol (Optimized Link State Routing) (Multi-Point Relay), improved traditional quantum genetic algorithm), and proposes a new routing algorithm QG-OLSR. according to the characteristics of OLSR. The selection of MPR sets is optimized to overcome the shortcomings of traditional methods in selecting MPR sets, and the global convergence and optimal solution of the algorithm are proved, which improves the transmission performance of routing protocols. The experimental simulation shows the feasibility and applicability of the new algorithm, and proves that the new algorithm has good execution performance.
【學(xué)位授予單位】:天津理工大學(xué)
【學(xué)位級(jí)別】:碩士
【學(xué)位授予年份】:2017
【分類號(hào)】:TN929.5

【相似文獻(xiàn)】

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

1 馬震;面向MAENT的信任度計(jì)算方法與路由協(xié)議研究[D];天津理工大學(xué);2017年

,

本文編號(hào):2494901

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

本文鏈接:http://sikaile.net/kejilunwen/xinxigongchenglunwen/2494901.html


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

版權(quán)申明:資料由用戶c3e61***提供,本站僅收錄摘要或目錄,作者需要?jiǎng)h除請(qǐng)E-mail郵箱bigeng88@qq.com