CN112527905B - A blockchain IoT data fusion method for multi-node pumping units - Google Patents

Abstract

The invention relates to the technical field of data processing of the Internet of things, in particular to a multi-node block chain Internet of things data fusion method for an oil pumping unit, which comprises the following steps: s1: in the period, the base station selects an aggregation node with a hash value H0 of the history information before uplink according to the node information stored in the base station, and sends activation information to wake up the aggregation node; s2: the aggregation node sends the H0 stored by the aggregation node to the base station, the base station receives the H0 of the aggregation node and recalculates the hash value H00 of the historical information before the uplink stored in the basic library, then the H0 and the H00 are compared to obtain a first result, and if the first result is the same, S3 is executed; s3: the base station broadcasts message information to the aggregation node, and the aggregation node broadcasts starting information after receiving the message information. The invention aims to provide a multi-node block chain Internet of things data fusion method for an oil pumping unit, which aims to save energy, does not excessively increase network delay and can ensure the safety and reliability of data.

Description

A blockchain IoT data fusion method for multi-node pumping units

technical field

The invention relates to the technical field of Internet of Things data processing, in particular to a multi-node blockchain Internet of Things data fusion method for pumping units.

Background technique

The Internet of Things refers to the real-time collection of any object or process that needs to be monitored, connected, and interacted with through various information sensors, and collects various required information such as sound, light, heat, electricity, mechanics, chemistry, biology, and location. It realizes the kind of possible network access, realizes the ubiquitous connection between things and things, and between things and people, and realizes the intelligent perception, identification and management of objects and processes. The Internet of Things is an information carrier based on the Internet, traditional telecommunication networks, etc. It allows all ordinary physical objects that can be independently addressed to form an interconnected network, usually wireless sensors for networking.

During the operation of the Internet of Things, sensor nodes are required to transmit the collected data to the base station (in some environments, it may also be a wireless router). The easiest way to achieve this task is to send directly to the base station, that is, each node in the network sends the collected data directly to the base station. However, for sensor nodes far away from the base station, this method will consume a lot of energy for transmitting data. Under the same specification, the service life of this node will be significantly shorter than that of sensor nodes closer to the base station in the network. In order to solve the above problems, a series of data collection algorithms aimed at saving energy have been proposed one after another.

In addition to the above problems, due to the wide variety of existing networking equipment, if effective decision-making is required, it is necessary to use data fusion technology to automatically analyze and synthesize the collected information under certain criteria to complete the required decision-making and evaluation tasks. Moreover, the existing data fusion technology needs to pay attention to data verification and authentication, adding complex calculations. If more computing tasks are undertaken by devices with less computing power, it will increase the network delay and reduce the network’s robustness. Stickiness.

In view of the above problems, in the patent document of Chinese Patent Publication No. CN102075A, a method for ensuring the information security of the data fusion of the Internet of Things is disclosed. Through the designed supervision mechanism, the supervision information is complete and accessible, avoiding the malicious discarding of message information in other security mechanisms when the node is attacked in the past; at the same time, the supervision information and the fusion information have the same source, with high credibility . The literature claims that this method has low dependence on external environmental factors such as hardware and operating environment, and the cost difference between new networks and existing networks using this solution is small, and it can cope with network and data changes, and has strong scalability. However, during the use of the above scheme, the data collected by the Internet of Things is easily tampered with, resulting in low data reliability, and it is necessary to improve the security and reliability of the data.

In existing application scenarios, it is usually used in industrial production and smart home environments. In smart home application scenarios, routers are usually used as base stations, and various smart devices are used as nodes to collect and process various types of data. In industrial scenarios, for example, taking a pumping unit working in an oil field as an example, several nodes are usually set up to collect and process various data to ensure the normal operation of the entire pumping unit. When it is untrustworthy (external attack or other reasons), there are still major security risks.

Therefore, there is an urgent need for a multi-node blockchain IoT data fusion method for pumping units that aims to save energy, does not increase network delay too much, and can ensure data security and reliability.

Contents of the invention

The present invention intends to provide a multi-node block chain Internet of things data fusion method for pumping units, which aims at saving energy, does not increase network delay too much, and can ensure data security and reliability.

This application provides the following technical solutions:

A multi-node blockchain Internet of things data fusion method for pumping units, comprising the following steps:

S1: In this cycle, the base station selects the aggregation node that stores the hash value H0 of the historical information before going up the chain according to the node information stored in the basic database, and sends activation information to wake up the aggregation node;

S2: The aggregation node sends the H0 stored by the aggregation node to the base station, and the base station receives the H0 of the aggregation node and recalculates the hash value H00 of the historical information stored in the basic database before going up to the chain, and then compares H0 with H00 to obtain the first One result, if the first result is the same, execute S3; if the first result is different, the base station compares the received H0 of at least two aggregation nodes to obtain the second result; if the second result is the same, Then the base station sends to the preset address an alarm message indicating that the historical information stored in the base database has been tampered with before going up to the chain; if the second result is not the same, the base station sends an alarm message that the system cannot confirm the security to the preset address;

S3: The base station broadcasts the message information to the aggregation node. The aggregation node broadcasts the start information after receiving the message information. The ordinary node starts after receiving the first start information and ignores other start information. The start information includes the aggregation The address of the node, and then the ordinary node is awakened, and the initial information of the required message is sent to the aggregation node according to the address of the startup information;

S4: The aggregation node receives the initial information and processes it into the information to be linked, and then broadcasts it to the base station and other aggregation nodes. The base station and other aggregation nodes that receive the information to be linked will perform hash operations on H0 and the information to be linked to generate corresponding information The newly added hash value H1 and broadcast H1 to the outside, the base station and any other aggregation node stop the unfinished hash operation after receiving H1, and the base station saves the information to be uploaded and H1 to the historical information before uploading to generate a new For historical information before uploading to the chain, the aggregation node updates H0 to H1 to complete an initial information upload;

S5: After completing the uplink of the initial information, repeat S4 until no aggregation node broadcasts the information to be uplinked. After the base station does not receive the information to be uplinked within the preset time, it sends a confirmation message to the aggregation node and receives it. The aggregation node sends the dormancy information to the aggregation node after receiving the message receipt information that has completed this cycle. After receiving the dormancy information, the aggregation node saves the last hash value HN after the initial information is uploaded to the chain for the next cycle. Verify, then sleep;

S6: The base station records the information of the last aggregation node that fed back the message receipt information of this cycle and the time T of this cycle, and updates the common node that sends the initial information the fastest and meets the minimum performance requirements in the basic database as a new aggregation The node sends the HN to it, and the base station saves the information after the initial information is uploaded to the chain, and deletes the HN for the next cycle of verification.

The principle and advantages of the present invention: before the start of a period, the basic database of the base station stores node information, specifically those are aggregation nodes and those are ordinary nodes, and then all historical information before uplink is stored; aggregation nodes It stores the hash value H0 theoretically corresponding to the historical information before going to the chain. After the start of this cycle, the base station sends activation information to the aggregation node. At the same time, the base station calculates the existing hash value H00 of the historical information before going up the chain, and compares H0 with H00 to ensure that the information in the base station and the aggregation node has not been tampered with. In this stage, the waiting time of the aggregation node in the wake-up stage is used. In the existing entire system, this time is usually irreducible, so no additional time is consumed. And because H00 is recalculated again, the credibility of the data can be guaranteed.

