Method for construction of network trust topology based on reliable loop

Abstract

The invention discloses a method for construction of a network trust topology based on a reliable loop. In the method, a reliable triangular loop is constructed for each node in a network, the whole reliable triangular loop is viewed as a node of a larger reliable triangular loop, a reliable triangular loop of a largest scale is recursively constructed and is connected with a node set which is not communicated to generate a reliable topology, and a routing protocol can run on the topological structure. The invention can be used for finding an appropriate reliable path, thereby inhibiting the packet loss rate, improving the forward rate, enlarging the network throughput, and effectively resisting against various attacks. More importantly, the invention can be independent of the specific routing algorithm, and has high scalability and portability.

Description

technical field [0001] The invention relates to the technical field of computer networks, in particular to a trust loop-based network trust topology construction method. Background technique [0002] The Ad hoc routing protocol is not absolutely safe, and its routing algorithm is based on the assumption that all nodes cooperate with each other to complete the transmission of network data. However, due to their limited energy, nodes in wireless ad hoc networks are inevitably selfish, and may stop forwarding data in order to save their own resources, resulting in increased packet loss rates and reduced network performance; and the routing information in the network It may be used by attackers to distribute false routing information or a large number of useless data packets, thereby causing the collapse of this limited resource network. Based on the above problems, many trust mechanisms have been introduced into the ad-hoc network, but these methods are all aimed at specific r...

AI Technical Summary

Problems solved by technology

However, due to their limited energy, nodes in wireless ad hoc networks are inevitably selfish, and may stop forwarding data in order to save their own resources, resulting in increased packet loss rates and reduced network performance; and the routing information in the network It may be used by attackers to distribute false routing information or a large number of useless data packets, thereby causing the collapse of this limited resource network

Based on the above problems, many trust mechanisms have been introduced into the ad-hoc network, but these methods are all aimed at specific routing protocols, and certain rules are set in the specific protocol to calculate the trust value and determine the route between the source node and the destination node. Whether the path is trustworthy or not, the routing algorithm is not only responsible for routing selection, but also responsible for trust calculation. This type of trusted routing method needs to consider the specific routing protocol in the network, and modify it according to the routing protocol, which leads to the inconsistency of the trusted routing method. Flexibility and poor scalability, and the routing protocol needs to be responsible for the selection and calculation of trust, which will also reduce the efficiency of the routing method to a certain extent

Images