CN112527905B - Multi-node block chain Internet of things data fusion method for pumping unit - Google Patents
Multi-node block chain Internet of things data fusion method for pumping unit Download PDFInfo
- Publication number
- CN112527905B CN112527905B CN202011499117.0A CN202011499117A CN112527905B CN 112527905 B CN112527905 B CN 112527905B CN 202011499117 A CN202011499117 A CN 202011499117A CN 112527905 B CN112527905 B CN 112527905B
- Authority
- CN
- China
- Prior art keywords
- information
- node
- base station
- aggregation node
- aggregation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
- G06F16/2228—Indexing structures
- G06F16/2255—Hash tables
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/542—Event management; Broadcasting; Multicasting; Notifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Computing Systems (AREA)
- Multimedia (AREA)
- Mobile Radio Communication Systems (AREA)
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
Technical Field
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.
Background
The internet of things is that any object or process needing monitoring, connection and interaction is collected in real time through various information sensors, various required information such as sound, light, heat, electricity, mechanics, chemistry, biology, position and the like is collected, and the ubiquitous connection of objects and the ubiquitous connection of objects and people are realized through various possible network accesses, so that the intelligent sensing, identification and management of the objects and the process are realized. The internet of things is an information bearer based on the internet, a traditional telecommunication network and the like, and all common physical objects which can be independently addressed form an interconnected and intercommunicated network, and generally, a wireless sensor is used for networking.
During the operation of the internet of things, the sensor nodes are required to transmit collected data to a base station (which may also be a wireless router in some environments). The simplest way to accomplish this is to send it directly to the base station, i.e. each node in the network sends the collected data directly to the base station. However, this approach may result in a large amount of energy consumption for transmitting data for sensor nodes far away from the base station, and the service life of the node may be significantly shorter than that of sensor nodes closer to the base station in the network with the same specification. To solve the above problems, a series of data collection algorithms for the purpose of saving energy are successively proposed.
In addition to the above problems, because the existing networking devices are of various types, if effective decision making is required, a data fusion technology is required to be used for automatically analyzing and integrating a plurality of collected information under a certain criterion so as to complete the required decision making and evaluation tasks. In addition, the existing data fusion technology needs to pay attention to data verification and authentication, complex operation is added, and if more operation tasks are borne by equipment with low computational power, the time delay of the network is increased, and the robustness of the network is reduced.
In order to solve the above problems, a method for guaranteeing the security of data fusion information of the internet of things is disclosed in a patent document with chinese patent publication No. CN 102075A. By the designed supervision mechanism, the supervision information is complete and reachable, and the phenomenon that message information is maliciously discarded by other safety mechanisms when a node is attacked in the past is avoided; meanwhile, the supervision information and the fusion information are homologous, and the credibility is high. The document states that the method has low dependence on external environment factors such as hardware, use environment and the like, the cost difference of the scheme for using the newly-built network and the existing network is small, the method can cope with the change of the network and data, and the expandability is strong. However, in the using process of the scheme, data acquired by the internet of things are easily tampered, so that the reliability of the data is low, and the safety and reliability of the data need to be improved.
In the existing application scenario, the method is generally used in the environments of industrial production and smart home, and in the application scenario of smart home, a router is generally used as a base station, and various types of smart devices are used as nodes to collect and process various types of data. In an industrial scenario, for example, taking an oil pumping unit working in an oil field as an example, a plurality of nodes are usually provided to collect and process various types of data so as to ensure normal operation of the whole oil pumping unit, but because of the large number of nodes, when a certain node is not trusted (external attack or other reasons), a large potential safety hazard also exists.
Therefore, there is an urgent need for a method for fusing data of a multi-node block chain internet of things of an oil pumping unit, which aims to save energy, does not excessively increase network delay, and can ensure the safety and reliability of data.
Disclosure of Invention
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.
The application provides the following technical scheme:
a method for fusing data of a multi-node block chain Internet of things of an oil pumping unit comprises 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 piece of starting information, the starting information comprises the addresses of the aggregation nodes, then the common nodes are awakened, and the initial information of the needed message is sent to the aggregation nodes according to the addresses 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 information of the last aggregation node which feeds 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 completing the uplink of the initial information and deletes the HN for the next period of verification.
The principle and the advantages of the invention are as follows: before a period begins, node information, specifically, aggregation nodes which are common nodes are stored in a basic database of a base station, and then all pre-uplink historical information is stored; the aggregation node stores a hash value H0 corresponding to the history information before uplink in theory. After the period is started, the base station sends activation information to the aggregation node, meanwhile, the base station calculates the existing hash value H00 of the historical information before uplink, and the H0 and the H00 are compared to determine that the information in the base station and the aggregation node is not tampered. In this phase, the waiting time of the aggregation node in the wake-up phase is utilized, and in the existing whole system, the waiting time cannot be shortened generally, so that the extra time is not consumed. And because H00 is recalculated again, the credibility of the data can be ensured.
In S3 and S4, the aggregation node broadcasts the start information to the normal node, and the normal node sends the initial information to the aggregation node according to the received first start information. In such a manner, the difference of the performance of each aggregation node is fully considered, and the aggregation node with better performance (including hardware performance and network connectivity) can receive and process more information of common nodes, then broadcast the information outwards, and perform hash operation by the base station and all aggregation nodes, and finally uplink the initial information. In such a way, the reliability of information feedback from each aggregation node to the base station can be ensured. Although the base station and all aggregation nodes participate in the hash operation, and a certain amount of calculation power is wasted, actually, since only a single hash operation is performed, there is no more comparison, and the overall speed does not have a great time difference compared with the speed obtained by directly recording the hash operation through the base station in sequence without performing the hash operation. But increases the trustworthiness of the overall system.
In S5 and S6, after the cycle synchronization of the entire system in this cycle is completed, preparation for the next cycle is performed. And S6, the base station adjusts the relevant information of the aggregation node according to the time T of the period, and the optimization possibility is reserved.
In the scheme, the common node only needs to send the related information to the aggregation node, and for the common node, the purpose of saving the energy loss of the common node is achieved. And during the process of synchronizing the information of each common node, fusing and storing the data in a block chain mode. In the scheme, at the beginning stage, the base station is enabled to carry out the hash value operation by utilizing the waiting time of the awakening of the aggregation node, so that the extra waiting time delay of the system is not increased; in the process of data encryption, only the aggregation node and the base station are required to perform hash value operation, other verification processes are omitted, and compared with the direct sequential storage of the base station, excessive network delay is not increased. And because each period, the data writing is subjected to related verification every time, and the safety of the data is ensured.
And further 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.
Such an approach can enable the setting of the aggregation node to be optimized.
Further, in S1, the node information stored in the base library includes a minimum performance requirement that satisfies the performance of the aggregation node.
Such a manner 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.
The mode can ensure that the performance of the aggregation node meets the requirement.
Further, in S6, the minimum performance requirement is a preset value.
The mode can ensure that the performance of the aggregation node meets the requirement.
Further, in S4, when the aggregation node broadcasts 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 H1 with the priority of time.
The method can ensure the timeliness and accuracy of the data.
Further, in S2, the preset address is an unalterable emergency contact address preset by the user.
The mode can remind the user more conveniently and effectively.
Further, 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.
And the aggregation node is modified into a common node, so that the safety of the system is ensured.
Further, in S4, the base station and other aggregation nodes that receive the information to be uplink perform hash operation on H0 and the information to be uplink to generate a newly added hash value H1 and broadcast H1 to the outside, and the base station and any other aggregation node stop the unfinished hash operation after receiving H1 twice.
The data can be ensured to be correct by one time of verification in such a mode.
Drawings
Fig. 1 is a logic block diagram in an embodiment of the multi-node blockchain internet-of-things data fusion method for the pumping unit.
Detailed Description
The technical scheme of the application is further explained in detail through the following specific implementation modes:
example one
As shown in fig. 1, the method for data fusion of a multi-node block chain internet of things of an oil pumping unit disclosed in this embodiment includes the following steps:
s1, the base station awakens the aggregation node: in the period (one period is selected, and a person skilled in the art can determine the period according to the number and the performance of the actual nodes), the base station selects the aggregation node stored with the hash value H0 of the historical information before uplink according to the node information stored in the base library, and sends activation information to wake up the aggregation node; the specific aggregation node has performance requirements, which are as follows: the chip master frequency is 450MHz, the chip core number is 2, the RAM value is 10MB, the ROM value is 50MB, and any value lower than the requirement cannot be a polymerization node;
s2, primary verification of the hash value: 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 history information before the uplink stored in the base station, 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 warning 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; specifically, the preset address is website information burned in the single chip microcomputer.
S3, starting a message: 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 initial information start uplink: the aggregation node receives the initial information, 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 the hash value H1 outwards, the base station and any other aggregation node stop unfinished hash operation after receiving the 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 the H0 to H1 to complete uplink of the initial information; when the aggregation node broadcasts the H1 outwards, 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 priority of time. The method can ensure that the base station or the aggregation node with better performance bears more operations and ensures the processing efficiency.
S5, completing uplink by the initial information: after finishing the uplink of the initial information once, repeating the step S4 until no aggregation node broadcasts information to be uplink transmitted outwards, after the base station does not receive the information to be uplink transmitted in the preset time, transmitting confirmation information to the aggregation node and transmitting dormancy information to the aggregation node after receiving message receipt information which is fed back by the aggregation node and finishes the current period, after receiving the dormancy information, the aggregation node saves the last hash value HN after completing the uplink of the initial information for the verification of the next period (here, HN is H0 of the next period), and then the aggregation node sleeps;
s6, optimizing a single aggregation node: 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 aggregation node, stores the information after finishing the initial information uplink, and deletes the HN for the next period of verification (the HN obtained by the base station again is H00 in the next period). I.e. in such a way that a dynamic adjustment of the number or fraction of aggregated nodes and ordinary nodes is achieved.
S7, global optimization is carried out, the base station analyzes the 50-cycle time T, the aggregation node information corresponding to the cycle with the least time is selected, and the aggregation node is awakened by sending activation information according to the aggregation node information in the next cycle.
Taking a specific scenario as an example, in the scenario of an intelligent home, a common node is a corresponding sensor in each room, a base station is a router in the home, and an aggregation node is generally an intelligent device, such as an intelligent refrigerator, a sweeping robot, or even an intelligent device like a mobile phone. For example, when there is no user, the router needs to acquire data of each common node, but needs to ensure the security of the data. Activation information may be sent to the smart device. In this scenario, the smart device is typically left dormant but not completely powered off and can therefore be awakened. The smart device then sends H0 to the router, which compares H00 to H0. If the first result is the same, it is indicated to be safe and may continue. If the first result is different, even the second result is different, the router reads the information in the singlechip in which the preset website information is burnt, and the router reads the preset website information and sends information alarm to the preset website.
Then, the intelligent device broadcasts message information outwards, and after the message information is received by common nodes such as a temperature sensor and an intelligent valve, the relevant information is fed back to the intelligent device. And performing related broadcasting on the intelligent equipment, performing hash operation on the intelligent equipment and the router, calculating out-broadcasting H1, and synchronizing all the equipment to finish one-time information synchronization. And then repeating the steps to complete the synchronization of the information sent by all the common nodes receiving the message information.
After the completion, the router stores the related information, deletes the last hash value, the intelligent device deletes the related information, stores the last hash value, and checks the information again in the next period, so that the safety of the information is ensured.
In another embodiment, supplementary description is given by using the usage scenario of the pumping unit. The common node is a sensor arranged at a joint point of the pumping unit, the aggregation node is a signal repeater or a sensor/controller meeting performance requirements, and the base station is a receiving terminal.
Example 2
Compared with the embodiment 1, the 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, 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.
Example 3
Compared with the embodiment 1, the difference is that, in S4, the base station and other aggregation nodes that receive the information to be uplinked perform the hash operation on H0 and the information to be uplinked to generate the newly added hash value H1 and broadcast H1 to the outside, and the base station and any other aggregation node stop the unfinished hash operation after receiving H1 twice.
Example 4
Compared with the embodiment 3, the difference is that in S6, the base station records the aggregation node information that the last aggregation node that feeds back the message receipt information of the present period and the time T of the present period is completed, and updates the common node that sends the initial information most quickly and meets the minimum performance requirement in the basic database as the newly added aggregation node to send HN to the new aggregation node, the newly added aggregation node reads and records the power supply voltage V1 in the present period, and reads the power supply voltage V2 again after the next period is completed, if V1 is greater than V2, the newly added aggregation node feeds back the node to the base station as an energy storage device (a non-direct power supply device, that is, the power supply voltage in the next period is lower than the power supply voltage of the present period, which indicates that energy consumption is significantly increased, and is not power supplied by the power grid, and if the node continues to serve as the aggregation node, the base station changes the newly added aggregation node into the common node in the next period.
The above are only examples of the present invention, and the present invention is not limited to the field related to the embodiments, the general knowledge of the specific structures and characteristics of the embodiments is not described herein, and those skilled in the art can know all the common technical knowledge in the technical field before the application date or the priority date, can know all the prior art in the field, and have the capability of applying the conventional experimental means before the application date, and those skilled in the art can combine the capabilities of themselves to complete and implement the present invention, and some typical known structures or known methods should not become obstacles for those skilled in the art to implement the present application. It should be noted that, for those skilled in the art, without departing from the structure of the present invention, several changes and modifications can be made, which should also be regarded as the protection scope of the present invention, and these will not affect the effect of the implementation of the present invention and the practicability of the patent. The scope of the claims of the present application shall be determined by the contents of the claims, and the description of the embodiments and the like in the specification shall be used to explain the contents 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.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011499117.0A CN112527905B (en) | 2020-12-17 | 2020-12-17 | Multi-node block chain Internet of things data fusion method for pumping unit |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011499117.0A CN112527905B (en) | 2020-12-17 | 2020-12-17 | Multi-node block chain Internet of things data fusion method for pumping unit |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112527905A CN112527905A (en) | 2021-03-19 |
| CN112527905B true CN112527905B (en) | 2023-01-17 |
Family
ID=75001201
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011499117.0A Active CN112527905B (en) | 2020-12-17 | 2020-12-17 | Multi-node block chain Internet of things data fusion method for pumping unit |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112527905B (en) |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107171812A (en) * | 2017-07-18 | 2017-09-15 | 光载无限（北京）科技有限公司 | It is a kind of based on block chain without key signature infrastructure construction method |
| CN107992621A (en) * | 2017-12-22 | 2018-05-04 | 杭州云象网络技术有限公司 | A kind of intelligent cinematic industry service system based on block chain multichain technological incorporation |
| CN108632293A (en) * | 2018-05-16 | 2018-10-09 | 山东建筑大学 | Architectural Equipment Internet of things system based on block chain technology and method |
| CN109040271A (en) * | 2018-08-15 | 2018-12-18 | 深圳市引方科技有限公司 | A kind of network equipment completeness protection method under distributed environment |
| CN109302491A (en) * | 2018-11-13 | 2019-02-01 | 爱普（福建）科技有限公司 | A kind of industry internet framework and its operation method based on block chain |
| CN109460996A (en) * | 2018-10-26 | 2019-03-12 | 全链通有限公司 | Processing method, equipment and the computer readable storage medium of publicly-owned block chain |
| CN109586934A (en) * | 2018-12-27 | 2019-04-05 | 链极智能科技(上海)有限公司 | A kind of block chain bottom-layer network transaction Synchronous fluorimetry method |
| CN109961281A (en) * | 2017-12-22 | 2019-07-02 | 中国电信股份有限公司 | Flow settlement method, system and base station and computer readable storage medium |
| CN110674222A (en) * | 2019-10-08 | 2020-01-10 | 腾讯科技（深圳）有限公司 | Data sharing method, device, equipment and medium |
| CN111224804A (en) * | 2018-11-26 | 2020-06-02 | 中国移动通信集团辽宁有限公司 | Internet of things equipment initialization method and device, Internet of things equipment and storage medium |
| CN111597228A (en) * | 2020-05-13 | 2020-08-28 | 山大地纬软件股份有限公司 | Multi-chain system and method for improving block chain expansibility |
| CN111625779A (en) * | 2020-05-29 | 2020-09-04 | 河南科技大学 | Block chain-based social network digital content copyright protection method |
| CN111782551A (en) * | 2020-08-04 | 2020-10-16 | 腾讯科技（深圳）有限公司 | Test method and device for block chain item and computer equipment |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10713686B2 (en) * | 2014-03-22 | 2020-07-14 | Retailmenot, Inc. | Peer-to-peer geotargeting content with ad-hoc mesh networks |
| US10739997B2 (en) * | 2017-11-20 | 2020-08-11 | International Business Machines Corporation | Deletion of blocks in a blockchain |
| US10528776B1 (en) * | 2018-08-28 | 2020-01-07 | Digiprint Ip Llc | Tracking and authentication of products via distributed ledgers and NFC tags |
-
2020
- 2020-12-17 CN CN202011499117.0A patent/CN112527905B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107171812A (en) * | 2017-07-18 | 2017-09-15 | 光载无限（北京）科技有限公司 | It is a kind of based on block chain without key signature infrastructure construction method |
| CN109961281A (en) * | 2017-12-22 | 2019-07-02 | 中国电信股份有限公司 | Flow settlement method, system and base station and computer readable storage medium |
| CN107992621A (en) * | 2017-12-22 | 2018-05-04 | 杭州云象网络技术有限公司 | A kind of intelligent cinematic industry service system based on block chain multichain technological incorporation |
| CN108632293A (en) * | 2018-05-16 | 2018-10-09 | 山东建筑大学 | Architectural Equipment Internet of things system based on block chain technology and method |
| CN109040271A (en) * | 2018-08-15 | 2018-12-18 | 深圳市引方科技有限公司 | A kind of network equipment completeness protection method under distributed environment |
| CN109460996A (en) * | 2018-10-26 | 2019-03-12 | 全链通有限公司 | Processing method, equipment and the computer readable storage medium of publicly-owned block chain |
| CN109302491A (en) * | 2018-11-13 | 2019-02-01 | 爱普（福建）科技有限公司 | A kind of industry internet framework and its operation method based on block chain |
| CN111224804A (en) * | 2018-11-26 | 2020-06-02 | 中国移动通信集团辽宁有限公司 | Internet of things equipment initialization method and device, Internet of things equipment and storage medium |
| CN109586934A (en) * | 2018-12-27 | 2019-04-05 | 链极智能科技(上海)有限公司 | A kind of block chain bottom-layer network transaction Synchronous fluorimetry method |
| CN110674222A (en) * | 2019-10-08 | 2020-01-10 | 腾讯科技（深圳）有限公司 | Data sharing method, device, equipment and medium |
| CN111597228A (en) * | 2020-05-13 | 2020-08-28 | 山大地纬软件股份有限公司 | Multi-chain system and method for improving block chain expansibility |
| CN111625779A (en) * | 2020-05-29 | 2020-09-04 | 河南科技大学 | Block chain-based social network digital content copyright protection method |
| CN111782551A (en) * | 2020-08-04 | 2020-10-16 | 腾讯科技（深圳）有限公司 | Test method and device for block chain item and computer equipment |
Non-Patent Citations (2)
| Title |
|---|
| 《基于双区块链的基站动环信息监控系统》;樊建峰等;《计算机科学》;20190819;第46卷(第12期);155-164 * |
| 《抽油机传动系统节能研究》;张晓菊等;《机床与液压》;20201115;第48卷(第21期);111-116 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112527905A (en) | 2021-03-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2618612B1 (en) | Energy-saving management method, system for wireless sensor network and remote management server | |
| TWI517744B (en) | Apparatus and method for operating m2m devices and non-transitory computer_readable medium | |
| CN102869077B (en) | ZigBee-protocol-based data acquisition and transmission method of wireless sensor network | |
| KR102455630B1 (en) | Communication system for sensor networks | |
| CN110830267A (en) | State control method and device of network node and gateway | |
| US20120110331A1 (en) | Method for activating a network node | |
| CN106230645B (en) | Low-power-consumption wireless communication method used between monitoring node and convergence gateway | |
| CN107204999B (en) | Method and device for realizing heartbeat | |
| CN106900042B (en) | Sensor node of tree-type sensor network ad hoc network | |
| CN101541068A (en) | WLAN network control method and device thereof | |
| US10200956B2 (en) | Systems and methods for throughput enhancement among ultra-low power wireless network devices | |
| CN101801011A (en) | WSN (Wireless Sensor Network) safety routing method based on credit evaluating mechanism | |
| CN109272728A (en) | A kind of electric quantity managing method and device | |
| CN105246137B (en) | A kind of micropower wireless network data transmission method and system | |
| US10383056B2 (en) | Low power consumption networking method of 802.15.4e wireless device that takes power based on 4-20mA loop | |
| CN107534950A (en) | A kind of method and apparatus for transmitting information | |
| CN112527905B (en) | Multi-node block chain Internet of things data fusion method for pumping unit | |
| CN111246549B (en) | Method and device for providing node dormancy and wakeup time | |
| CN106714264B (en) | Energy-saving method and system for nodes of Internet of things | |
| CN101466141A (en) | Method of synchronization wireless sensing network node in a small range | |
| CN105405272A (en) | Furnace flame image monitoring system based on ZigBee and DSP (digital signal processor) techniques | |
| CN102752133B (en) | Mechanism and method for constructing consistency view in autonomous domain in credible controllable network | |
| CN115529654A (en) | Method, apparatus, storage medium, and relay device for standby communication | |
| CN112104926B (en) | Low-power consumption internet of things type telemetering measurement terminal | |
| CN112765212A (en) | Data processing method and device for transfer equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |