【摘要】：由于具有自組織、無(wú)中心、節(jié)點(diǎn)資源有限、拓?fù)鋭?dòng)態(tài)變化、無(wú)線(xiàn)信道完全開(kāi)放等特征,Ad-Hoc網(wǎng)絡(luò)容易遭受到各種惡意節(jié)點(diǎn)的攻擊,如不合作、惡意推薦、合謀攻擊等形式。Ad-Hoc網(wǎng)絡(luò)的安全問(wèn)題直接影響了網(wǎng)絡(luò)的健壯性和網(wǎng)絡(luò)壽命。信任模型是解決當(dāng)前Ad-Hoc網(wǎng)絡(luò)安全問(wèn)題的重要方法,而如何能夠精確地描述節(jié)點(diǎn)間的信任關(guān)系則成了任何信任管理模型都要面臨的首要問(wèn)題。本文針對(duì)Ad-Hoc網(wǎng)絡(luò)節(jié)點(diǎn)間信任關(guān)系管理中的兩個(gè)關(guān)鍵環(huán)節(jié)行為監(jiān)視和信任評(píng)估進(jìn)行了研究。 在Ad-Hoc網(wǎng)絡(luò)中節(jié)點(diǎn)通常會(huì)因?yàn)樽陨砀鞣N資源有限,導(dǎo)致其成為自私節(jié)點(diǎn)或惡意策略節(jié)點(diǎn)。如果自組織網(wǎng)絡(luò)中長(zhǎng)期存在大量的自私節(jié)點(diǎn),將嚴(yán)重打擊其他優(yōu)秀節(jié)點(diǎn)提供可靠服務(wù)的積極性,移動(dòng)自組織網(wǎng)絡(luò)最終將難以為繼。而惡意策略節(jié)點(diǎn)有選擇有策略地提供不可靠服務(wù),也會(huì)影響Ad-Hoc網(wǎng)絡(luò)的服務(wù)質(zhì)量。因此,需要設(shè)計(jì)一種有效機(jī)制使移動(dòng)自組網(wǎng)中的節(jié)點(diǎn)積極提供可靠的服務(wù),提高網(wǎng)絡(luò)的業(yè)務(wù)能力是解決問(wèn)題的關(guān)鍵。由于Ad-Hoc網(wǎng)絡(luò)缺乏集中式服務(wù)器,節(jié)點(diǎn)的信任不能由第三方來(lái)計(jì)算。同時(shí)由于網(wǎng)絡(luò)拓?fù)涞淖兓驘o(wú)線(xiàn)沖突的發(fā)生,用于信任評(píng)估的證據(jù)抽樣空間可能會(huì)不完全或不可靠,從而影響信任評(píng)估有效性。因此,針對(duì)以上問(wèn)題,本論文圍繞Ad-Hoc網(wǎng)絡(luò)中的信任評(píng)估模型進(jìn)行研究,主要成果如下： (1)提出在直接信任的更新過(guò)程中,根據(jù)信任向量相似度的大小來(lái)確定加權(quán)系數(shù),利用激勵(lì)機(jī)制來(lái)懲罰惡意節(jié)點(diǎn),獎(jiǎng)勵(lì)忠誠(chéng)節(jié)點(diǎn),做到懲罰力度大于獎(jiǎng)賞力度。該措施可以有效抑制惡意節(jié)點(diǎn)快速提升自己的信任,迫使惡意節(jié)點(diǎn)能夠遵循移動(dòng)自組織網(wǎng)絡(luò)初衷,更好的為其他節(jié)點(diǎn)提供服務(wù)。通過(guò)精確描述節(jié)點(diǎn)間的直接信任關(guān)系,提出了基于相關(guān)度和激勵(lì)機(jī)制的有利于提高網(wǎng)絡(luò)中節(jié)點(diǎn)交易成功率的直接信任合成規(guī)則,用來(lái)增強(qiáng)網(wǎng)絡(luò)的安全性和健壯性。 (2)實(shí)時(shí)監(jiān)測(cè)推薦節(jié)點(diǎn)行為、及時(shí)發(fā)現(xiàn)惡意節(jié)點(diǎn)、為推薦節(jié)點(diǎn)建立信任合成規(guī)則在面對(duì)不安全的網(wǎng)絡(luò)環(huán)境時(shí)可以提高網(wǎng)絡(luò)安全性與魯棒性。針對(duì)在信任推薦過(guò)程中,惡意節(jié)點(diǎn)可能會(huì)發(fā)起誹謗攻擊或共謀攻擊來(lái)提供虛假信任,虛假信任與其他信任之間的證據(jù)沖突導(dǎo)致信任合成與直覺(jué)相悖,產(chǎn)生不合理結(jié)果的問(wèn)題,提出了基于集合的推薦信任過(guò)濾管理機(jī)制來(lái)監(jiān)測(cè)推薦節(jié)點(diǎn)的行為,利用D-S理論中帶有折扣系數(shù)的合成規(guī)則來(lái)解決該問(wèn)題。
[Abstract]:Because of its characteristics of self-organization, no center, limited node resources, dynamic topology change and completely open wireless channel, Ad-Hoc network is vulnerable to various malicious node attacks, such as non-cooperation, malicious recommendation, etc. In the form of collusion attack, the security problem of Ad-Hoc network has a direct impact on the robustness and lifetime of the network. Trust model is an important method to solve the current Ad-Hoc network security problems, and how to accurately describe the trust relationship between nodes has become the most important problem for any trust management model. In this paper, the behavior monitoring and trust evaluation of two key links in the management of trust relationship between Ad-Hoc network nodes are studied. In Ad-Hoc networks, nodes usually become selfish nodes or malicious policy nodes because of their limited resources. If there are a large number of selfish nodes in the Ad Hoc network for a long time, the enthusiasm of other excellent nodes to provide reliable services will be severely dampened, and the mobile ad hoc network will ultimately be difficult to sustain. The malicious policy nodes provide unreliable services selectively and strategically, which will also affect the quality of service of Ad-Hoc networks. Therefore, it is necessary to design an effective mechanism to enable the nodes in Manet to provide reliable services actively, and the key to solve the problem is to improve the service capability of the network. Due to the lack of centralized servers in Ad-Hoc networks, the trust of nodes cannot be calculated by third parties. At the same time, because of the change of network topology or the occurrence of wireless conflict, the evidence sampling space used for trust assessment may be incomplete or unreliable, thus affecting the validity of trust assessment. Therefore, this paper focuses on the trust assessment model in Ad-Hoc networks. The main results are as follows: (1) in the process of direct trust updating, The weighted coefficient is determined according to the similarity of the trust vector, and the incentive mechanism is used to punish the malicious node and reward the loyal node, so that the punishment is greater than the reward. This measure can effectively restrain malicious nodes from rapidly enhancing their trust and force malicious nodes to follow the original intention of mobile ad hoc networks and provide better services to other nodes. By accurately describing the direct trust relationship between nodes, a direct trust composition rule based on correlation and incentive mechanism is proposed to improve the transaction success rate of nodes in the network. It is used to enhance the security and robustness of the network. (2) Real-time monitoring of the behavior of recommendation nodes, timely detection of malicious nodes, Establishing trust composition rules for recommendation nodes can improve network security and robustness in the face of insecure network environment. In the process of trust recommendation, malicious nodes may launch libel attacks or collusion attacks to provide false trust. The conflict of evidence between false trust and other trust results in the combination of trust against intuition and unreasonable results. A recommendation trust filtering management mechanism based on set is proposed to monitor the behavior of recommendation nodes. The synthesis rule with discount coefficients in D-S theory is used to solve this problem.
【學(xué)位授予單位】：北京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類(lèi)號(hào)】：TP393.08;TN929.5

