A fault-tolerant routing anonymous publishing method for heterogeneous systems integrating human, machine and objects

Abstract

The present invention discloses a method for anonymously publishing fault-tolerant routing in a heterogeneous system of human-machine-object fusion, which includes the following steps: 1) establishing a routing topology structure of a heterogeneous system of human-machine-object fusion; 2) constructing a hierarchical fault-tolerant routing topology design protocol; 3) analyzing three types of attack models for routing publication; 4) proposing an anonymous publication strategy; 5) availability measurement; 6) anonymity measurement. The present invention constructs a hierarchical fault-tolerant routing protocol through dual independent spanning trees and Hamiltonian cycles, and on this basis, innovatively designs a graph segmentation technology to segment the fault-tolerant routing according to different vertical and horizontal dimensions, and combines them to form vertical anonymous paths and horizontal anonymous paths, so as to realize anonymous publication of fault-tolerant routing.

Description

Technical Field

[0001] The present invention relates to the field of anonymous routing publication, and in particular to a fault-tolerant anonymous routing publication method for a human-machine-object fusion heterogeneous system. Background Art

[0002] Human-machine-object fusion networks are heterogeneous networks composed of human, machine, and object sensing devices. Heterogeneous human-machine-object fusion systems have diverse characteristics, such as diverse platform environments, heterogeneous networks, and increased communication traffic. Anonymous route publishing can reduce the risk of sensitive information leakage and enhance the inherent security of routes. Therefore, research on anonymous route publishing for fault-tolerant human-machine-object fusion heterogeneous systems is extremely important and urgent. Wang Xiao et al. proposed a core algorithm for anonymous communication in the Tor network by constructing a node declaration graph and introducing general graph theory algorithms. Zhou Yanwei et al. proposed a highly anonymous coded anonymous communication system. The coded transmission mechanism of forwarding network nodes improves the system's anonymity, security, and confidentiality while enhancing its resistance to collusion attacks.

[0003] With the rapid development of anonymous network communication system design, effective evaluation of anonymous systems is crucial. Research on anonymous network communication systems continues to improve deployment costs, routing performance, congestion control, scalability, and security. Currently, research on fault-tolerant anonymous routing publication technologies for heterogeneous human-machine-object fusion systems is insufficient. Current research focuses primarily on protecting the identities of the source and destination nodes of a route, but lacks sufficient attention to the identity privacy calculation of intermediate nodes during the route publication process, making it difficult to adapt to different levels of security requirements. Existing anonymous routing schemes primarily focus on protecting the privacy of a single path, with less research on fault-tolerant routing protection. Current anonymous network communication systems primarily focus on node location privacy and identity privacy, with little consideration given to path tracing and alternative path tracing, resulting in a low level of anonymity. Existing methods generally suffer from low computational efficiency and high processing overhead for anonymous routing publication, resulting in low usability and low privacy protection. Summary of the Invention

[0004] The purpose of the present invention is to provide a fault-tolerant routing anonymous publishing method for a human-machine-object fusion heterogeneous system.

[0005] The technical solution adopted in the present invention is:

[0006] A method for anonymously publishing fault-tolerant routing in a human-machine-object fusion heterogeneous system, comprising the following steps:

[0007] Step 1: Establish a routing topology for a heterogeneous system integrating human, machine, and objects. The routing topology for a heterogeneous system integrating human, machine, and objects includes a social layer, a network layer, and a physical layer. The social layer consists of individuals; the network layer consists of devices, sensors, servers, switches, and base stations; and the physical layer consists of physical objects. Each device belongs to a person in the social layer, and each sensor corresponds to a physical object in the physical layer. Devices and sensors are connected through servers, switches, and base stations.

[0008] Step 2: Construct a hierarchical fault-tolerant routing topology design protocol. The specific steps are as follows:

[0009] Step 2-1, assume that T1 and T2 are two dual independent spanning trees in the network G = (V(G), E(G)), and let the destination node be d;

[0010] Step 2-2, select two node subsets L1 and L2 from the network G, L1 = {v∈V(G)|v is a leaf node in T1 but not a leaf node in T2} and L2 = {v∈V(G)|v is a leaf node in T2};

[0011] Step 2-3, for any i∈{1,2}, set T i Skeleton Defined as T i A subtree of T i The node subset L is deleted from i A subtree obtained by combining all the nodes in

[0012] Step 2-4, build a bridge connecting the two skeletons; assuming d belongs to (i.e., d∈L2), B is the only edge in T2 connected to d;

[0013] Step 2-5, configure fault-tolerant routing R d =(V(G),E d ); the node set of fault-tolerant routing is V(G), and the edge set is The sum of the edge sets of B and B, all paths configured with fault-tolerant routing point to the destination node d;

[0014] Step 2-6, a heuristic algorithm based on Hamiltonian cycles is used to find fault-tolerant routing in the physical layer;

[0015] Step 3: Construct three attack models targeting route announcements: path tracing attack, alternative path tracing attack, and neighbor structure attack. When the adversary simultaneously attacks the primary and alternative path nodes, the communication of the human-machine-object fusion heterogeneous system will be paralyzed.

[0016] Step 4: Set the fault-tolerant routing topology R d =(V(G),E d) Along the destination node to each node, the nodes are divided into layers according to the number of hops; the nodes in each layer are regarded as an anonymous community, and each anonymous community is perfectly matched and connected with the corresponding anonymous community in the previous layer;

[0017] Step 5: After all nodes are split and connected, the anonymous communities are connected in order of hop count, where the tth anonymous community is connected to the t-1th anonymous community and the t+1th anonymous community, forming a vertical anonymous fault-tolerant route formed by vertical segmentation;

[0018] Step 6: Set the fault-tolerant routing topology R d =(V(G),E d ) is transformed into a tree structure with the destination node d as the parent node, and each child node is the parent node of the subtree, and each subtree is d1, d2, ..., d m ;

