CN111915931A - Batch flight plan error correction method, device and system based on Mercker tree - Google Patents
Batch flight plan error correction method, device and system based on Mercker tree Download PDFInfo
- Publication number
- CN111915931A CN111915931A CN202010727104.8A CN202010727104A CN111915931A CN 111915931 A CN111915931 A CN 111915931A CN 202010727104 A CN202010727104 A CN 202010727104A CN 111915931 A CN111915931 A CN 111915931A
- Authority
- CN
- China
- Prior art keywords
- hash values
- flight plan
- tree
- batch
- hash
- 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.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G5/00—Traffic control systems for aircraft, e.g. air-traffic control [ATC]
- G08G5/003—Flight plan management
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G5/00—Traffic control systems for aircraft, e.g. air-traffic control [ATC]
- G08G5/003—Flight plan management
- G08G5/0039—Modification of a flight plan
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/12—Applying verification of the received information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
Abstract
The invention discloses a method, a device and a system for correcting errors of a batch flight plan based on a Mercker tree, and mainly aims to quickly compare and position a large number of wrong or tampered plans in the flight plan. The main technical scheme comprises: the data receiving end calculates a first Merck tree according to the received batch flight plan message; comparing hash values of corresponding nodes of a first Merck tree and a second Merck tree, wherein the second Merck tree is obtained by calculating a batch flight plan message of a data sending end and is sent to a data receiving end together with the batch flight plan message; and if the hash values corresponding to the roots of the first and second Merck trees are determined to be inconsistent, comparing the leaf node hash values, and continuously comparing the lower-level leaf node hash values according to the leaf nodes with inconsistent hash values until the final inconsistent leaf hash values are found, and executing error correction processing.
Description
Technical Field
The embodiment of the invention relates to the technical field of information processing, in particular to a method, a device and a system for correcting errors of a batch flight plan based on a Mercker tree.
Background
The Flight Plan (Flight Plan) includes Flight plans of military aviation, civil aviation and navigation, and is an important component of Flight Information (Flight Information) and is used for representing the key element Information of an airplane identifier, a take-off airport, a destination airport, a planned take-off time, a Flight route, Flight heights of all Flight segments, machine types, tasks, communication modes and the like of the current Flight. The formats of the messages between the military and civil aviation are different, but the components are different.
In practical application, when a civil aviation district administration center reports a next-day flight plan to a civil aviation bureau operation and control center, or when a navigable flight service station reports a navigable flight plan to a local air administration department, and furthermore, when a military aviation lower-level air administration department reports a flight plan to a higher-level air administration department, a large number of flight plans may be sent, message errors may be caused due to communication and the like, and malicious invasion may occur particularly during wartime or terrorist attack, and the flight plans are tampered, so that chaos and even flight conflicts are caused. Therefore, it is necessary to check the flight plans in batches quickly to find out wrong messages, and most of the current flight plan checks adopt a syntax semantic check method to check the validity of message field information, but the method cannot quickly compare a large amount of data and cannot find out errors or falsifications in a legal value range. A large amount of data cannot be compared quickly, and errors or falsifications within a legal value range cannot be found.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method, an apparatus, and a system for correcting errors in a lot of flight plans based on a mercker tree, and mainly aim to quickly compare and locate a lot of wrong or tampered plans in a flight plan.
In order to solve the above problems, embodiments of the present invention mainly provide the following technical solutions:
in a first aspect, an embodiment of the present invention provides a batch flight plan error correction method based on a mercker tree, where the method includes:
the data receiving end calculates a first Merck tree according to the received batch flight plan message;
comparing hash values of corresponding nodes of a first Merck tree and a second Merck tree, wherein the second Merck tree is obtained by calculating a batch flight plan message of a data sending end and is sent to a data receiving end together with the batch flight plan message;
and if the hash values corresponding to the roots of the first and second Merck trees are determined to be inconsistent, comparing the leaf node hash values, and continuously comparing the lower-level leaf node hash values according to the leaf nodes with inconsistent hash values until the final inconsistent leaf hash values are found, and executing error correction processing.
Optionally, calculating the first merkel tree according to the batch flight plan message sent by the data sending end includes:
calculating a hash value corresponding to each message in the batch flight plan messages;
grouping the calculated hash values pairwise;
if the number of the hash values is an even number, recalculating the two hash values to obtain a new hash value;
if the number of the hash values is an odd number, recalculating the two hash values to obtain a new hash value, and changing the number of the hash values into an even number;
and repeating the calculation until only one hash value is left to serve as the root of the first Merck tree, and finally forming a binary tree structure.
Optionally, the method further includes:
and if the hash values corresponding to the roots of the first Mercker tree and the second Mercker tree are determined to be consistent, determining that no error or tampering occurs in the batch flight plan message sent by the data sending end.
In a second aspect, an embodiment of the present invention further provides a batch flight plan error correction apparatus based on a mercker tree, including:
the calculating unit is used for calculating a first Mercker tree according to the received batch flight plan message;
the comparison unit is used for comparing the hash values of the nodes corresponding to the first Mercker tree and the second Mercker tree which are obtained by the calculation unit, wherein the second Mercker tree is obtained by calculating a batch flight plan message of a data sending end and is sent to a data receiving end together with the batch flight plan message;
and the processing unit is used for comparing the leaf node hash values when the hash values corresponding to the roots of the first and second Mercker trees compared by the comparison unit are inconsistent, and continuously comparing the lower-level leaf node hash values according to the leaf nodes with inconsistent hash values until the final inconsistent leaf hash values are found, and executing error correction processing.
Optionally, the computing unit includes:
the calculating module is used for calculating a hash value corresponding to each message in the batch flight plan messages;
the grouping module is used for grouping the hash values calculated by the first calculation module in pairs;
the first processing module is used for calculating the two hash values again to obtain a new hash value when the grouping module determines that the number of the hash values is an even number;
the second processing module is used for calculating the two hash values again to obtain a new hash value when the grouping module determines that the number of the hash values is an odd number, so that the number of the hash values is an even number;
and the third processing module is used for calculating until only one hash value is left, and the hash value is used as the root of the first Merck tree, and finally a binary tree structure is formed.
Optionally, the apparatus further comprises:
and the determining unit is used for determining that the batch flight plan message sent by the data sending end has no errors or is not tampered when the comparing unit determines that the hash values corresponding to the roots of the first and second Mercker trees are consistent.
In a third aspect, an embodiment of the present invention further provides a lot flight plan error correction system based on a mercker tree, where the system includes: a data receiving end and a data transmitting end, wherein,
the data sending end is used for calculating a hash value corresponding to each message in the batch flight plan messages and grouping the calculated hash values in pairs;
if the number of the hash values is an even number, recalculating the two hash values to obtain a new hash value;
if the number of the hash values is odd, calculating the hash value again for the last hash value, repeating the calculation until only one hash value is left as the root of the second Mercker tree, and finally forming a binary tree structure;
the data sending end is further configured to send the second merkel tree and the batch flight plan message to the data receiving end;
the data receiving end is used for receiving the batch flight plan message and the second Merck tree sent by the data sending end and calculating a first Merck tree according to the batch flight plan message;
the data receiving end is further configured to compare hash values of nodes corresponding to the first and second merkel trees, compare the leaf node hash values if it is determined that the hash values corresponding to the roots of the first and second merkel trees are inconsistent, and continue to compare the lower-level leaf node hash values according to the leaf nodes with inconsistent hash values until the final inconsistent leaf hash values are found, and perform error correction processing.
By the technical scheme, the technical scheme provided by the embodiment of the invention at least has the following advantages:
according to the method, the device and the system for correcting the error of the batch flight plan based on the Mercker tree, provided by the embodiment of the invention, a data receiving end calculates a first Mercker tree according to a received batch flight plan message; comparing hash values of corresponding nodes of a first Merck tree and a second Merck tree, wherein the second Merck tree is obtained by calculating a batch flight plan message of a data sending end and is sent to a data receiving end together with the batch flight plan message; if the hash values corresponding to the roots of the first and second Merck trees are determined to be inconsistent, leaf node hash values are compared, the lower-level leaf node hash values are continuously compared according to the leaf nodes with inconsistent hash values until the final inconsistent leaf hash values are found, and error correction processing is executed.
The foregoing description is only an overview of the technical solutions of the embodiments of the present invention, and the embodiments of the present invention can be implemented according to the content of the description in order to make the technical means of the embodiments of the present invention more clearly understood, and the detailed description of the embodiments of the present invention is provided below in order to make the foregoing and other objects, features, and advantages of the embodiments of the present invention more clearly understandable.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the embodiments of the invention. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:
FIG. 1 is a flow chart of a method for correcting errors of a batch flight plan based on a Mercker tree according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a Mercker tree according to an embodiment of the present invention;
FIG. 3 is a block diagram illustrating a batch flight plan fault correction apparatus based on the Mercker tree according to an embodiment of the present invention;
FIG. 4 is a block diagram illustrating another batch flight plan fault correction apparatus based on the Mercker tree according to an embodiment of the present invention;
FIG. 5 shows a block diagram of a lot flight plan fault correction system based on the Mercker tree according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
The embodiment of the invention provides a batch flight plan error correction method based on a Mercker tree, which comprises the following steps of:
101. the data receiving end calculates a first Merck tree according to the received batch flight plan message;
in the embodiment of the present invention, the data receiving end is taken as an example for explanation, but in practical application, the data receiving end will receive data only after the data sending end sends data.
In practical application, a data sending end calculates a hash value corresponding to each message in the batch flight plan messages; grouping the calculated hash values pairwise; if the number of the hash values is even, recalculating the two hash values to obtain a new hash value, taking the new hash value as a root node and the two hash values as leaf nodes, and repeating the calculation until only one hash value remains and taking the hash value as the root of the first Mercker tree;
and if the number of the hash values is odd, recalculating the two hash values to obtain a new hash value, recalculating the last hash value, and taking the new hash value as the root of the second Mercker tree.
The merkel tree is essentially a binary hash tree, i.e., a binary tree that stores hash values. The embodiment of the invention constructs the Mercker tree of the batch flight plan, and a receiver compares the original batch message with the Mercker tree of the received batch message quickly to compare a large amount of flight plan data and position an error message.
102. Comparing hash values of corresponding nodes of a first Merck tree and a second Merck tree, wherein the second Merck tree is obtained by calculating a batch flight plan message of a data sending end and is sent to a data receiving end together with the batch flight plan message;
if the hash values corresponding to the roots of the first and second merkel trees are determined to be inconsistent, executing step 103; if it is determined that the hash values corresponding to the roots of the first and second merkel trees are consistent, step 104 is executed.
In the embodiment of the invention, the hash values corresponding to the roots of the first Mercker tree and the second Mercker tree are compared firstly, and if the root verification is successful, other leaf nodes do not need to be verified continuously, so that a large amount of verification and comparison time can be saved.
In practical application, the data sending end transmits the second Mercker tree through the background, so that the user cannot see the second Mercker tree, and the flight plan content can be prevented from being tampered
103. And comparing the leaf node hash values, continuously comparing the leaf node hash values of the lower level according to the leaf nodes with inconsistent hash values until the final inconsistent leaf hash values are found, and executing error correction processing.
And if the root hash value verification fails, continuously verifying lower-level leaf node hash values of which the hash values are inconsistent (verification fails) until the tampered flight plan can be finally determined.
104. And determining that the batch flight plan message sent by the data sending end is not tampered.
According to the error correction method for the batch flight plan based on the Mercker tree, provided by the embodiment of the invention, a data receiving end calculates a first Mercker tree according to a received batch flight plan message; comparing hash values of corresponding nodes of a first Merck tree and a second Merck tree, wherein the second Merck tree is obtained by calculating a batch flight plan message of a data sending end and is sent to a data receiving end together with the batch flight plan message; if the hash values corresponding to the roots of the first and second Merck trees are determined to be inconsistent, leaf node hash values are compared, the lower-level leaf node hash values are continuously compared according to the leaf nodes with inconsistent hash values until the final inconsistent leaf hash values are found, and error correction processing is executed.
When the data sending end and the data receiving end generate the Mercker trees, the same implementation mode is adopted, and when the data receiving end generates the first Mercker tree, the hash value corresponding to each message in the batch flight plan messages is calculated firstly; grouping the calculated hash values pairwise; if the number of the hash values is an even number, recalculating the two hash values to obtain a new hash value; and if the number of the hash values is an odd number, calculating the hash value again for the last hash value to ensure that the number of the hash values is changed into an even number, repeating the calculation until only one hash value is left as the root of the second Mercker tree, and finally forming a binary tree structure. It should be noted that the first and second embodiments of the present invention are only used to distinguish data used by a data receiving end and a data sending end, and do not represent priority or a data generation order.
Specific examples will be described below, but specific fields or values appearing in the following embodiments are merely illustrative examples and are not intended to be limiting.
Explaining by taking 4 batch flight plan messages as an example, a first merkel tree of 4 flight plans at the receiving end is constructed, a schematic diagram is shown in fig. 2, and hash values corresponding to the first merkel tree are shown in table 1. In this example, the change of data in Plan2 in transmission is taken as an example, i.e. GAD is changed to GAR, and the hash value corresponding to the second Mercker tree is shown in Table 2.
TABLE 1 Hash values corresponding to the first Merck Tree
TABLE 2 second Mercker Tree corresponding Hash values
Since the mercker tree-based batch flight plan error correction device described in this embodiment is a device capable of executing the mercker tree-based batch flight plan error correction method in the embodiment of the present invention, based on the mercker tree-based batch flight plan error correction method described in the embodiment of the present invention, those skilled in the art can understand the specific implementation manner and various variations of the mercker tree-based batch flight plan error correction device described in this embodiment, and therefore, how the mercker tree-based batch flight plan error correction device implements the mercker tree-based batch flight plan error correction method in the embodiment of the present invention is not described in detail here. The scope of the present application is intended to be covered by the appended claims so long as those skilled in the art can implement the method for error correction of batch flight plans based on the merkel tree in the embodiments of the present invention.
An embodiment of the present invention further provides a batch flight plan error correction device based on the mercker tree, as shown in fig. 3, including:
the calculating unit 21 is configured to calculate a first merck tree according to the received batch flight plan message;
a comparing unit 22, configured to compare hash values of corresponding nodes of the first and second merkel trees obtained by the calculating unit, where the second merkel tree is calculated from a batch flight plan message of the data sending end, and is sent to the data receiving end together with the batch flight plan message;
the processing unit 23 is configured to compare the leaf node hash values when the hash values corresponding to the roots of the first and second merkel trees compared by the comparison unit are inconsistent, and continue to compare the lower-level leaf node hash values according to the leaf nodes with inconsistent hash values until the final inconsistent leaf hash value is found, and perform error correction processing.
Further, as shown in fig. 4, the calculation unit 21 includes:
a calculating module 211, configured to calculate a hash value corresponding to each message in the batch flight plan messages;
a grouping module 212, configured to group the hash values calculated by the first calculation module 211 two by two;
the first processing module 213, configured to calculate two hash values again to obtain a new hash value when the grouping module 212 determines that the number of hash values is an even number;
a second processing module 214, configured to, when the grouping module 213 determines that the number of hash values is an odd number, calculate a hash value again for the last hash value, so that the number of hash values becomes an even number;
the third processing module 215 is configured to calculate until only one hash value remains as the root of the first merkel tree, and finally form a binary tree structure.
Further, as shown in fig. 4, the apparatus further includes:
a determining unit 24, configured to determine that no error or tampering occurs in the batch flight plan message sent by the data sending end when the comparing unit 22 determines that the hash values corresponding to the roots of the first merkel tree and the second merkel tree are consistent.
Further, as shown in fig. 5, an embodiment of the present invention further provides an error correction system for a batch flight plan based on a mercker tree, where the system includes: a data receiving end 32, and a data transmitting end 31, wherein,
the data sending end 31 is configured to calculate a hash value corresponding to each message in the batch flight plan messages, and group the calculated hash values into two groups;
if the number of the hash values is an even number, recalculating the two hash values to obtain a new hash value;
if the number of the hash values is an odd number, the hash value is calculated again for the last hash value, so that the number of the hash values is changed into an even number; repeating the calculation until only one hash value is left as the root of the second Merck tree, and finally forming a binary tree structure;
the data sending end 31 is further configured to send the second merkel tree and the batch flight plan message to the data receiving end 32;
the data receiving end 32 is configured to receive the batch flight plan message and the second merkel tree sent by the data sending end 31, and calculate a first merkel tree according to the batch flight plan message;
the data receiving end 32 is further configured to compare hash values of nodes corresponding to the first and second merkel trees, compare hash values of leaf nodes if it is determined that hash values corresponding to roots of the first and second merkel trees are not consistent, and continue to compare hash values of lower-level leaf nodes according to leaf nodes with inconsistent hash values until a final inconsistent leaf hash value is found, and perform error correction processing.
According to the device and the system for correcting the batch flight plan based on the Mercker tree, provided by the embodiment of the invention, a data receiving end calculates a first Mercker tree according to a received batch flight plan message; comparing hash values of corresponding nodes of a first Merck tree and a second Merck tree, wherein the second Merck tree is obtained by calculating a batch flight plan message of a data sending end and is sent to a data receiving end together with the batch flight plan message; if the hash values corresponding to the roots of the first and second Merck trees are determined to be inconsistent, leaf node hash values are compared, next-level leaf node hash values are continuously compared according to leaf nodes with inconsistent hash values until the final inconsistent leaf hash values are found, and error correction processing is executed
The present embodiments provide a non-transitory computer-readable storage medium storing computer instructions that cause the computer to perform the methods provided by the method embodiments described above.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). The memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus 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, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in the process, method, article, or apparatus that comprises the element.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The above are merely examples of the present application and are not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (7)
1. A batch flight plan error correction method based on a Mercker tree is characterized by comprising the following steps:
the data receiving end calculates a first Merck tree according to the received batch flight plan message;
comparing hash values of corresponding nodes of a first Merck tree and a second Merck tree, wherein the second Merck tree is obtained by calculating a batch flight plan message of a data sending end and is sent to a data receiving end together with the batch flight plan message;
and if the hash values corresponding to the roots of the first and second Merck trees are determined to be inconsistent, comparing the leaf node hash values, and continuously comparing the lower-level leaf node hash values according to the leaf nodes with inconsistent hash values until the final inconsistent leaf hash values are found, and executing error correction processing.
2. The method of claim 1, wherein the data receiving end calculating the first merkel tree from the received batch flight plan message comprises:
calculating a hash value corresponding to each message in the batch flight plan messages;
grouping the calculated hash values pairwise;
if the number of the hash values is an even number, recalculating the two hash values to obtain a new hash value;
if the number of the hash values is an odd number, the hash value is calculated again for the last hash value, so that the number of the hash values is changed into an even number;
and repeating the calculation until only one hash value is left to serve as the root of the first Merck tree, and finally forming a binary tree structure.
3. The method of claim 1, further comprising:
and if the hash values corresponding to the roots of the first Mercker tree and the second Mercker tree are determined to be consistent, determining that no error or tampering occurs in the batch flight plan message sent by the data sending end.
4. A lot flight plan error correction device based on a Mercker tree is characterized by comprising:
the calculating unit is used for calculating a first Mercker tree according to the received batch flight plan message;
the comparison unit is used for comparing the hash values of the nodes corresponding to the first Mercker tree and the second Mercker tree which are obtained by the calculation unit, wherein the second Mercker tree is obtained by calculating a batch flight plan message of a data sending end and is sent to a data receiving end together with the batch flight plan message;
and the processing unit is used for comparing the leaf node hash values when the hash values corresponding to the roots of the first and second Mercker trees compared by the comparison unit are inconsistent, and continuously comparing the lower-level leaf node hash values according to the leaf nodes with inconsistent hash values until the final inconsistent leaf hash values are found, and executing error correction processing.
5. The apparatus of claim 4, wherein the computing unit comprises:
the calculating module is used for calculating a hash value corresponding to each message in the batch flight plan messages;
the grouping module is used for grouping the hash values calculated by the first calculation module in pairs;
the first processing module is used for calculating the two hash values again to obtain a new hash value when the grouping module determines that the number of the hash values is an even number;
the second processing module is used for calculating the hash value again for the last hash value when the grouping module determines that the number of the hash values is an odd number, so that the number of the hash values is an even number;
and the third processing module is used for calculating until only one hash value is left, and the hash value is used as the root of the first Merck tree, and finally a binary tree structure is formed.
6. The apparatus of claim 4, further comprising:
and the determining unit is used for determining that the batch flight plan message sent by the data sending end has no errors or is not tampered when the comparing unit determines that the hash values corresponding to the roots of the first and second Mercker trees are consistent.
7. A mercker tree based bulk flight plan correction system, the system comprising: a data receiving end and a data transmitting end, wherein,
the data sending end is used for calculating a hash value corresponding to each message in the batch flight plan messages and grouping the calculated hash values in pairs;
if the number of the hash values is an even number, recalculating the two hash values to obtain a new hash value;
if the number of the hash values is an odd number, the hash value is calculated again for the last hash value, so that the number of the hash values is changed into an even number; repeating the calculation until only one hash value is left as the root of the second Merck tree, and finally forming a binary tree structure;
the data sending end is further configured to send the second merkel tree and the batch flight plan message to the data receiving end;
the data receiving end is used for receiving the batch flight plan message and the second Merck tree sent by the data sending end and calculating a first Merck tree according to the batch flight plan message;
the data receiving end is further configured to compare hash values of nodes corresponding to the first and second merkel trees, compare the leaf node hash values if it is determined that the hash values corresponding to the roots of the first and second merkel trees are inconsistent, and continue to compare the lower-level leaf node hash values according to the leaf nodes with inconsistent hash values until the final inconsistent leaf hash values are found, and perform error correction processing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010727104.8A CN111915931A (en) | 2020-07-26 | 2020-07-26 | Batch flight plan error correction method, device and system based on Mercker tree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010727104.8A CN111915931A (en) | 2020-07-26 | 2020-07-26 | Batch flight plan error correction method, device and system based on Mercker tree |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111915931A true CN111915931A (en) | 2020-11-10 |
Family
ID=73280811
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010727104.8A Pending CN111915931A (en) | 2020-07-26 | 2020-07-26 | Batch flight plan error correction method, device and system based on Mercker tree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111915931A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20220286277A1 (en) * | 2021-03-08 | 2022-09-08 | Black Sesame Technologies Inc. | Unmanned driving information storage and playback method, device and storage medium |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104901946A (en) * | 2015-04-10 | 2015-09-09 | 中国民航大学 | Civil aviation SWIM user authentication method based on improved Diameter/EAP-MD5 protocol |
| CN105072086A (en) * | 2015-07-06 | 2015-11-18 | 武汉科技大学 | Cloud-storage batch auditing method based on MapReduce |
| CN105336220A (en) * | 2015-12-08 | 2016-02-17 | 成都民航空管科技发展有限公司 | Related correction method of air traffic control automatic system flight plans |
| CN105528678A (en) * | 2015-12-10 | 2016-04-27 | 中国航空工业集团公司西安航空计算技术研究所 | Airborne flight plan management system of a general-purpose aircraft |
| CN105739535A (en) * | 2016-04-29 | 2016-07-06 | 竒葩网络（深圳）有限公司 | Unmanned aerial vehicle flight control method, unmanned aerial vehicle flight control device and unmanned aerial vehicle flight control system |
| CN106407795A (en) * | 2016-09-05 | 2017-02-15 | 北京众享比特科技有限公司 | Data existence authentication system, authentication method and verification method |
| CN107094148A (en) * | 2017-05-09 | 2017-08-25 | 电子科技大学 | A kind of unmanned plane block chain management and control strategy of resisting quantum computation attack |
| US10062292B2 (en) * | 2016-03-08 | 2018-08-28 | International Business Machines Corporation | Programming language for execution by drone |
| CN108897760A (en) * | 2018-05-22 | 2018-11-27 | 贵阳信息技术研究院（中科院软件所贵阳分部） | Electronic evidence chain integrity verification method based on Merkel tree |
| CN109885629A (en) * | 2019-01-14 | 2019-06-14 | 平安科技（深圳）有限公司 | A kind of unmanned plane management method, device, computer system and readable storage medium storing program for executing |
| CN110832825A (en) * | 2017-05-22 | 2020-02-21 | 维萨国际服务协会 | Network for increasing verification speed by preventing data from being tampered |
| CN111177795A (en) * | 2019-12-13 | 2020-05-19 | 杜晓楠 | Method, device and computer storage medium for identifying video tampering by using block chain |
| CN111326026A (en) * | 2020-02-26 | 2020-06-23 | 中国人民解放军空军研究院战略预警研究所 | Flight information reporting address cooperative generation and dynamic maintenance method |
-
2020
- 2020-07-26 CN CN202010727104.8A patent/CN111915931A/en active Pending
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104901946A (en) * | 2015-04-10 | 2015-09-09 | 中国民航大学 | Civil aviation SWIM user authentication method based on improved Diameter/EAP-MD5 protocol |
| CN105072086A (en) * | 2015-07-06 | 2015-11-18 | 武汉科技大学 | Cloud-storage batch auditing method based on MapReduce |
| CN105336220A (en) * | 2015-12-08 | 2016-02-17 | 成都民航空管科技发展有限公司 | Related correction method of air traffic control automatic system flight plans |
| CN105528678A (en) * | 2015-12-10 | 2016-04-27 | 中国航空工业集团公司西安航空计算技术研究所 | Airborne flight plan management system of a general-purpose aircraft |
| US10062292B2 (en) * | 2016-03-08 | 2018-08-28 | International Business Machines Corporation | Programming language for execution by drone |
| CN105739535A (en) * | 2016-04-29 | 2016-07-06 | 竒葩网络（深圳）有限公司 | Unmanned aerial vehicle flight control method, unmanned aerial vehicle flight control device and unmanned aerial vehicle flight control system |
| CN106407795A (en) * | 2016-09-05 | 2017-02-15 | 北京众享比特科技有限公司 | Data existence authentication system, authentication method and verification method |
| CN107094148A (en) * | 2017-05-09 | 2017-08-25 | 电子科技大学 | A kind of unmanned plane block chain management and control strategy of resisting quantum computation attack |
| CN110832825A (en) * | 2017-05-22 | 2020-02-21 | 维萨国际服务协会 | Network for increasing verification speed by preventing data from being tampered |
| CN108897760A (en) * | 2018-05-22 | 2018-11-27 | 贵阳信息技术研究院（中科院软件所贵阳分部） | Electronic evidence chain integrity verification method based on Merkel tree |
| CN109885629A (en) * | 2019-01-14 | 2019-06-14 | 平安科技（深圳）有限公司 | A kind of unmanned plane management method, device, computer system and readable storage medium storing program for executing |
| CN111177795A (en) * | 2019-12-13 | 2020-05-19 | 杜晓楠 | Method, device and computer storage medium for identifying video tampering by using block chain |
| CN111326026A (en) * | 2020-02-26 | 2020-06-23 | 中国人民解放军空军研究院战略预警研究所 | Flight information reporting address cooperative generation and dynamic maintenance method |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20220286277A1 (en) * | 2021-03-08 | 2022-09-08 | Black Sesame Technologies Inc. | Unmanned driving information storage and playback method, device and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109889505B (en) | Data consistency verification method and terminal equipment | |
| JP6716727B2 (en) | Streaming data distributed processing method and apparatus | |
| CN107219997B (en) | Method and device for verifying data consistency | |
| CN109889375A (en) | Service message method of calibration, device and computer storage medium | |
| CN111262868B (en) | Message sending method and receiving method based on intelligent network card | |
| CN112380294B (en) | Block chain cross-chain access method and device | |
| CN111309523A (en) | Data reading and writing method, data remote copying method and device and distributed storage system | |
| EP4195598A1 (en) | In-vehicle signal transmission method and system | |
| CN111915931A (en) | Batch flight plan error correction method, device and system based on Mercker tree | |
| CN110928891B (en) | Data consistency detection method, device, computing equipment and medium | |
| US10289384B2 (en) | Methods, systems, and computer readable media for processing data containing type-length-value (TLV) elements | |
| CN106708648B (en) | A kind of the storage method of calibration and system of text data | |
| CN104601645A (en) | Data packet processing method and device | |
| CN104598463A (en) | Method and method for switching database | |
| CN104618414A (en) | Implementation method of distributed service, service agent device and distributed system | |
| CN107168866A (en) | A kind of Parameter analysis of electrochemical method and device of configuration file | |
| CN103373376B (en) | A kind of universal method and system obtaining railway monitored signal facility information | |
| CN115795187A (en) | Resource access method, device and equipment | |
| CN112732164A (en) | Cross-node data group management method, device and medium | |
| CN112084006B (en) | Mirror image package processing method and device and electronic equipment | |
| CN115129728A (en) | File checking method and device | |
| CN111934851A (en) | Flight plan verification method and device based on Hash algorithm | |
| US10044469B2 (en) | Communication device and communication method | |
| CN106469172A (en) | The data-updating method of distributed file system and device | |
| CN110020348B (en) | Early warning method and device for circled events |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20201110 |
|
| RJ01 | Rejection of invention patent application after publication |