In S3 and S4, the aggregation node broadcasts the startup information to the common nodes, and the normal node sends initial information to the aggregation node according to the first startup information received. This way is to fully consider the performance differences of each aggregation node. The aggregation node with better performance (including hardware performance and network connectivity) can receive and process more information from ordinary nodes, and then broadcast it to the outside world. , the base station and all aggregation nodes perform hash operations, and finally upload the initial information to the chain. In this way, the credibility of information fed back by each aggregation node to the base station can be guaranteed. Although the base station and all aggregation nodes participate in the hash operation, there is a certain waste of computing power, but in fact, because only a single hash operation is performed, there is no more comparison, and the overall speed is the same as that without hashing. There will not be much time difference compared with the Greek operation directly recorded sequentially by the base station. But it improves the credibility of the whole system.

In S5 and S6, after the cycle synchronization of the entire system in this cycle is completed, the preparation for the next cycle is carried out. S6 is that the base station adjusts the relevant information of the aggregation node according to the time T of the current cycle, and retains the possibility of optimization.

In this solution, ordinary nodes only need to send relevant information to the aggregation node. For ordinary nodes, the purpose of saving energy consumption is realized. In the process of synchronizing the information of each common node, the data is fused and saved through the blockchain. In this solution, at the initial stage, the waiting time for the aggregation node to wake up is used to allow the base station to perform hash value calculation, which will not increase the additional waiting delay of the system; in the process of data encryption, only the aggregation node and the base station are required to perform the hash value calculation. The Hive operation, minus other verification processes, will not increase too much network delay compared with the base station's direct sequence preservation. Since every cycle and every data writing is related to the verification, the security of the data is guaranteed.

Further, it also includes S7, the base station analyzes the time T of at least two or more current cycles, selects the aggregation node information corresponding to the cycle with the least time, and sends activation information according to the aggregation node information in the next cycle to wake up the aggregation node.

This way can optimize the settings of aggregation nodes.

Further, in S1, the node information stored in the basic library includes the minimum performance requirements to meet the aggregation node performance.

This way can ensure that the performance of the aggregation node meets the requirements.

Further, the performance requirements include: chip main frequency, chip core number, RAM value and ROM value.

This way can ensure that the performance of the aggregation node meets the requirements.

Further, in S6, the minimum performance requirement is a preset value.

This way can ensure that the performance of the aggregation node meets the requirements.

Furthermore, in S4, when the aggregation node broadcasts H1 to the outside, it will attach a timestamp. If the base station and any other aggregation node receive two H1s at the same time, they will read the time information in the timestamp, and then recognize that the time is the priority H1.

This way can ensure the timeliness and accuracy of data.

Further, in S2, the preset address is an unchangeable emergency contact method preset by the user.

This way can remind the user more conveniently and effectively.

Further, in S2, if there is an aggregation node, the first result and the second result are different and the first results of other aggregation nodes are the same, then the base station broadcasts to other aggregation nodes that the aggregation node is an untrusted node, and the aggregation node is based on The node information stored in the library is changed to a normal node.

Modify the aggregation node to a common node to ensure the security of the system.

Further, in S4, the base station and other aggregation nodes that have received the information to be linked up use H0 and the information to be linked up to perform a hash operation to generate a new hash value H1 and broadcast H1 to the outside. The base station and any other aggregation node After receiving H1 twice, stop the outstanding hash operation.

This method undergoes one more verification to ensure the correctness of the data.

Description of drawings

Fig. 1 is a logic block diagram in an embodiment of a multi-node blockchain Internet of Things data fusion method for pumping units of the present application.

detailed description

The technical solution of the present application will be further described in detail below through specific implementation methods:

Embodiment one

As shown in Figure 1, a multi-node block chain Internet of Things data fusion method for pumping units disclosed in this embodiment includes the following steps:

S1 base station wakes up the aggregation node: in this cycle (the selection of a cycle can be determined by those skilled in the art according to the number and performance of the actual nodes), the base station selects the hash nodes that store the historical information before going up the chain according to the node information stored in the basic database. Aggregation nodes with a value of H0, and send activation information to wake up the aggregation nodes; the specific aggregation nodes have performance requirements, and the specific requirements are as follows: the main frequency of the chip is 450MHz, the number of chip cores is 2, the value of RAM is 10MB, and the value of ROM is 50MB, any value Those below the above requirements cannot be aggregated nodes;