[0019] Step 7: Treat each subtree as an anonymous community and name them the first community, the second community, ..., the mth community in descending order according to the size of the subtree label.

[0020] Step 8: Connect each anonymous community in sequence, where the sth community can only connect to the s-1th community and the s+1th community, forming a horizontal anonymous fault-tolerant route formed by horizontal segmentation;

[0021] Step 9: Anonymously publish the fault-tolerant routing topology as vertical anonymous fault-tolerant routing and horizontal anonymous fault-tolerant routing;

[0022] Step 10: Use graph splicing technology to verify the availability of the fault-tolerant path, that is, measure the availability of privacy computing by characterizing the success rate of data packets sent along the fault-tolerant route.

[0023] Furthermore, the steps for constructing the social layer in step 1 are as follows:

[0024] 1-2-1, model the social layer as a (k, n)-dimensional hypercube Q k,n ;

[0025] 1-2-2, assuming that there are k key features in the social layer, each key feature has n different values, and 0, 1, ..., n-1 are used to represent these n different values;

[0026] 1-2-3, for each individual u, use u1u2…u k Represents, which corresponds to the values ​​of k different key features respectively;

[0027] 1-2-4, the number of features with different values ​​between two bodies is defined as the feature distance between the two bodies; if the feature distance between two bodies u and v is 1, then there is a connection relationship between them, and a topological edge is used to connect u and v.

[0028] Furthermore, the steps for constructing the network layer in step 1 are as follows:

[0029] 1-3-1, a recursive method is used to model the network layer as a data center network BCube(n,k), where n represents the number of switch ports and k represents the dimension of the data center. Assuming that each individual has a total of n-1 devices or physical objects, then each individual corresponds to a total of n-1 devices or sensors in the network layer.

[0030] 1-3-2, using BCube(n,0) as the basic structure corresponding to each individual, it includes the device and sensor corresponding to the individual, as well as a server and an n-port switch; the device, sensor, and server are called basic nodes, and the switch is called a level 0 switch; in BCube(n,0), the switch connects each device and each sensor, and also connects to the server;

[0031] 1-3-3, because there are n k Individual representatives, so there are also n in the network layer k BCube(n,0); let BCube(n,k) be composed of n BCube(n,k-1) and n k The BCubes are numbered from 0 to n-1, while the k-level switches are numbered from 0 to n. k -1 label; in each BCube(n,k-1), devices and sensors use 0 to n k -2 label, and the server uses n k -1 label;

[0032] 1-3-4, each device, sensor and server has k+1 ports, labeled 0-k; port k of the i-th basic node in the j-th BCube(n,k-1) is connected to the j-th port of the i-th k-level switch.

[0033] Furthermore, the steps for constructing the physical layer in step 1 are as follows:

[0034] 1-4-1, model the physical layer as a multi-domain topology graph G(P, IntraL, D);

[0035] 1-4-2, the physical objects in the physical layer constitute the node set P, and the internal links form the edge set IntraL;

[0036] 1-4-3, suppose there are d domains in the physical layer. For the i-th domain, let D i =D i (P i ,IntraL i ) is its topology, where the node set is P i , consisting of the physical objects of the i-th domain, and the edge set is IntraL i , which is composed of the internal links of the i-th domain. Let D be the multi-domain topology set, that is, D={D i (P i , IntraL i )|1≤i≤D}.

[0037] Furthermore, the specific method of step 3 is:

[0038] Step 3-1, assuming the original main path P s,d s(=v1)→v2→…→v i →…→v n-1 →d(=v n ), and let the candidate node set of each intermediate node be AS s,d ={v'2,...,v' i ,...,v' n-1};

[0039] Step 3-2, path tracing attack: The adversary attempts to discover the communication link v i →v i+1 (1≤i≤n-1) so as to track P as much as possible s,d ; When node v i If the attack is successful, the adversary will find the next hop node v i+1 ;

[0040] Step 3-3, alternative path tracing attack: The adversary attempts to discover alternative communication links v i →v' i+1 (1≤i≤n-1) so as to track AS as much as possible s,d ; When node v i If the attack is successful, the adversary will find the next hop node v' i+1 ;

[0041] Step 3-4, neighbor structure attack: The adversary knows the structural characteristics of the previous-hop neighbors and next-hop neighbors of a node in advance, and then the adversary will attack this specific node based on this background knowledge.

[0042] Furthermore, the specific method of hierarchical segmentation in step 4 is:

[0043] Step 4-1, the fault-tolerant routing topology R d =(V(G),Ed ) From the destination node to each node, perform hierarchical segmentation according to the number of hops, let the destination node d be the first layer, and regard the first layer as the first anonymous community on the anonymous fault-tolerant route;

[0044] Step 4-2, the fault-tolerant routing topology R d =(V(G),E d ) in the neighbor node v connected to d i1 (d,1) is divided into the second layer, and the second layer is regarded as the second anonymous community on the anonymous fault-tolerant routing, and the second anonymous community is perfectly matched with the first anonymous community;

[0045] Step 4-3, the fault-tolerant routing topology R d =(V(G),E d ) and v i1 (d,1) connected neighbor node v i1i2 (d,2) is divided into the third layer, and the third layer is regarded as the third anonymous community on the anonymous fault-tolerant routing. At the same time, the third anonymous community is perfectly matched with the second anonymous community;

[0046] Step 4-4, and so on;

[0047] Step 4-5, the fault-tolerant routing topology R d =(V(G),E d ) and v i1 (d,t) connected neighbor node v i1 i2...it it+1 (d, t+1) is divided into the t+1th layer and regarded as the t+1th anonymous community on the anonymous fault-tolerant routing. At the same time, the t+1th anonymous community is perfectly matched with the tth anonymous community.

[0048] Furthermore, the specific steps of step 10 are:

[0049] Step 10-1, arbitrarily select a node v of an anonymous community t on the vertical anonymous fault-tolerant routing i1 i2...it (d,t) is the source node, according to the fault-tolerant anonymous routing connection principle, node v i1 i2...it (d, t) moves forward along the vertical anonymous fault-tolerant route to find its neighbors;

[0050] Step 10-2: If there is only one neighbor v in the t-1th anonymous community i1 i2...it-1 (d,t-1), then the data packet passes through the node

[0051] v i1 i2...it (d,t) to node v i1 i2...it-1 (d, t-1) Send information;

[0052] Step 10-3: If there are multiple neighbors in the t-1th anonymous community, compare the nodes v on the horizontal anonymous fault-tolerant routing. i1 i2...it (d, t) is located in the anonymous community, and check the neighbor v' on this horizontal anonymous community i1 i2...it-1 (d,t-1), then the data packet passes through node v i1 i2...it (d,t) to node v' i1 i2...it-1 (d, t-1) Send information;

[0053] Step 10-4, and so on to obtain the i1 i2...it (d, t) to the destination node d, and verify whether it is a fault-tolerant routing topology R d =(V(G),E d ) on the path;

[0054] Step 10-5, define the availability of the fault-tolerant anonymous routing algorithm: Let P be the path from s to d, and the nodes on the path are v0 = s, v1, v2, ..., v t-1 ,v t =d; for node v i , 0≤i≤t-1, let the set of all its neighbors be Nv i , through the published vertical anonymous community, v i The vertical community where you are located, thus obtaining v i The next hop node v i+1 Vertical community Ω 1,i+1 ; Through the published horizontal anonymous community, v i The horizontal community where you are located, thus obtaining v i The next hop node v i+1 Horizontal community Ω 2,i+1 According to v i+1 The vertical and horizontal communities and v i Neighbor set Nv i , which can reduce v i+1 The selection range is defined as v i The availability is:

[0055] UG i =1 / |Nv i ∩Ω 1,i+1 ∩Ω 2,i+1 |;

[0056] In step 10-6, for the entire path P, its availability is defined as the product of the availability of all nodes on the path except the target node, that is:

[0057]

[0058] Furthermore, it also includes an anonymity measurement step, the specific method is:

[0059] Step 11-1: For a given node u, locate the community where u is located through the published vertical anonymous community, and thus obtain the vertical community Ω where the node v is located 1，v ;

[0060] Suppose the community contains |Ω 1，v | nodes; locate u through the published horizontal anonymous community, and thus obtain the horizontal community where v is located

[0061] Ω 2，v ;

[0062] Suppose the community contains |Ω 2，v | nodes; narrow down the selection range of v to

[0063] Ω v =Ω 1，v ∩Ω 2，v ;

[0064] Suppose the community contains |Ω v | nodes, then the anonymity of v is defined as:

[0065]

[0066] Step 11-2, let P be the path from node s to node d, and the nodes on the path are v0 = s, v1, v2, ..., v t-1 , v t =d; for node v i , 1≤i≤t-1, set its anonymity to NA i ,When obtaining the privacy information of the entire path through vertical anonymous fault-tolerant routing and horizontal anonymous fault-tolerant routing, it is necessary to start from the source node and obtain the privacy information of each node on the path hop by hop. Therefore, the anonymity of path P is defined as:

[0067]

[0068] The present invention utilizes the above technical solution. When fault-tolerant routes are published, an adversary attempting to maliciously attack intermediate nodes and alternative nodes to trace the primary and alternative paths will result in the disclosure of the communication path. Furthermore, an adversary attempting to exploit the structural characteristics of its previous and next-hop neighbors could compromise the identity of a specific node. This proposed anonymous publication scheme for fault-tolerant routes, based on graph partitioning and graph splicing techniques, constructs a hierarchical fault-tolerant routing protocol using dual independent spanning trees and Hamiltonian cycles. Furthermore, the proposed scheme innovatively employs graph partitioning to partition fault-tolerant routes along different vertical and horizontal dimensions, combining them to form vertical anonymous paths and horizontal anonymous paths, enabling anonymous publication of fault-tolerant routes. Furthermore, this paper proposes a graph splicing technique to measure the availability and anonymity of anonymous publication of fault-tolerant routes. The present invention achieves the following significant benefits: 1. Node availability of this anonymous publication scheme exceeds 99.6%; 2. Path availability of this anonymous publication scheme exceeds 96%; 3. Node anonymity of this anonymous publication scheme exceeds 91%; and 4. Path anonymity of this anonymous publication scheme exceeds 96.5%. BRIEF DESCRIPTION OF THE DRAWINGS

[0069] The present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments;

[0070] Figure 1 This is a flow chart of a method for anonymously publishing fault-tolerant routing in a heterogeneous system integrating human, machine and objects according to the present invention;

[0071] Figure 2 A schematic diagram of fault-tolerant routing based on Hamiltonian cycles of a fault-tolerant routing anonymous publishing method for a human-machine-object fusion heterogeneous system according to the present invention;

[0072] Figure 3 A schematic diagram of a fault-tolerant routing topology attack model for a method for anonymously publishing fault-tolerant routing in a heterogeneous system integrating human, machine, and objects according to the present invention;

[0073] Figure 4 This is an original fault-tolerant routing diagram of a method for anonymously publishing fault-tolerant routing in a heterogeneous system integrating human, machine, and objects according to the present invention;

[0074] Figure 5 A vertical anonymous routing diagram of a fault-tolerant routing anonymous publishing method for a human-machine-object fusion heterogeneous system according to the present invention;

[0075] Figure 6 This is a horizontal anonymous routing diagram of a fault-tolerant routing anonymous publishing method for a human-machine-object fusion heterogeneous system according to the present invention. DETAILED DESCRIPTION

[0076] In order to make the purpose, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application.

[0077] With the continuous development and widespread application of information technology, the deep integration of human society (people), information space (machines), and the physical world (objects) has become a trend. Intelligent technology enables intelligent interconnection between people, machines, and objects. The resulting heterogeneous system of human-machine-object integration is an indispensable and important part of the information society and human life.

[0078] The routing structure of a heterogeneous system integrating human, machine, and objects consists of a social layer, a network layer, and a physical layer. The social layer, which is composed of individuals, constructs the network layer. The network layer is composed of devices, sensors, servers, switches, and base stations. The physical layer is composed of physical objects. Each device belongs to certain individuals in the social layer, while each sensor corresponds to certain physical objects in the physical layer. Devices and sensors are connected through servers, switches, and base stations, forming the routing topology of a heterogeneous system integrating machine and objects.

[0079] The present invention proposes a method for anonymously publishing fault-tolerant routes in a heterogeneous system that integrates humans, machines, and objects. When a fault-tolerant route is published, an adversary attempts to maliciously attack intermediate nodes and alternative nodes to track the main path and alternative paths, which will lead to the leakage of the communication path. In addition, the adversary attempts to attack the identity of a specific node based on the structural characteristics of the previous hop and next hop neighbors that it has mastered. The present invention proposes an anonymous publishing scheme for fault-tolerant routes based on graph partitioning technology and graph splicing technology. It constructs a hierarchical fault-tolerant routing protocol through dual independent spanning trees and Hamiltonian cycles, and on this basis, innovatively designs graph partitioning technology to split the fault-tolerant routes according to different vertical and horizontal dimensions, and combine them to form vertical anonymous paths and horizontal anonymous paths to achieve anonymous publishing of fault-tolerant routes. At the same time, this paper proposes graph splicing technology and uses it to measure the availability and anonymity of anonymous publishing of fault-tolerant routes.

[0080] like Figures 1 to 6 As shown, the present invention discloses a method for anonymously publishing fault-tolerant routing in a human-machine-object fusion heterogeneous system, which includes the following steps:

[0081] 1) Establishing a routing topology structure for a heterogeneous system integrating human, machine and objects;

