CN113259218B

CN113259218B - Internet of things transmission method and device of ring area network topological structure

Info

Publication number: CN113259218B
Application number: CN202110657694.6A
Authority: CN
Inventors: 李晓伟
Original assignee: Shenzhen Qianhai Yilian Technology Co ltd
Current assignee: Shenzhen Qianhai Yilian Technology Co ltd
Priority date: 2021-06-14
Filing date: 2021-06-14
Publication date: 2021-09-17
Anticipated expiration: 2041-06-14
Also published as: CN113259218A

Abstract

The application discloses an Internet of things transmission method and device of a ring area network topological structure, wherein an ith node and an n/2+ i node are selected; performing a first stage data generation process; obtaining a plurality of ith virtual hash values; selecting an ith final virtual data; performing second-stage data generation processing; carrying out data transmission processing in a first stage; transmitting the acquired data from the ith node to the (n-1) th node to the (n/2 + i) th node at the same time; performing data transmission processing at a second stage to enable the nth/2 + i-2 node to transmit the nth/2 + i-2 final virtual data to the nth/2 + i node; performing data transmission processing in a third stage to enable the nth/2 + i +2 node to transmit the nth/2 + i +2 acquired data to the nth/2 + i node; and carrying out data transmission processing in the fourth stage, thereby realizing the transmission of the Internet of things of the ring area network topological structure and ensuring the information security.

Description

Internet of things transmission method and device of ring area network topological structure

Technical Field

The application relates to the field of computers, in particular to a transmission method and device of an internet of things with a ring area network topological structure.

Background

At present, there are various network topologies, wherein a ring topology network has the advantage of the fastest routing speed, but has corresponding disadvantages. The ring topology network has a disadvantage that information security is difficult to guarantee, because when data transmission is performed in the ring topology network, data is transmitted from the start node to the target node via a plurality of nodes, in this case, if any invaded node exists in the ring topology network, since any node can acquire all the transmitted data, the information security of the whole ring topology network is greatly threatened. However, the existing solutions fail to solve this drawback.

Disclosure of Invention

The application aims to solve the problem of information security in a ring topology network, particularly in the Internet of things of a ring area network topology structure.

In order to achieve the above object, the present application provides an internet of things transmission method for an annular area network topology structure, where the annular area network topology structure includes n internet of things nodes, and n is an even number greater than 5; the method comprises the following steps:

s1, selecting an ith node and an n/2+ i node from the n Internet of things nodes according to a preset node selection method; the n/2+ i node is a data receiving node; i is an integer less than n/2;

s2, performing data generation processing in the first stage, so that the ith node performs data acquisition processing by using a preset sensor to obtain ith acquisition data;

s3, generating a plurality of ith initial virtual data based on the ith collected data, and performing hash calculation on the ith initial virtual data respectively to obtain a plurality of ith virtual hash values; wherein, the numerical value contained in each ith initial virtual data is not completely the same as the numerical value contained in the ith acquisition data;

s4, selecting an ith final virtual data from the multiple ith initial virtual data according to a preset virtual data screening method; wherein, the first m binary characters of the ith virtual hash value corresponding to the ith final virtual data have the following correspondence with the first m values of the ith final virtual data: when the binary character is 0, the numerical value of the corresponding position is an imaginary numerical value; when the binary character is 1, the numerical value of the corresponding position is a real numerical value; the ith initial virtual data at least comprises m values; m is an integer greater than 1;

s5, performing data generation processing of a second stage to enable other nodes except the ith node and the (n/2 + i) th node to generate collected data and final virtual data respectively;

s6, performing data transmission processing in a first stage, so that an ith node transmits the ith acquired data to the (n/2 + i) th node through a plurality of nodes in sequence along a first direction; meanwhile, the ith final virtual data is sequentially transmitted to the nth/2 + i node through a plurality of nodes along a second direction; the first direction is a direction pointing to an i +1 th node from an ith node, and the second direction is a direction pointing to an i-1 th node from the ith node;

s7, when the ith acquisition data pass through other nodes, attaching corresponding acquisition data so that the acquisition data from the ith node to the (n/2 + i-1) th node along the first direction are transmitted to the (n/2 + i) th node at the same time; when the ith final virtual data passes through other nodes, corresponding final virtual data are attached, so that the ith node transmits the final virtual data to the (n/2 + i + 1) th node along the second direction;

s8, performing data transmission processing at a second stage to enable the nth/2 + i-2 node to transmit the nth/2 + i-2 final virtual data to the nth/2 + i node through a plurality of nodes in sequence along a second direction; when the n/2+ i-2 th final virtual data passes through the first n/2-3 nodes, corresponding final virtual data are attached, so that the final virtual data from the n/2+ i-2 th node to the i +1 th node are transmitted to the n/2+ i node;