S2 One-time verification of the hash value: the aggregation node sends the H0 stored by the aggregation node to the base station, and the base station receives the H0 of the aggregation node and recalculates the hash value H00 of the historical information stored in the basic database before going up to the chain, and then compares H0 with H00 Perform comparison to obtain the first result, if the first result is the same, execute S3; if the first result is not the same, the base station compares the received H0 of at least two aggregation nodes to obtain the second result; if the first The two results are the same, then the base station sends to the preset address an alarm message indicating that the historical information stored in the basic database has been tampered with; if the second result is not the same, the base station sends an alarm that the system cannot confirm the security to the preset address information; specifically, the default address is the URL information burned in the microcontroller.

S3 startup message: the base station broadcasts message information to the aggregation node, the aggregation node broadcasts the startup information after receiving the message information, and the ordinary node starts after receiving the first startup information and ignores other startup information. Including the address of the aggregation node, then the ordinary node is awakened, and the initial information of the required message is sent to the aggregation node according to the address of the startup information;

S4 The initial information starts to go up the chain: the aggregation node receives the initial information and processes it into the information to be linked up, and then broadcasts it to the base station and other aggregation nodes. The hash operation corresponds to generate a new hash value H1 and broadcast H1 to the outside. After receiving H1, the base station and any other aggregation node stop the unfinished hash operation, and the base station saves the information to be uploaded and H1 to the chain. Historical information generates new historical information before going up to the chain. The aggregation node updates H0 to H1 to complete an initial information uplink; when the aggregation node broadcasts H1 to the outside, it will attach a timestamp. If the base station and any other aggregation node are in When receiving two H1s at the same time, it will read the time information in the timestamp, and then recognize the H1 with time priority. In the above method, base stations or aggregation nodes with better performance can undertake more calculations to ensure processing efficiency.

S5 The initial information is uploaded to the chain: After the initial information is uploaded to the chain once, repeat S4 until no aggregation node broadcasts the information to be uploaded to the outside. After the base station does not receive the information to be uploaded within the preset time, it sends the Confirm the information and send the dormancy information to the aggregating node after receiving the receipt information of the completion of this cycle message fed back by the aggregating node. Prepare the verification of the next cycle (the HN here is the H0 of the next cycle), and then sleep;

S6 Optimize a single aggregation node: the base station records the information of the last aggregation node that fed back the message receipt information of this cycle and the time T of this cycle, and updates the common node that sends the initial information the fastest and meets the minimum performance requirements in the basic database as The newly added aggregation node sends HN to it, and the base station saves the information after the initial information is uploaded to the chain, and deletes the HN for the next cycle of verification (the HN obtained by the base station again in the next cycle is H00). That is to say, in this way, the number or proportion of aggregation nodes and ordinary nodes can be adjusted dynamically.

S7 optimizes the overall situation. The base station analyzes the time T of 50 cycles, selects the aggregation node information corresponding to the cycle with the least time, and sends activation information to wake up the aggregation node in the next cycle according to the aggregation node information.

Take a specific scenario as an example. For example, in a smart home scenario, ordinary nodes are the corresponding sensors in each room, base stations are home routers, and aggregation nodes are usually smart devices, such as smart refrigerators, sweeping robots, and even mobile phones. . For example, when there are no users, the router needs to obtain the data of each common node, but needs to ensure the security of the data. The activation information can be sent to the smart device. In this scenario, the smart device usually remains dormant but not completely shut down, so it can be woken up. Then the smart device sends H0 to the router, and the router compares H00 with H0. If the first result is the same, it is safe to proceed. If the first result is not the same, or even the second result is not the same, the router reads the information in the single-chip microcomputer that has been burned with the preset website information, and the router reads the preset website information and sends a message alarm to the preset website.