[0082] Furthermore, the specific method of step 1 is:

[0083] 1-1, Routing topology of heterogeneous systems integrating human, machine and objects. The topology structure includes social layer, network layer and physical layer;

[0084] 1-2, construct the social layer. The social layer is composed of individuals, and the specific symbolic expression of each of them is as follows:

[0085] 1-2-1, model the social layer as a (k, n)-dimensional hypercube Q k,n ;

[0086] 1-2-2. In a social layer, each individual has its own internal social characteristics, which can be represented by high-dimensional features. However, typically, only a small number of features are important in a social layer. These features are called key features, and data mining methods are used to extract them. Suppose there are k key features in a social layer, and each key feature has n different values. For simplicity, use 0, 1, ..., n-1 to represent these n different values.

[0087] 1-2-3, for each individual u, use u1u2…u k Represents, which corresponds to the values ​​of k different key features respectively;

[0088] 1-2-4, the number of features with different values ​​between two bodies is defined as the feature distance between the two bodies. If the feature distance between two bodies u and v is 1, then there is a connection between them, and a topological edge is used to connect u and v;

[0089] 1-3, construct the network layer. The network layer is composed of devices, sensors, servers, switches, and base stations. The specific symbolic representation of each is as follows:

[0090] 1-3-1, using a recursive method, the network layer is modeled as a data center network BCube(n,k), where n represents the number of switch ports and k represents the dimension of the data center. Assuming that each individual has a total of n-1 devices or physical objects, then each individual corresponds to a total of n-1 devices or sensors in the network layer;

[0091] In 1-3-2, we use BCube(n,0) as the basic structure corresponding to each individual. It includes the device and sensor corresponding to the individual, as well as a server and an n-port switch. The device, sensor, and server are called basic nodes, and the switch is called a level 0 switch. In BCube(n,0), the switch connects each device and each sensor, as well as the server.

[0092] 1-3-3, because there are n k Individual representatives, so there are also n in the network layer k BCube(n,0). Let BCube(n,k) be composed of n BCube(n,k-1) and n k The n BCubes (n, k-1) are numbered from 0 to n-1, while the k-level switches are numbered from 0 to n. k-1 index. In each BCube(n,k-1), devices and sensors use 0 to n k -2 label, and the server uses n k -1 label;

[0093] 1-3-4, each device, sensor, and server has k+1 ports, labeled 0-k. Port k of the i-th basic node in the j-th BCube (n, k-1) is connected to the j-th port of the i-th k-level switch;

[0094] 1-4, construct the physical layer, which is composed of physical objects;

[0095] 1-4-1, model the physical layer as a multi-domain topology graph G(P, IntraL, D);

[0096] 1-4-2, the physical objects in the physical layer constitute the node set P, and the internal links form the edge set IntraL.

[0097] 1-4-3, suppose there are d domains in the physical layer. For the i-th domain, let D i =D i (P i ,IntraL i ) is its topology, where the node set is P i , consisting of the physical objects of the i-th domain, and the edge set is IntraL i , which is composed of the internal links of the i-th domain. Let D be the multi-domain topology set, that is, D={D i (P i , IntraL i )|1≤i≤D};

[0098] 1-5, each device belongs to some individual in the social layer, and each sensor corresponds to some physical object in the physical layer, and the devices and sensors are connected through servers, switches and base stations;

[0099] 2) Construct a hierarchical fault-tolerant routing topology design protocol;

[0100] Furthermore, the specific method of step 2 is:

[0101] 2-1, assume that T1 and T2 are two dual independent spanning trees in the network G = (V(G), E(G)), and let the destination node be d;

[0102] 2-2, select two node subsets L1 and L2 from G, L1 = {v∈V(G)|v is a leaf node in T1 but not a leaf node in T2} and L2 = {v∈V(G)|v is a leaf node in T2};

[0103] 2-3, for any i∈{1,2}, set T i Skeleton Defined as T i A subtree of T i L was deleted from i A subtree obtained by combining all the nodes in

[0104] 2-4, build a bridge connecting the two skeletons. Assume that d belongs to (i.e., d∈L2). Let B be the only edge in T2 connected to d;

[0105] 2-5, Configure fault-tolerant routing R d =(V(G),E d ). The node set of fault-tolerant routing is V(G), and the edge set is and the sum of the edge sets of B, so that all paths configured for fault-tolerant routing point to the destination node d;

[0106] 2-6, such as Figure 2 As shown, a heuristic algorithm based on Hamiltonian cycles is used to find fault-tolerant routing in the physical layer;

[0107] 2-6-1, input network G = Hamiltonian cycle (V(G), E(G));

[0108] 2-6-2, based on the physical topology, the local Hamiltonian of each single domain is obtained, and based on the virtual topology, the global Hamiltonian of multiple domains is obtained;

[0109] 2-6-3, if the source node s and the destination node d belong to the same domain, then the intra-domain routing process is executed, otherwise the inter-domain routing process is executed;

[0110] 2-6-4, return Rd = (V(G), Ea);

[0111] 3) If Figure 3 As shown, we analyze three types of attack models targeting route announcements.

[0112] Furthermore, the specific method of step 3 is:

[0113] 3-1, assuming the original main path P s,d s(=v1)→v2→…→v i →…→v n-1 →d(=v n ), and let the candidate node set of each intermediate node be AS s,d ={v'2,...,v' i ,...,v' n-1};

[0114] 3-2, Path tracing attack: The adversary attempts to discover the communication link vi →v i+1 (1≤i≤n-1) so as to track P as much as possible s,d If v i If the attack is successful, the adversary may find the next hop node v i+1 ;

[0115] 3-3, Alternative path tracing attack: The adversary attempts to discover alternative communication links v i →v' i+1 (1≤i≤n-1) so as to track AS as much as possible s,d If node v i If the attack is successful, the adversary may find the next hop node v' i+1 ;

[0116] 3-4, Neighborhood structure attack: The adversary knows the structural characteristics of a node's previous-hop neighbors and next-hop neighbors in advance, and then attacks this specific node based on this background knowledge;

[0117] 3-4-1, Figure 3 In the example, the adversary has the background knowledge of the two next-hop neighbors of node 13 (one of them is the next-hop neighbor and the other is the alternative next-hop neighbor). If the adversary directly publishes the fault-tolerant routing information, the adversary can directly and successfully attack node 13.

[0118] 3-4-2 The adversary can successfully attack nodes 5 and 12 based on the published fault-tolerant routing information, which also causes node 13 to be unable to send data packets to the destination node 0;

[0119] 4) If Figures 4-6 ,proposed an anonymous publishing strategy;

[0120] Furthermore, the specific method of step 4 is:

[0121] 4-1, using graph partitioning technology and graph splicing technology to protect fault-tolerant routing. d =(V(G),E d ) From the destination node to each node, perform hierarchical segmentation according to the number of hops, let the destination node d be the first layer, and regard the first layer as the first anonymous community on the anonymous fault-tolerant route;

[0122] 4-2, the fault-tolerant routing topology R d =(V(G),E d ) in the neighbor node v connected to d i1 (d,1) is split into the second layer, and the second layer is used as the second anonymous community on the anonymous fault-tolerant routing. At the same time, the second anonymous community is perfectly matched with the first anonymous community.

[0123] 4-3, the fault-tolerant routing topology R d =(V(G),E d ) and v i1 (d,1) connected neighbor node v i1i2 (d,2) is divided into the third layer, and the third layer is regarded as the third anonymous community on the anonymous fault-tolerant routing. At the same time, the third anonymous community is perfectly matched with the second anonymous community;

[0124] 4-4, and so on;

[0125] 4-5, the fault-tolerant routing topology R d =(V(G),E d ) and v i1 (d,t) connected neighbor node v i1 i2...it it+1 (d, t+1) is divided into the t+1th layer and regarded as the t+1th anonymous community on the anonymous fault-tolerant routing. At the same time, the t+1th anonymous community is perfectly matched with the tth anonymous community.

[0126] 4-6, after all nodes are split and connected, the anonymous communities are connected in order of hop count, where the tth anonymous community is connected to the t-1th anonymous community and the t+1th anonymous community, forming a vertical anonymous fault-tolerant route formed by vertical segmentation;

[0127] 4-7, the fault-tolerant routing topology R d =(V(G),E d ) is transformed into a tree structure with the destination node d as the parent node, and each child node is the parent node of the subtree, and each subtree is d1, d2, ..., d m ;

[0128] 4-8, each subtree is regarded as an anonymous community, and named the first community, the second community, ..., the mth community in descending order according to the size of the subtree label;

[0129] 4-9, connect these anonymous communities in order, where the sth community can only be connected to the s-1th community and the s+1th community, forming a horizontal anonymous fault-tolerant route formed by horizontal segmentation;

[0130] 4-10, anonymously publish the fault-tolerant routing topology as vertical anonymous fault-tolerant routing and horizontal anonymous fault-tolerant routing;

[0131] 5) Usability metrics;

[0132] Furthermore, the specific method of step 5 is:

[0133] 5-1. Use graph splicing technology to verify the availability of fault-tolerant paths. That is, measure the availability of privacy computing by characterizing the success rate of data packets along the fault-tolerant routes.