s9, carrying out data transmission processing in a third stage, so that the n/2+ i +2 node transmits the n/2+ i +2 acquired data to the n/2+ i node through a plurality of nodes in sequence along a first direction; when the n/2+ i + 2-th collected data passes through the first n/2-3 nodes, corresponding collected data are attached, so that the collected data from the n/2+ i + 2-th node to the i-1-th node are transmitted to the n/2+ i-th node;

s10, performing data transmission processing of a fourth stage to enable the nth/2 + i-1 node to directly transmit the nth/2 + i-1 final virtual data to the nth/2 + i node; and enabling the n/2+ i +1 th node to directly transmit the n/2+ i +1 th acquired data to the n/2+ i th node.

Further, according to a preset node selection method, selecting an ith node and an n/2+ i node from the n nodes of the internet of things; the n/2+ i node is a data receiving node; after step S1, where i is an integer less than n/2, the method includes:

s101, the ith node performs two communication attempts on the nth/2 + i node, and whether the two communication attempts are smooth is judged; wherein the two attempted communications are an attempted communication in a first direction and an attempted communication in a second direction, respectively;

s102, if the two communication attempts are smooth, setting a data transmission rule in the ring area network topological structure to be that only communication from the ith node, the (n/2 + i-2) th node or the (n/2 + i + 2) th node to the (n/2 + i) th node can exist, and when communication data pass through other nodes in the communication process, the other nodes can attach new data behind the communication data.

Further, the step S3 of generating a plurality of ith initial virtual data based on the ith acquisition data includes:

s301, copying the ith acquired data for multiple times to obtain a plurality of ith data templates;

s302, respectively carrying out partial replacement processing on numerical values in the plurality of ith data templates to obtain a plurality of ith initial virtual data respectively corresponding to the plurality of ith data templates.

Further, the step S5 of performing the second stage of data generation processing to make the nodes except for the ith node and the (n/2 + i) th node generate the collected data and the final virtual data respectively includes:

s501, enabling other nodes except the ith node and the (n/2 + i) th node to respectively utilize a preset sensor to carry out data acquisition processing so as to obtain n-2 acquired data;

s502, generating n-2 final virtual data respectively corresponding to the n-2 acquired data; the first m-bit binary characters of the hash value calculated by the final virtual data and the first m-bit values of the final virtual data have the following corresponding relation: when the binary character is 0, the numerical value of the corresponding position is an imaginary numerical value; when the binary character is 1, the value of the corresponding position is the real value.

Further, the data transmission processing in the fourth stage is performed, so that the n/2+ i-1 node directly transmits the n/2+ i-1 final virtual data to the n/2+ i node; after the step S10 of the node n/2+ i +1 directly transmitting the collected data of the n/2+ i +1 th to the node n/2+ i, the method includes:

s11, the n/2+ i node carries out grouping processing on all the received data to obtain n-1 data groups; each data group comprises collected data and final virtual data, and the data in the same data group come from the same node;

s12, performing hash calculation on the acquired data and the final virtual data in each data group respectively to obtain n-1 hash value pairs respectively corresponding to the n-1 data groups;

s13, comparing the first m numerical values of the acquired data in each data group with the first m numerical values of the final virtual data, and recording the comparison results in the form of binary character strings, so as to obtain n-1 comparison character strings respectively corresponding to the n-1 data groups; wherein, the recording rule of the comparison result is as follows: when the values are different, a binary character 0 is used for representation; when the numerical values are the same, represented by binary character 1;

s14, based on the n-1 comparison character strings and the n-1 hash value pairs, carrying out hash value screening processing for n-1 times, thereby respectively screening n-1 designated hash values in the n-1 hash value pairs; wherein, the first m binary characters of the appointed hash value are completely the same as the corresponding contrast character strings;

s15, acquiring appointed data corresponding to the appointed hash value according to the corresponding relation between the hash value and the data;

and S16, performing n-1 times of data deletion processing to delete the designated data in the n-1 data groups, thereby obtaining n-1 data.

The application provides an Internet of things transmission device with an annular area network topological structure, wherein the annular area network topological structure comprises n Internet of things nodes, and n is an even number greater than 5; the method comprises the following steps:

the node selection unit is used for selecting an ith node and an n/2+ i node from the n nodes of the Internet of things according to a preset node selection method; the n/2+ i node is a data receiving node; i is an integer less than n/2;

the ith acquisition data acquisition unit is used for generating and processing data in the first stage, so that the ith node acquires and processes the data by using a preset sensor to obtain ith acquisition data;

the ith virtual hash value calculation unit is used for generating a plurality of ith initial virtual data according to the ith acquired data and respectively carrying out hash calculation on the ith initial virtual data to obtain a plurality of ith virtual hash values; wherein, the numerical value contained in each ith initial virtual data is not completely the same as the numerical value contained in the ith acquisition data;