Then the smart device broadcasts the message information to the outside. After ordinary nodes such as temperature sensors and smart valves receive the message information, they feed back the relevant information to the smart device. The smart device broadcasts, and then both the smart device and the router perform a hash operation, and the calculated H1 is broadcast to the outside, and then all devices are synchronized to complete one information synchronization. Then repeat this step to complete the synchronization of information sent by all common nodes that have received message information.

After the completion, the router saves the relevant information, deletes the last hash value, and the smart device deletes the relevant information, saves the last hash value, and then checks in the next cycle to ensure the security of the information.

In another embodiment, a supplementary description is made with the use scene of the pumping unit. Ordinary nodes are sensors set on relevant nodes of pumping units, aggregation nodes are signal repeaters or sensors/controllers that meet performance requirements, and base stations are receiving terminals.

Example 2

Compared with Embodiment 1, the only difference is that in S2, if there is a certain aggregation node, the first result and the second result are different and the first results of other aggregation nodes are the same, then the base station broadcasts the aggregation node to other aggregation nodes. The aggregation node is an untrusted node, and the node information stored in the basic library of the aggregation node is changed to a normal node.

Example 3

Compared with Embodiment 1, the only difference is that in S4, the base station and other aggregation nodes that have received the information to be uplinked use H0 and the information to be uplinked to perform a hash operation to generate a new hash value H1 and send it to H1 is broadcast outside, and the base station and any other aggregation node stop the unfinished hash operation after receiving H1 twice.

Example 4

Compared with Embodiment 3, the only difference is that in S6, the base station records the information of the last aggregation node that feeds back the message receipt information of this cycle and the time T of this cycle, and updates the initial information in the basic database. The normal node that is fast and meets the minimum performance requirements sends HN to it for the newly added aggregation node. The newly added aggregation node reads and records the power supply voltage V1 in this cycle, and reads the power supply again after the next cycle is completed. Power supply voltage V2, if V1>V2, then the newly added aggregation node will feed back to the base station that the node is an energy storage device (indirect power supply device, that is, the power supply voltage of the next cycle is lower than the current power supply voltage, indicating that it is obviously Increase energy consumption, and it is not powered by the grid. If it continues to be an aggregation node, it will affect its service life), the base station will change the newly added aggregation node to a normal node in the next cycle.

The above is only an embodiment of the present invention, and the invention is not limited to the field involved in this implementation case. The common knowledge such as the specific structure and characteristics known in the scheme is not described here, and those of ordinary skill in the art know the filing date or priority All ordinary technical knowledge in the technical field to which the invention belongs before the date, can know all the prior art in this field, and have the ability to apply the conventional experimental methods before the date, those of ordinary skill in the art can, under the inspiration given by this application, To perfect and implement this solution in combination with one's own ability, some typical known structures or known methods should not become obstacles for those of ordinary skill in the art to implement this application. It should be pointed out that for those skilled in the art, under the premise of not departing from the structure of the present invention, several modifications and improvements can also be made, and these should also be regarded as the protection scope of the present invention, and these will not affect the implementation of the present invention. Effects and utility of patents. The scope of protection required by this application shall be based on the content of the claims, and the specific implementation methods and other records in the specification may be used to interpret the content of the claims.

Claims (9)

1. A block chain Internet of things data fusion method for multiple nodes of an oil pumping unit is characterized by comprising the following steps:

s1: in the period, the base station selects the aggregation node stored with the hash value H0 of the history information before uplink according to the node information stored in the basic library, and sends activation information to wake up the aggregation node;

s2: the aggregation node sends the H0 stored by the aggregation node to the base station, the base station receives the H0 of the aggregation node and recalculates the hash value H00 of the historical information before the uplink stored in the basic library, then the H0 and the H00 are compared to obtain a first result, and if the first result is the same, S3 is executed; if the first results are different, the base station compares the received H0 of the at least two aggregation nodes to obtain a second result; if the second result is the same, the base station sends alarm information that the historical information before the uplink stored in the basic library is tampered to a preset address; if the second result is different, the base station sends alarm information that the system cannot confirm the safety to the preset address;