[0134] 5-2, arbitrarily select a node v of an anonymous community (assuming it is the tth anonymous community) on the vertical anonymous fault-tolerant routing i1 i2...it (d,t) is the source node, according to the fault-tolerant anonymous routing connection principle, node v i1 i2...it (d, t) moves forward along the vertical anonymous fault-tolerant route (i.e., in the direction of smaller numbers) to find its neighbors;

[0135] 5-3, if there is only one neighbor v in the t-1th anonymous community i1 i2...it-1 (d,t-1), then the data packet passes through node v i1 i2...it (d,t) to node v i1 i2...it-1 (d, t-1) Send information;

[0136] 5-4, if there are multiple neighbors in the t-1th anonymous community, it is necessary to compare the node v on the horizontal anonymous fault-tolerant routing i1 i2...it (d, t) is located in the anonymous community, and check the neighbor v' on this horizontal anonymous community i1 i2...it-1 (d,t-1), then the data packet passes through node v i1 i2...it (d,t) to node v' i1 i2...it-1 (d, t-1) Send information;

[0137] 5-5, and so on;

[0138] 5-6, we can get the value from source node v i1 i2...it (d, t) to the destination node d, and verify whether it is a fault-tolerant routing topology R d =(V(G),E d ) on the path;

[0139] 5-7, define the availability of the fault-tolerant anonymous routing algorithm: Let P be the path from node s to node d, and the nodes on the path are v0 = s, v1, v2, ..., v t-1 ,v t =d. For node v i , 0≤i≤t-1, let the set of all its neighbors be Nv i , through the published vertical anonymous community, node v can be located i The vertical community where you are located, thus obtaining v i The next hop node v i+1 Vertical community Ω 1,i+1 ; Through the published horizontal anonymous community, v i The horizontal community where you are located, thus obtaining vi The next hop node v i+1 Horizontal community Ω 2,i+1 According to v i+1 The vertical and horizontal communities and v i Neighbor set Nv i , which can reduce v i+1 The selection range is defined as v i The availability is:

[0140] UG i =1 / |Nv i ∩Ω 1,i+1 ∩Ω 2,i+1 |;

[0141] 5-8, for the entire path P, its availability is defined as the product of the availability of all nodes on the path except the target node, that is:

[0142]

[0143] 6) Anonymity measurement; the specific method of step 6 is:

[0144] 6-1, for a given node u, through the published vertical anonymous community, we can locate the community where u is located, and thus obtain the vertical community Ω where node v is located 1，v , suppose the community contains |Ω 1，v | nodes; through the published horizontal anonymous community, u can be located, thereby obtaining the horizontal community Ω where v is located 2，v , suppose the community contains |Ω 2，v | nodes; based on the vertical and horizontal communities where v is located, the selection range of v can be narrowed down to Ω v =Ω 1，v ∩Ω 2，v , suppose the community contains |Ω v | nodes, then the anonymity of v is defined as:

[0145]

[0146] 6-2, let P be the path from node s to node d, and the nodes on the path are v0 = s, v1, v2, ..., v t-1 , v t =d. For node v i , 1≤i≤t-1, set its anonymity to NA i ,When obtaining the privacy information of the entire path through vertical anonymous fault-tolerant routing and horizontal anonymous fault-tolerant routing, it is necessary to start from the source node and obtain the privacy information of each node on the path hop by hop. Therefore, the anonymity of path P is defined as:

[0147]

[0148] The present invention adopts the above technical solution, as Figure 3 As shown in , when fault-tolerant routing is published, the adversary attempts to maliciously attack intermediate nodes and alternative nodes to track the main path and alternative paths, which will lead to the leakage of communication paths. In addition, the adversary attempts to attack the identity of a specific node based on the structural characteristics of the previous hop and next hop neighbors that it has mastered. Figure 2 、 Figures 4-6 As shown, the present invention proposes a fault-tolerant routing anonymous release scheme based on graph partitioning technology and graph splicing technology. It constructs a hierarchical fault-tolerant routing protocol through dual independent spanning trees and Hamiltonian cycles. On this basis, it innovatively designs graph partitioning technology to split the fault-tolerant routing according to different vertical and horizontal dimensions, and combines them to form vertical anonymous paths and horizontal anonymous paths to achieve anonymous release of fault-tolerant routing. At the same time, this paper proposes graph splicing technology and uses it to measure the availability and anonymity of the anonymous release of fault-tolerant routing. The effective effects of the present invention are: 1. The node availability of this fault-tolerant routing anonymous release scheme exceeds 99.6%; 2. The path availability of this fault-tolerant routing anonymous release scheme exceeds 96%; 3. The node anonymity of this fault-tolerant routing anonymous release scheme exceeds 91%; 4. The path anonymity of this fault-tolerant routing anonymous release scheme exceeds 96.5%.

[0149] Obviously, the described embodiments are part of the embodiments of the present application, rather than all of the embodiments. In the absence of conflict, the embodiments in the present application and the features in the embodiments can be combined with each other. The components of the embodiments of the present application generally described and shown in the drawings here can be arranged and designed in various different configurations. Therefore, the detailed description of the embodiments of the present application is not intended to limit the scope of the application for protection, but merely represents the selected embodiments of the present application. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of this application.

Claims