the ith final virtual data screening unit is used for selecting an ith final virtual data from the plurality of ith initial virtual data according to a preset virtual data screening method; wherein, the first m binary characters of the ith virtual hash value corresponding to the ith final virtual data have the following correspondence with the first m values of the ith final virtual data: when the binary character is 0, the numerical value of the corresponding position is an imaginary numerical value; when the binary character is 1, the numerical value of the corresponding position is a real numerical value; the ith initial virtual data at least comprises m values; m is an integer greater than 1;

the second-stage data generation unit is used for performing second-stage data generation processing so that other nodes except the ith node and the (n/2 + i) th node respectively generate acquired data and final virtual data;

the first-stage data transmission unit is used for carrying out data transmission processing in a first stage, so that the ith node transmits the ith acquisition data to the (n/2 + i) th node through a plurality of nodes in sequence along a first direction; meanwhile, the ith final virtual data is sequentially transmitted to the nth/2 + i node through a plurality of nodes along a second direction; the first direction is a direction pointing to an i +1 th node from an ith node, and the second direction is a direction pointing to an i-1 th node from the ith node;

the data simultaneous transmission unit is used for attaching corresponding acquired data when the ith acquired data passes through other nodes so as to enable the ith node to transmit the acquired data from the nth/2 + i-1 node to the nth/2 + i node along the first direction; when the ith final virtual data passes through other nodes, corresponding final virtual data are attached, so that the ith node transmits the final virtual data to the (n/2 + i + 1) th node along the second direction;

the second-stage data transmission unit is used for carrying out second-stage data transmission processing so that the n/2+ i-2 node transmits the n/2+ i-2 final virtual data to the n/2+ i node through a plurality of nodes in sequence along a second direction; when the n/2+ i-2 th final virtual data passes through the first n/2-3 nodes, corresponding final virtual data are attached, so that the final virtual data from the n/2+ i-2 th node to the i +1 th node are transmitted to the n/2+ i node;

the third-stage data transmission unit is used for carrying out data transmission processing in a third stage so that the n/2+ i +2 node transmits the n/2+ i + 2-th acquired data to the n/2+ i node through a plurality of nodes in sequence along the first direction; when the n/2+ i + 2-th collected data passes through the first n/2-3 nodes, corresponding collected data are attached, so that the collected data from the n/2+ i + 2-th node to the i-1-th node are transmitted to the n/2+ i-th node;

the fourth-stage data transmission unit is used for carrying out data transmission processing in a fourth stage so that the n/2+ i-1 node directly transmits the n/2+ i-1-th final virtual data to the n/2+ i node; and enabling the n/2+ i +1 th node to directly transmit the n/2+ i +1 th acquired data to the n/2+ i th node.

The present application provides a computer device comprising a memory storing a computer program and a processor implementing the steps of any of the above methods when the processor executes the computer program.

The present application provides a computer-readable storage medium having stored thereon a computer program which, when being executed by a processor, carries out the steps of the method of any of the above.

According to the transmission method, device, computer equipment and storage medium of the Internet of things with the ring area network topological structure, the ith node and the (n/2 + i) th node are selected from n nodes of the Internet of things; performing data generation processing of a first stage; generating a plurality of ith initial virtual data to obtain a plurality of ith virtual hash values; selecting an ith final virtual data; performing data generation processing of a second stage; carrying out data transmission processing of a first stage; enabling the collected data from the ith node to the (n-1) th node to be transmitted to the (n/2 + i) th node at the same time; enabling the final virtual data from the ith node to the (n + 1) th node to be transmitted to the (n/2 + i) th node simultaneously; performing data transmission processing at a second stage to enable the nth/2 + i-2 node to transmit the nth/2 + i-2 final virtual data to the nth/2 + i node; enabling the final virtual data from the n/2+ i-2 node to the i +1 node to be transmitted to the n/2+ i node; performing data transmission processing in a third stage to enable the nth/2 + i +2 node to transmit the nth/2 + i +2 acquired data to the nth/2 + i node; enabling the collected data from the (n/2 + i + 2) th node to the (i-1) th node to be transmitted to the (n/2 + i) th node; and performing data transmission processing in the fourth stage, thereby realizing the transmission of the Internet of things in the ring area network topological structure and ensuring the information security.

The features of the present application include at least:

1. and selecting the ith node and the n/2+ ith node to reduce the time consumption of the communication process. Specifically, the communication of one round needs to be performed in three stages, and if one unit time is needed for data transmission between two nodes, the communication of one round needs about 5n/2-4 unit times, which is the minimum time consumption of the scheme of the present application;

2. even if the ring area network topological structure has the intrusion node, the intrusion node cannot acquire the acquired data and the final virtual data at the same time in the applied scheme, so that the intrusion node cannot distinguish the real data, and the information safety is ensured;

3. the data receiving node can perform data identification processing according to the acquired data and the final virtual data, other additional conditions are not needed, and implementation is facilitated.