【參考文獻(xiàn)】

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

1 朱峻茂,楊壽保,樊建平,陳明宇;Grid與P2P混合計(jì)算環(huán)境下基于推薦證據(jù)推理的信任模型[J];計(jì)算機(jī)研究與發(fā)展;2005年05期

2 李小青;李暉;楊凱;馬建峰;;一種基于D-S證據(jù)理論的Ad Hoc網(wǎng)絡(luò)安全路由協(xié)議[J];計(jì)算機(jī)研究與發(fā)展;2011年08期

3 林志貴,徐立中,黃鳳辰,王鴻彥;基于D-S理論的多源水質(zhì)監(jiān)測(cè)數(shù)據(jù)融合處理[J];計(jì)算機(jī)工程與應(yīng)用;2004年10期

4 劉志遠(yuǎn);;移動(dòng)自組網(wǎng)環(huán)境下基于推薦的信任模型[J];計(jì)算機(jī)工程與應(yīng)用;2007年11期

5 曹菊英;趙躍龍;;基于DS證據(jù)推理的信息安全風(fēng)險(xiǎn)評(píng)估方法研究[J];計(jì)算機(jī)工程與應(yīng)用;2009年11期

6 洪亮;洪帆;張明猛;余院蘭;;移動(dòng)Ad hoc網(wǎng)絡(luò)中一種信任評(píng)估模型[J];計(jì)算機(jī)科學(xué);2006年07期

7 樊宇;方勇;劉嘉勇;歐曉聰;楊勇;;基于模糊邏輯的Ad Hoc網(wǎng)絡(luò)信任模型研究[J];計(jì)算機(jī)應(yīng)用;2007年09期

8 李景濤;荊一楠;肖曉春;王雪平;張根度;;基于相似度加權(quán)推薦的P2P環(huán)境下的信任模型[J];軟件學(xué)報(bào);2007年01期

9 孫玉星;黃松華;陳力軍;謝立;;基于貝葉斯決策的自組網(wǎng)推薦信任度修正模型(英文)[J];軟件學(xué)報(bào);2009年09期

10 楊凱;馬建峰;楊超;;無(wú)線(xiàn)網(wǎng)狀網(wǎng)中基于D-S證據(jù)理論的可信路由[J];通信學(xué)報(bào);2011年05期

，

本文編號(hào)：2272951