1. A fault-tolerant routing anonymous publishing method for a human-machine-object fusion heterogeneous system, characterized by: It includes the following steps: Step 1, establish a routing topology structure of a human-machine-object fusion heterogeneous system; the routing topology structure of a human-machine-object fusion heterogeneous system includes a social layer, a network layer, and a physical layer; The social layer consists of individuals; the network layer consists of devices, sensors, servers, switches, and base stations; the physical layer consists of physical objects; each device belongs to a person in the social layer, each sensor corresponds to a physical object in the physical layer, and devices and sensors are connected through servers, switches, and base stations; Step 2: Construct a hierarchical fault-tolerant routing topology design protocol. The specific steps are as follows: Step 2-1, assume that T1 and T2 are two dual independent spanning trees in the network G = (V(G), E(G)), and let the destination node be d; Step 2-2, select two node subsets L1 and L2 from the network G, L1 = {v∈V(G)|v is a leaf node in T1 but not a leaf node in T2} and L2 = {v∈V(G)|v is a leaf node in T2}; Step 2-3, for any i∈{1,2}, set T i Skeleton Defined as T i A subtree of T i The node subset L is deleted from i A subtree obtained by combining all the nodes in Step 2-4, build a bridge connecting the two skeletons; assuming that d belongs to (i.e., d∈L2), B is the only edge in T2 connected to d; Step 2-5: Configure fault-tolerant routing R d =(V(G),E d ); the node set of fault-tolerant routing is V(G), and the edge set is The sum of the edge sets of B and B, all paths configured with fault-tolerant routing point to the destination node d; Step 2-6, searching for fault-tolerant routing in the physical layer based on the heuristic algorithm of Hamiltonian cycle; Step 3: Construct three types of attack models for route publishing: path tracing attack, alternative path tracing attack, and neighbor structure attack. When the adversary launches attacks on the main path node and the alternative path node at the same time, the communication of the human-machine-object fusion heterogeneous system will be paralyzed. Step 4: Set the fault-tolerant routing topology R d =(V(G),E d ) From the destination node to each node, the nodes are divided into layers according to the number of hops; the nodes in each layer are regarded as an anonymous community, and each anonymous community is perfectly matched and connected with the corresponding anonymous community in the previous layer; Step 5: After all nodes are segmented and connected, the anonymous communities are connected in order of hop count, where the tth anonymous community is connected to the t-1th anonymous community and the t+1th anonymous community, forming a vertical anonymous fault-tolerant route formed by vertical segmentation; Step 6: Set the fault-tolerant routing topology R d =(V(G),E d ) is transformed into a tree structure with the destination node d as the parent node, and each child node is used as the parent node of the subtree, and each subtree is d1, d2, ..., d m ; Step 7, regard each subtree as an anonymous community, and name them the first community, the second community, ..., the mth community in order from small to large according to the size of the subtree label; Step 8: Connect the anonymous communities in order, where the sth community can only be connected to the s-1th community and the s+1th community, forming a horizontal anonymous fault-tolerant route formed by horizontal segmentation; Step 9, anonymously publish the fault-tolerant routing topology according to the vertical anonymous fault-tolerant routing and the horizontal anonymous fault-tolerant routing; Step 10: Use graph splicing technology to verify the availability of the fault-tolerant path, that is, measure the availability of privacy computing by characterizing the success rate of data packets sent along the fault-tolerant route.

2. According to claim 1, a method for anonymously publishing fault-tolerant routing in a heterogeneous system of human-machine-object fusion, characterized in that: The construction steps of the social layer in step 1 are as follows: 1-2-1, model the social layer as a (k, n)-dimensional hypercube Q k,n ; 1-2-2, assuming that there are k key features in the social layer, each key feature has n different values, and 0, 1, ..., n-1 are used to represent these n different values; 1-2-3, for each individual u, use u1u2…u k Represents, which correspond to the values ​​of k different key features respectively; 1-2-4, the number of features with different values ​​between two bodies is defined as the feature distance between the two bodies; if the feature distance between two bodies u and v is 1, then there is a connection relationship between them, and a topological edge is used to connect u and v.

3. According to claim 1, a method for anonymously publishing fault-tolerant routing in a heterogeneous system of human-machine-object fusion, characterized in that: The steps to construct the network layer in step 1 are as follows: 1-3-1, the network layer is recursively modeled as a data center network BCube(n,k), where n represents the number of ports of the switch and k represents the dimension of the data center; assuming that each individual has a total of n-1 devices or physical objects, then each individual corresponds to a total of n-1 devices or sensors in the network layer; 1-3-2, use BCube(n,0) as the basic structure corresponding to each individual representative, which includes the device and sensor corresponding to the individual, as well as a server and an n-port switch; the device, sensor and server are called basic nodes, and the switch is called a level 0 switch; in BCube(n,0), the switch connects each device and each sensor, and also connects to the server; 1-3-3, because there are n k There are n individual representatives, so there are also n at the network level k BCube(n,0); let BCube(n,k) be composed of n BCube(n,k-1) and n k The k-level n-port switches are composed of n BCubes (n, k-1) with numbers from 0 to n-1, and the k-level switches with numbers from 0 to n k -1 numbering; in each BCube(n,k-1), devices and sensors use 0 to n k -2 label, and the server uses n k -1 label; 1-3-4, each device, sensor and server has k+1 ports, labeled 0-k; port k of the i-th basic node in the j-th BCube (n, k-1) is connected to the j-th port of the i-th k-level switch.

4. According to claim 1, a method for anonymously publishing fault-tolerant routing in a heterogeneous system of human-machine-object fusion, characterized in that: The steps to construct the physical layer in step 1 are as follows: 1-4-1, the physical layer is modeled as a multi-domain topology graph G(P, IntraL, D); 1-4-2, the physical objects in the physical layer constitute the node set P, and the internal links form the edge set IntraL; 1-4-3, suppose there are d domains in the physical layer. For the ith domain, let D i =D i (P i ,IntraL i ) is its topology, where the node set is P i , which is composed of the physical objects in the i-th domain, and the edge set is IntraL i , which is composed of the internal links of the ith domain. Let D be the multi-domain topology set, that is, D = {D i (P i , IntraL i )|1≤i≤D}.