Drawings

Fig. 1 is a schematic flowchart of steps S1 to S6 in an internet of things transmission method of a ring area network topology according to an embodiment of the present application;

fig. 2 is a schematic flowchart of steps S7 to S10 in the transmission method of the internet of things with a ring area network topology according to an embodiment of the present application;

fig. 3 is a block diagram illustrating a structure of a computer device according to an embodiment of the present application.

The implementation, functional features and advantages of the objectives of the present application will be further explained with reference to the accompanying drawings.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.

Referring to fig. 1 and 2, an embodiment of the present application provides an internet of things transmission method for an annular area network topology structure, where the annular area network topology structure includes n internet of things nodes, and n is an even number greater than 5; the method comprises the following steps:

The ring area network topology means that all nodes in an area network are sequentially connected to form a closed loop, so that each node is directly and communicatively connected to two other nodes, and is directly and communicatively connected to only two other nodes, that is, the ring area network topology includes n internet of things nodes, where the n internet of things nodes are a first node, a second node, …, and an nth node, and the first node, the second node, …, and the nth node are sequentially and communicatively connected to the first node. In addition, the number of nodes in the present application is at least 6, that is, n is an even number greater than 5, which is a special requirement of the present application, because when the number of nodes is less than 6, it is not necessary to implement the solution of the present application. And the number of n may be any feasible number, but the greater the number, the more time consuming the communication. In addition, in an actual situation, if the number of the nodes is an even number, the total number of the nodes can be controlled by temporarily increasing or decreasing the number of the nodes, and since the ring area network topology structure is adopted in the method, the method has the characteristic of fast layout, and is easy to realize.

In addition, the node is applied to the internet of things, and one characteristic of the node in the internet of things is that most of the nodes have sensors to collect data, and the collected data have a plurality of numerical values, which is a premise that the node can be implemented to improve information security, and many nodes in the internet of things have the need of acquiring data of other nodes, for example, the node is used for intelligent decision making.

The utility model provides a ring area network topological structure includes n thing networking nodes, n thing networking nodes are first node, second node, … and nth node, first node, second node, … and nth node communication connection in proper order, and first node with nth node communication connection, n is for being greater than 5 even number. It should be noted that the present application is implemented in the internet of things, that is, a ring area network topology is a unit in the internet of things.

As described in step S1, according to a preset node selection method, an ith node and an n/2+ i node are selected from the n internet of things nodes; the n/2+ i node is a data receiving node; i is an integer less than n/2.

The data sending starting node is the ith node, the data receiving node is the (n/2 + i) th node, and the purpose is to ensure the transmission of data between the two nodes, and the distance between the two nodes is the same no matter from forward transmission or reverse transmission, so that the data transmission efficiency is improved as much as possible. In addition, for example, i is 1, and n is 10, so as to facilitate explanation of the present solution, at this time, the data transmission starting node is the first node, and the data receiving node is the eleventh node. The nodes in this application form a ring structure, so that if some numbered node is greater than n, it actually refers to the node minus n, for example, the n +1 th node, actually refers to the first node, which is the only understanding of those skilled in the art, and is a matter that can be confirmed without any doubt.

As described in the above steps S2-S4, the data generation processing in the first stage is performed, so that the ith node performs data acquisition processing by using a preset sensor to obtain the ith acquired data; generating a plurality of ith initial virtual data by taking the ith acquired data as a basis, and performing hash calculation on the plurality of ith initial virtual data respectively to obtain a plurality of ith virtual hash values; wherein, the numerical value contained in each ith initial virtual data is not completely the same as the numerical value contained in the ith acquisition data; selecting an ith final virtual data from the plurality of ith initial virtual data according to a preset virtual data screening method; wherein, the first m binary characters of the ith virtual hash value corresponding to the ith final virtual data have the following correspondence with the first m values of the ith final virtual data: when the binary character is 0, the numerical value of the corresponding position is an imaginary numerical value; when the binary character is 1, the numerical value of the corresponding position is a real numerical value; the ith initial virtual data at least comprises m values; m is an integer greater than 1.

The sensors are related to the node functions in the physical network, for example, temperature sensors, light sensors, humidity sensors, speed sensors, etc. can be pre-arranged on the nodes. Therefore, the acquired data is real data. And generating a plurality of ith initial virtual data by taking the ith acquisition data as a basis. It should be noted that the dummy data is generated by simulating the acquired data, and the purpose of the dummy data is to confuse a possible intruder. Specifically, the collected data and the virtual data are transmitted to the n/2+ i-th node, if a certain node is invaded, the invader can know the data passing through the invaded node, namely, one of the collected data and the virtual data (the collected data and the virtual data are not transmitted by different paths), and only one data exists, so that the invader cannot distinguish true from false, and the information security can be ensured. In addition, the information security is improved in a manner that a data encryption technology and the like are not involved in the scheme, the scheme is mainly applied to the internet of things, data transmission is frequent, a common information encryption technology is not suitable for being used, naturally, encryption can be performed on the transmission data involved in the scheme, but a non-encryption manner is preferred, because the scheme can ensure certain information security.