s3: the base station broadcasts message information to the aggregation nodes, the aggregation nodes broadcast starting information after receiving the message information, the common nodes start and ignore other starting information after receiving the first starting information, the starting information comprises the address of the aggregation nodes, then the common nodes are awakened, and the initial information of the required message is sent to the aggregation nodes according to the address of the starting information;

s4: the aggregation node receives the initial information and processes the initial information into information to be uplink-linked, then broadcasts the information to the base station and other aggregation nodes, the base station and other aggregation nodes which receive the information to be uplink-linked perform Hash operation on H0 and the information to be uplink-linked to correspondingly generate a newly-added Hash value H1 and broadcast H1 outwards, the base station and any other aggregation node stop unfinished Hash operation after receiving H1, the base station stores the information to be uplink-linked and the H1 to historical information before uplink to generate new historical information before uplink, and the aggregation node updates H0 to H1 to complete uplink of the initial information;

s5: after completing the uplink of the initial information once, repeating S4 until no aggregation node broadcasts information to be uplink, after a base station does not receive the information to be uplink within a preset time, sending confirmation information to the aggregation node and sending dormancy information to the aggregation node after receiving message receipt information fed back by the aggregation node and completing the period, and after receiving the dormancy information, the aggregation node stores the last hash value HN after completing the uplink of the initial information for the verification of the next period and then sleeps;

s6: the base station records the last aggregation node information which has fed back the message receipt information of the period and the time T of the period, updates the common node which sends the initial information most quickly and meets the lowest performance requirement in the basic database as a newly added aggregation node to send HN to the base station, and stores the information after finishing the initial information uplink and deletes the HN for the next period of verification.

2. The multi-node block chain internet of things data fusion method for the pumping unit according to claim 1, characterized in that: and S7, the base station analyzes the time T of at least two periods, selects the aggregation node information corresponding to the least time period, and sends activation information to wake up the aggregation node in the next period according to the aggregation node information.

3. The multi-node block chain internet of things data fusion method for the pumping unit according to claim 2, characterized in that: in S1, the node information stored in the base repository includes the minimum performance requirement to meet the performance of the aggregation node.

4. The multi-node blockchain internet of things data fusion method for the pumping unit according to claim 3, wherein the method comprises the following steps: the performance requirements include: chip main frequency, chip core number, RAM value and ROM value.

5. The multi-node blockchain internet of things data fusion method for the pumping unit according to claim 4, wherein the method comprises the following steps: in S6, the minimum performance requirement is a preset value.

6. The multi-node blockchain internet of things data fusion method for the pumping unit according to claim 5, wherein the method comprises the following steps: in S4, when the aggregation node broadcasts the H1, a timestamp is attached, and if the base station and any other aggregation node receive two H1 simultaneously, the base station reads the time information in the timestamp, and then recognizes the H1 with the time priority.

7. The method for the data fusion of the block chain Internet of things of the pumping unit multiple nodes according to claim 6, characterized in that: in S2, the preset address is an unalterable emergency contact address preset by the user.

8. The method for the data fusion of the block chain internet of things of the pumping unit multiple nodes according to claim 7, characterized in that: in S2, if there is a certain aggregation node, the first result and the second result are different, and the first results of other aggregation nodes are the same, the base station broadcasts the aggregation node to other aggregation nodes as an untrusted node, and the node information stored in the aggregation node base library is changed to a normal node.

9. The multi-node blockchain internet of things data fusion method for the pumping unit according to claim 8, wherein the method comprises the following steps: in S4, the base station and other aggregation nodes which receive the information to be uplink perform hash operation on the H0 and the information to be uplink to generate a newly increased hash value H1 correspondingly, and broadcast the H1 outwards, and the base station and any other aggregation node stop unfinished hash operation after receiving the H1 twice.

Images