5. According to claim 1, a method for anonymously publishing fault-tolerant routing in a heterogeneous system of human-machine-object fusion, characterized in that: Step 3: Step 3-1, assuming that the original main path P s,d s(=v1)→v2→…→v i →…→v n-1 →d(=v n ), and let the candidate node set of each intermediate node be AS s,d ={v'2,...,v' i ,...,v' n-1 }; Step 3-2, path tracing attack: The adversary attempts to discover the communication link v i →v i+1 (1≤i≤n-1) so as to track P as much as possible s,d ; When node v i If the attack is successful, the adversary finds the next hop node v i+1 ; Step 3-3, alternative path tracing attack: The adversary attempts to discover alternative communication links v i →v' i+1 (1≤i≤n-1) so as to track AS as much as possible s,d ; When node v i If the attack by the adversary is successful, the adversary finds the next hop node v' i+1 ; Step 3-4, neighbor structure attack: If the adversary knows the structural characteristics of the previous hop neighbors and next hop neighbors of a certain node in advance, the adversary will attack this specific node based on the background knowledge.

6. The method for anonymously publishing fault-tolerant routing in a human-machine-object fusion heterogeneous system according to claim 1 is characterized by: The specific method of hierarchical segmentation in step 4 is: Step 4-1: Set the fault-tolerant routing topology R d =(V(G),E d ) From the destination node to each node, the layers are divided according to the number of hops, and the destination node d is set as the first layer, and the first layer is regarded as the first anonymous community on the anonymous fault-tolerant routing; Step 4-2: Set the fault-tolerant routing topology R d =(V(G),E d ) is connected to the neighboring node v of d i1 (d,1) is divided into the second layer, and the second layer is regarded as the second anonymous community on the anonymous fault-tolerant routing, and the second anonymous community is perfectly matched with the first anonymous community; Step 4-3: Change the fault-tolerant routing topology R d =(V(G),E d ) and v i1 (d,1) connected neighbor node v i1i2 (d,2) is divided into the third layer, and the third layer is regarded as the third anonymous community on the anonymous fault-tolerant routing, and the third anonymous community is perfectly matched with the second anonymous community; Step 4-4, and so on; Step 4-5: Set the fault-tolerant routing topology R d =(V(G),E d ) and v i1 (d,t) connected neighbor node v i1i2...itit+1 (d, t+1) is divided into the t+1th layer and regarded as the t+1th anonymous community on the anonymous fault-tolerant routing. At the same time, the t+1th anonymous community is perfectly matched with the tth anonymous community.

7. The method for anonymously publishing fault-tolerant routing in a human-machine-object fusion heterogeneous system according to claim 1 is characterized by: The specific steps of step 10 are: Step 10-1, randomly select a node v of an anonymous community t on the vertical anonymous fault-tolerant routing i1i2...it (d,t) is the source node. According to the principle of fault-tolerant anonymous routing connection, node v i1i2...it (d, t) moves forward along the vertical anonymous fault-tolerant route to find its neighbors; Step 10-2: If there is only one neighbor v in the t-1th anonymous community i1i2...it-1 (d,t-1), then the data packet passes through node v i1i2...it (d,t) to node v i1i2...it-1 (d, t-1) Send information; Step 10-3: If there are multiple neighbors in the t-1th anonymous community, compare the node v on the horizontal anonymous fault-tolerant routing. i1i2...it (d, t) is located in the anonymous community, and check the neighbor v' in this horizontal anonymous community i1i2...it-1 (d,t-1), then the data packet passes through node v i1i2...it (d,t) to node v' i1i2...it-1 (d, t-1) Send information; Step 10-4, and so on to obtain the i1i2...it (d, t) to the destination node d, and verify whether it is a fault-tolerant routing topology R d =(V(G),E d ) on the path; Step 10-5, define the availability of the fault-tolerant anonymous routing algorithm: Let P be the path from s to d, and the nodes on the path are v0 = s, v1, v2, ..., v t-1 ,v t =d; for node v i , 0≤i≤t-1, let the set of all its neighbors be Nv i , through the published vertical anonymous community, v i The vertical community where you are located, thus obtaining v i The next hop node v i+1 Vertical community Ω 1,i+1 ; Through the published horizontal anonymous community, v i The horizontal community where you are located, thus obtaining v i The next hop node v i+1 Horizontal community Ω 2,i+1 According to v i+1 The vertical and horizontal communities and v i The neighbor set Nv i , which can reduce v i+1 If the selection range is , then define v i The availability is: and i =1 / |Nv i ∩Ω 1,i+1 ∩Ω 2,i+1 |; Step 10-6: For the entire path P, its availability is defined as the product of the availability of all nodes on the path except the target node, that is:

8. The method for anonymously publishing fault-tolerant routing in a human-machine-object fusion heterogeneous system according to claim 1 is characterized by: It also includes an anonymity measurement step, the specific method is: Step 11-1: For a given node u, locate the community where u is located through the published vertical anonymous community, so as to obtain the vertical community Ω where the node v is located 1，v ; Suppose the community contains |Ω 1，v | nodes; locate u through the published horizontal anonymous community, and thus obtain the horizontal community Ω where v is located 2，v ; Suppose the community contains |Ω 2，v | nodes; narrow the selection range of v to Ω according to the vertical and horizontal communities where v is located v =Ω 1，v ∩Ω 2，v ; Suppose the community contains |Ω v | nodes, then the anonymity of v is defined as: Step 11-2, let P be the path from node s to node d, and the nodes on the path are v0 = s, v1, v2, ..., v t-1 , v t =d; for node v i , 1≤i≤t-1, set its anonymity to NA i ,When obtaining the privacy information of the entire path through vertical anonymous fault-tolerant routing and horizontal anonymous fault-tolerant routing, it is necessary to start from the source node and obtain the privacy information of each node on the path hop by hop. Therefore, the anonymity of path P is defined as:

Images