Performing hash calculation on the ith initial virtual data respectively to obtain a plurality of ith virtual hash values; and the numerical value contained in each ith initial virtual data is not identical to the numerical value contained in the ith acquisition data. The application has another great characteristic that the generated final virtual data is influenced by the final virtual data, and it is noted that this is not a sentence, but a practical characteristic of the application. This feature is embodied as follows: selecting an ith final virtual data from the plurality of ith initial virtual data according to a preset virtual data screening method; wherein, the first m binary characters of the ith virtual hash value corresponding to the ith final virtual data have the following correspondence with the first m values of the ith final virtual data: when the binary character is 0, the numerical value of the corresponding position is an imaginary numerical value; when the binary character is 1, the numerical value of the corresponding position is a real numerical value; the ith initial virtual data at least comprises m values; m is an integer greater than 1. Therefore, the above feature can be simply described as that the calculated hash value of the final virtual data is special, i.e. the final virtual data is determined by its own corresponding hash value whether it can meet the requirement of the final virtual data, which is the meaning that the final virtual data is influenced by the final virtual data itself. The design has the advantages that after the collected data and the corresponding virtual data are simultaneously acquired (in the application, only the data receiving node and the (n/2 + i) th node can simultaneously acquire the two data), which is the real collected data can be distinguished according to the two corresponding data; however, only one of the two data is acquired, and it is impossible to determine which data is. The method for distinguishing which is the real collected data according to the two corresponding data is implemented in the n/2+ i node, and therefore will be described in detail later. The hash algorithm used in the present application may be any feasible algorithm, such as SHA256 and other hash algorithms, and is not limited herein. The hash algorithm is an irreversible digest algorithm which can convert an unlimited input into a binary string with a specified number of bits, and different inputs correspond to different binary strings, and the hash algorithm has a characteristic that the input and the output have no obvious correspondence, and the scheme of the application just utilizes the characteristic.

In addition, the hash value of the final virtual data is used as the judgment standard of the final virtual data, and the hash value of the real collected data is not used as the judgment standard of the final virtual data, which is particularly set in consideration of the time dimension. Although the hash value of the real collected data is used as the judgment standard of the final virtual data, the virtual data can be generated only by one-time hash calculation, but the method is applied to the internet of things, and the collected data of the sensor of the internet of things may occur in the case that the detected values are the same in a continuous time period (for example, a certain parameter of a certain stable system is measured, such as a voltage value and the like). By adopting the final virtual data generation method, the generated final virtual data is unscented and searchable, so that potential safety hazards cannot exist, and the method is also a characteristic of the method. Of course, by using the final virtual data generation method of the present application, virtual data generation, hash calculation, and screening need to be performed multiple times, but the number of times is limited, and the speed of performing hash calculation for limited times is extremely fast, so that the information security is improved at the cost of this.

Thereby generating a plurality of ith initial virtual data having the same data structure as the ith acquisition data. Because the same data structure is adopted, the position values of the acquired data and the virtual data are the same and clear at a glance, and the acquired data can be distinguished by combining the hash value calculated by the hash algorithm.

As described in the above steps S5-S7, the data generation process in the second stage is performed, so that the nodes except the ith node and the (n/2 + i) th node generate the collected data and the final virtual data, respectively; performing data transmission processing of a first stage to enable an ith node to transmit the ith acquisition data to the nth/2 + i node through a plurality of nodes in sequence along a first direction; meanwhile, the ith final virtual data is sequentially transmitted to the nth/2 + i node through a plurality of nodes along a second direction; the first direction is a direction pointing to an i +1 th node from an ith node, and the second direction is a direction pointing to an i-1 th node from the ith node; when the ith acquisition data passes through other nodes, attaching corresponding acquisition data to enable the ith node to transmit the acquisition data from the first direction to the (n/2 + i-1) th node to the (n/2 + i) th node at the same time; and when the ith final virtual data passes through other nodes, attaching the corresponding final virtual data so that the ith node transmits the final virtual data to the (n/2 + i + 1) th node along the second direction at the same time.

The data generation processing of the second stage is similar to the data generation processing of the first stage, except that the data generation processing of the first stage is implemented on the ith node, and the data generation processing of the second stage is implemented on other nodes except the ith node and the (n/2 + i) th node, so that n-2 pieces of collected data and n-2 pieces of final virtual data can be obtained, and the n-2 pieces of collected data and the n-2 pieces of final virtual data also meet the similar characteristics of the ith piece of collected data and the ith piece of final virtual data, namely two corresponding pieces of data are required to be simultaneously obtained to perform data discrimination operation, and only one piece of the obtained data is not enough to determine the authenticity of the data.

