面向MAENT的信任度计算方法与路由协议研究
发布时间：2019-06-07 15:36
【摘要】：移动自组织网络(Mobile Ad Hoc Network,MANET)中信任度计算与路由方法是该领域的重要关键技术。由于传统的中心安全控制策略很难应用于分布式网络中,有研究提出采用数字签名、认证技术、密钥管理技术等,实现接入控制和数据机密性、不可否认性、完整性、实时性验证。由于优先信任的限制,基于验证和访问控制的传统安全机制不能解决网络内部攻击问题,需采用节点间相互信任合作检测并分离出违规节点。建立如分级混合体系结构,采用如基于令牌的合作增强机制、基于多项式机密共享的普遍健壮性服务、基于节点间信任值策略等,来解决网络内部攻击。这对网络中数据传输效率有至关重要的影响,在保证网络成本较低的情况下,提高路由算法的效率有着重要的意义。由于MANET的无线性、多跳性等特点,它更容易遭到各种恶意攻击,从而影响数据传输可靠性。已有研究提出了多种方法计算网络节点之间信任度,以达到节点间数据交互更可靠的目的,但提出的方法大多都没有全面考虑分布式特性。且由于MANET的高度动态性,使得其路由算法必须较快适应频繁的网络拓扑结构变化,且能最大限度节约网络资源。针对信任度计算问题,本文提出了一种分布式自适应信任度计算方法(DATEA)。利用节点间通信数据包数量计算通信信任,并根据其值的趋势进行预测,结合历史值和预测值计算得出的结果更具有实时性;利用节点剩余能量计算能量信任;对于在彼此通信半径范围内的节点对,考虑公共邻居对目的端的推荐值,并评估推荐值的推荐可靠性和推荐相似性;提出自适应权值的方法,自适应调整直接信任和推荐信任的比例,计算出单跳节点间的综合直接信任。考虑传播距离因素,依据节点之间直接、推荐信任,计算出多跳节点之间的间接信任。实验仿真表明,本文提出的算法能更有效的避免恶意节点攻击,计算得出节点之间的直接、间接信任更符合客观实际情况。针对MANET中路由问题,本文研究了最优链路状态路由协议(Optimized Link State Routing)中的多点中继技术(Multi-Point Relay),改进传统量子遗传算法,并结合OLSR的特点提出一种新的路由算法QG-OLSR。优化MPR集合的选取,克服传统方法选取MPR集合的不足,并证明了该算法的全局性收敛性和最优解的特点,提升了路由协议的传输性能。实验仿真说明了新算法的可行性和适用性,并证明了新算法拥有较好的执行性能。
[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.
【学位授予单位】：天津理工大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TN929.5
本文编号：2494901
[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.
【学位授予单位】：天津理工大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TN929.5
【相似文献】
相关硕士学位论文 前1条
1 马震;面向MAENT的信任度计算方法与路由协议研究[D];天津理工大学;2017年
，本文编号：2494901
本文链接：https://www.wllwen.com/kejilunwen/xinxigongchenglunwen/2494901.html