Specifically, the step S5 of performing the second stage of data generation processing to make the nodes except the ith node and the (n/2 + i) th node generate the collected data and the final virtual data respectively includes:

Performing data transmission processing in a first stage to enable the ith node to transmit the ith acquisition data to the (n/2 + i) th node through a plurality of nodes in sequence along a first direction; and meanwhile, sequentially transmitting the ith final virtual data to the nth/2 + i node through a plurality of nodes along a second direction. At this time, it is necessary to avoid that other nodes except the ith node and the (n/2 + i) th node can simultaneously acquire the ith final virtual data of the ith acquired data, so that a reverse data transmission mode is adopted, each node can only acquire one of the ith final virtual data of the ith acquired data, and therefore, even if an invasive node exists, information safety can be ensured.

In addition, the method has another characteristic that only one data receiving node and one initial data sending node exist in the process of data transmission of one round, but the node through which the data passes can attach new data to the transmitted data, so that the data transmission time can be reduced. When new data is attached, a limiting condition is provided, namely real data is attached after the real data, and imaginary data is attached after the imaginary data, namely when the ith acquisition data passes through other nodes, corresponding acquisition data is attached, so that the acquisition data of the ith node from the first direction to the (n/2 + i-1) th node are transmitted to the (n/2 + i) th node at the same time; and when the ith final virtual data passes through other nodes, attaching the corresponding final virtual data so that the ith node transmits the final virtual data to the (n/2 + i + 1) th node along the second direction at the same time. Each node already generates two data, namely acquisition data and final virtual data, and each node (except the ith node) can only attach one data during the data transmission processing in the first stage, so that each node also retains another data, and the retained data are subjected to data transmission in the subsequent stage. The data transmission mode is adopted to ensure that each node cannot acquire corresponding acquired data and final virtual data at the same time.

Although in the data transmission processing procedure of the first stage of the current round, the real data (i-th collected data) is transmitted along the first direction, and the imaginary data (i-th final virtual data) is transmitted along the second direction, the data transmission processing procedure of the next round can be reversed, that is, in the data transmission processing procedure of the first stage of the next round, the real data is transmitted along the second direction, and the imaginary data is transmitted along the first direction, so as to ensure that if there is an invasive node, the nature of the single data acquired in each round is uncertain, thereby further ensuring the information security.

As described in the above steps S8-S10, the data transmission process in the second stage is performed, so that the n/2+ i-2 node transmits the n/2+ i-2 th final virtual data to the n/2+ i node via a plurality of nodes in sequence along the second direction; when the n/2+ i-2 th final virtual data passes through the first n/2-3 nodes, corresponding final virtual data are attached, so that the final virtual data from the n/2+ i-2 th node to the i +1 th node are transmitted to the n/2+ i node; carrying out data transmission processing in a third stage so that the n/2+ i +2 node transmits the n/2+ i +2 acquired data to the n/2+ i node through a plurality of nodes in sequence along the first direction; when the n/2+ i + 2-th collected data passes through the first n/2-3 nodes, corresponding collected data are attached, so that the collected data from the n/2+ i + 2-th node to the i-1-th node are transmitted to the n/2+ i-th node; performing data transmission processing of a fourth stage to enable the n/2+ i-1 node to directly transmit the n/2+ i-1 final virtual data to the n/2+ i node; and enabling the n/2+ i +1 th node to directly transmit the n/2+ i +1 th acquired data to the n/2+ i th node.

And the second stage of data transmission processing only relates to data transmission of the first n/2-3 nodes and final virtual data transmission of the first n/2-3 nodes, wherein the first n/2-3 nodes refer to the (n/2 + i-3) th node to the (i + 1) th node, and the (n/2 + i-2) th node is added to form a data sequence consisting of final virtual data of the (n/2 + i-2) th node to the (i + 1) th node. At this time, it is to be noted that the data transmission processing at the second stage needs to transmit data from the nth/2 + i-2 node to the nth/2 + i node along the second direction via all nodes of almost the entire ring topology, but this is necessary to ensure that each node cannot acquire corresponding collected data and final virtual data. In addition, the data transmission of the second stage is started by the n/2+ i-2 node, but not by the n/2+ i-1 node, because the n/2+ i-1 node is adjacent to the n/2+ i node, and the n/2+ i-1 node directly transmits the final virtual data to the n/2+ i node, and because other nodes are not accessed, the possibility of data leakage does not exist.

In addition, the data transmission processing of the second stage and the data transmission processing of the third stage are sequential in time, while the data transmission processing of the fourth stage has no time limitation, which is determined by the ring topology.

Similarly, the data transmission process of the third stage is similar to the data transmission process of the second stage, except that the data is transmitted by collecting data, and the transmission direction is the first direction.

The data transmission processing in the fourth stage is performed by two nodes adjacent to the n/2+ i-th node as the data receiving node, respectively transmitting the remaining data to the n/2+ i-th node, so that the time consumption is very small, and no collision of data transmission occurs, so that the data transmission processing can be performed at any feasible time.

In addition, for the number of each node, it is stated that if the number of a certain node is larger than n, it actually refers to the numbered node minus n, because the ring topology makes the nth node directly connected to the first node, for example, the (n + 1) th node is actually the first node.

Through the data transmission of the four stages, the n/2+ i node as the data receiving node can obtain n-1 pieces of collected data and n-1 pieces of final virtual data, wherein the collected data and the final virtual data are respectively corresponding, and therefore grouping processing can be carried out to obtain n-1 data groups. As can be seen from the process of generating the final virtual data, the hash value of the final virtual data has a special feature, that is, the first m binary characters reflect the position of the imaginary value, and the position of the imaginary value can be obtained by comparing the collected data with the final virtual data, so that which data is the final virtual data can be determined by hash calculation, the collected data and the final virtual data. Therefore, the comparison character string reflects the position information of the imaginary numerical value, the designated hash value can be screened out according to the comparison character string and the hash value pair, the data corresponding to the designated hash value is the final virtual data, and the final virtual data is deleted to obtain the real data. The contrast character string and the hash value pair are taken as the basis, namely the first m binary characters of the appointed hash value are completely the same as the corresponding contrast character string.

According to the transmission method of the Internet of things with the ring area network topological structure, the ith node and the n/2+ i node are selected from n Internet of things nodes; performing data generation processing of a first stage; generating a plurality of ith initial virtual data to obtain a plurality of ith virtual hash values; selecting an ith final virtual data; performing data generation processing of a second stage; carrying out data transmission processing of a first stage; enabling the collected data from the ith node to the (n-1) th node to be transmitted to the (n/2 + i) th node at the same time; enabling the final virtual data from the ith node to the (n + 1) th node to be transmitted to the (n/2 + i) th node simultaneously; performing data transmission processing at a second stage to enable the nth/2 + i-2 node to transmit the nth/2 + i-2 final virtual data to the nth/2 + i node; enabling the final virtual data from the n/2+ i-2 node to the i +1 node to be transmitted to the n/2+ i node; performing data transmission processing in a third stage to enable the nth/2 + i +2 node to transmit the nth/2 + i +2 acquired data to the nth/2 + i node; enabling the collected data from the (n/2 + i + 2) th node to the (i-1) th node to be transmitted to the (n/2 + i) th node; and performing data transmission processing in the fourth stage, thereby realizing the transmission of the Internet of things in the ring area network topological structure and ensuring the information security.

The embodiment of the application provides an internet of things transmission device with an annular area network topological structure, wherein the annular area network topological structure comprises n internet of things nodes, and n is an even number greater than 5; the method comprises the following steps:

The operations respectively executed by the above units correspond to the steps of the transmission method of the internet of things with the ring area network topology structure in the foregoing embodiment one by one, and are not described herein again.

The internet of things transmission device with the ring area network topological structure selects the ith node and the n/2+ i node from n internet of things nodes; performing data generation processing of a first stage; generating a plurality of ith initial virtual data to obtain a plurality of ith virtual hash values; selecting an ith final virtual data; performing data generation processing of a second stage; carrying out data transmission processing of a first stage; enabling the collected data from the ith node to the (n-1) th node to be transmitted to the (n/2 + i) th node at the same time; enabling the final virtual data from the ith node to the (n + 1) th node to be transmitted to the (n/2 + i) th node simultaneously; performing data transmission processing at a second stage to enable the nth/2 + i-2 node to transmit the nth/2 + i-2 final virtual data to the nth/2 + i node; enabling the final virtual data from the n/2+ i-2 node to the i +1 node to be transmitted to the n/2+ i node; performing data transmission processing in a third stage to enable the nth/2 + i +2 node to transmit the nth/2 + i +2 acquired data to the nth/2 + i node; enabling the collected data from the (n/2 + i + 2) th node to the (i-1) th node to be transmitted to the (n/2 + i) th node; and performing data transmission processing in the fourth stage, thereby realizing the transmission of the Internet of things in the ring area network topological structure and ensuring the information security.

Referring to fig. 3, an embodiment of the present invention further provides a computer device, where the computer device may be a server, and an internal structure of the computer device may be as shown in fig. 3. The computer device includes a processor, a memory, a network interface, and a database connected by a system bus. Wherein the computer designed processor is used to provide computational and control capabilities. The memory of the computer device comprises a nonvolatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer equipment is used for storing data used by the transmission method of the internet of things of the ring area network topological structure. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a method for internet of things transmission in a ring area network topology.

The processor executes the internet of things transmission method of the ring area network topology structure, wherein the steps included in the method correspond to the steps of executing the internet of things transmission method of the ring area network topology structure of the foregoing embodiment one to one, and are not described herein again.

Those skilled in the art will appreciate that the architecture shown in fig. 3 is only a block diagram of some of the structures associated with the disclosed aspects and is not intended to limit the computing devices to which the disclosed aspects may be applied.

The computer equipment selects an ith node and an nth/2 + i node from n nodes of the Internet of things; performing data generation processing of a first stage; generating a plurality of ith initial virtual data to obtain a plurality of ith virtual hash values; selecting an ith final virtual data; performing data generation processing of a second stage; carrying out data transmission processing of a first stage; enabling the collected data from the ith node to the (n-1) th node to be transmitted to the (n/2 + i) th node at the same time; enabling the final virtual data from the ith node to the (n + 1) th node to be transmitted to the (n/2 + i) th node simultaneously; performing data transmission processing at a second stage to enable the nth/2 + i-2 node to transmit the nth/2 + i-2 final virtual data to the nth/2 + i node; enabling the final virtual data from the n/2+ i-2 node to the i +1 node to be transmitted to the n/2+ i node; performing data transmission processing in a third stage to enable the nth/2 + i +2 node to transmit the nth/2 + i +2 acquired data to the nth/2 + i node; enabling the collected data from the (n/2 + i + 2) th node to the (i-1) th node to be transmitted to the (n/2 + i) th node; and performing data transmission processing in the fourth stage, thereby realizing the transmission of the Internet of things in the ring area network topological structure and ensuring the information security.

An embodiment of the present application further provides a computer-readable storage medium, where a computer program is stored thereon, and when the computer program is executed by a processor, the method for transmitting an internet of things with a ring area network topology is implemented, where steps included in the method are respectively in one-to-one correspondence with steps of executing the method for transmitting an internet of things with a ring area network topology according to the foregoing embodiment, and are not described herein again.

The computer-readable storage medium selects an ith node and an n/2+ i node from n nodes of the internet of things; performing data generation processing of a first stage; generating a plurality of ith initial virtual data to obtain a plurality of ith virtual hash values; selecting an ith final virtual data; performing data generation processing of a second stage; carrying out data transmission processing of a first stage; enabling the collected data from the ith node to the (n-1) th node to be transmitted to the (n/2 + i) th node at the same time; enabling the final virtual data from the ith node to the (n + 1) th node to be transmitted to the (n/2 + i) th node simultaneously; performing data transmission processing at a second stage to enable the nth/2 + i-2 node to transmit the nth/2 + i-2 final virtual data to the nth/2 + i node; enabling the final virtual data from the n/2+ i-2 node to the i +1 node to be transmitted to the n/2+ i node; performing data transmission processing in a third stage to enable the nth/2 + i +2 node to transmit the nth/2 + i +2 acquired data to the nth/2 + i node; enabling the collected data from the (n/2 + i + 2) th node to the (i-1) th node to be transmitted to the (n/2 + i) th node; and performing data transmission processing in the fourth stage, thereby realizing the transmission of the Internet of things in the ring area network topological structure and ensuring the information security.

It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by hardware associated with a computer program or instructions, the computer program can be stored in a non-volatile computer-readable storage medium, and the computer program can include the processes of the embodiments of the methods described above when executed. Any reference to memory, storage, database, or other medium provided herein and used in the examples may include non-volatile and/or volatile memory. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), double-rate SDRAM (SSRSDRAM), Enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and bus dynamic RAM (RDRAM).

It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, apparatus, article, or method that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, apparatus, article, or method. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, apparatus, article, or method that includes the element.

The above description is only a preferred embodiment of the present application, and not intended to limit the scope of the present application, and all modifications of equivalent structures and equivalent processes, which are made by the contents of the specification and the drawings of the present application, or which are directly or indirectly applied to other related technical fields, are also included in the scope of the present application.

Claims

1. The transmission method of the Internet of things of the ring-shaped area network topological structure is characterized in that the ring-shaped area network topological structure comprises n Internet of things nodes, wherein n is an even number greater than 5; the method comprises the following steps:

2. The method for transmitting the internet of things in the ring area network topology according to claim 1, wherein after the S1, the method comprises:

3. The method for transmitting the internet of things in the ring area network topology according to claim 1, wherein the S3 includes:

4. The method for transmitting the internet of things in the ring area network topology according to claim 1, wherein the S5 includes:

5. The method for transmitting the internet of things in the ring area network topology according to claim 1, wherein after the S10, the method comprises:

6. The transmission device of the Internet of things with the ring-shaped area network topological structure is characterized in that the ring-shaped area network topological structure comprises n Internet of things nodes, wherein n is an even number greater than 5; the method comprises the following steps:

7. A computer device comprising a memory and a processor, the memory storing a computer program, wherein the processor implements the steps of the method of any one of claims 1 to 5 when executing the computer program.

8. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 5.