CN113379351B - Transportation order information storage method based on block chain - Google Patents
Transportation order information storage method based on block chain Download PDFInfo
- Publication number
- CN113379351B CN113379351B CN202110691114.5A CN202110691114A CN113379351B CN 113379351 B CN113379351 B CN 113379351B CN 202110691114 A CN202110691114 A CN 202110691114A CN 113379351 B CN113379351 B CN 113379351B
- Authority
- CN
- China
- Prior art keywords
- abstract
- road
- driver
- information
- keyword
- 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
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/08—Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
- G06Q10/083—Shipping
- G06Q10/0832—Special goods or special handling procedures, e.g. handling of hazardous or fragile goods
-
- 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
-
- 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/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Business, Economics & Management (AREA)
- Databases & Information Systems (AREA)
- Economics (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Development Economics (AREA)
- Data Mining & Analysis (AREA)
- Entrepreneurship & Innovation (AREA)
- Computing Systems (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- General Engineering & Computer Science (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Power Engineering (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a transportation order information storage method based on a block chain, which comprises the following steps: the method comprises the following steps that a shipper publishes cargo source information, a driver quotes and accepts orders, the shipper selects the driver to carry and generate a transportation order, the driver arrives at a loading place to complete loading, the driver arrives at a unloading place to complete transportation, the shipper confirms to sign for, and the shipper pays a freight fee. Inputting the information of each step into a hash function to obtain a digital abstract, and writing the digital abstract and the information of each step into a block chain. The method stores the transportation order information in the block chain, and ensures the authenticity, the non-tampering and the safety of data storage of each step of the transportation order by utilizing the characteristics of distributed storage and data non-tampering of the block chain.
Description
Technical Field
The invention relates to the logistics transportation industry, in particular to a transportation order information storage method based on a block chain.
Background
At present, the logistics transportation market in China is huge, the logistics transportation industry is developed rapidly, and with the development of internet technology in recent years, the informatization of the logistics transportation industry can effectively help logistics enterprises to reduce the transportation cost and improve the operation efficiency. The traditional information technology data are all stored in a centralized database, and if a database backup strategy is not well done, the data are easily lost once the database has problems; in addition, the data in the database can be changed at will, and the application scene requiring the authenticity of the data has no authority.
Disclosure of Invention
The invention aims to at least solve the technical problems in the prior art, and particularly creatively provides a transportation order information storage method based on a block chain.
In order to achieve the above object, the present invention provides a transportation order information storage method based on a block chain, including the following steps:
s1, receiving goods source information issued by a goods main terminal, inputting the goods source information into a hash function to obtain a digital abstract, and writing the digital abstract and the goods source information into a block chain;
s2, displaying the goods source information to a driver end, and then receiving quotation order receiving information from the driver end; inputting the driver quotation receipt information into a hash function to obtain a digital abstract, and writing the digital abstract and the driver quotation receipt information into a block chain;
s3, after receiving the selected driver carrying information from the cargo owner end, generating transportation order information; inputting the transportation order information into a hash function to obtain a digital abstract, and writing the digital abstract and the transportation order information into a block chain;
s4, judging whether the driver arrives at a loading place, if so, judging whether loading is finished, and if so, generating loading finishing information of the driver; inputting the driver loading completion information into a Hash function to obtain a digital abstract, and writing the digital abstract and the driver loading completion information into a block chain;
s5, judging whether the driver arrives at the unloading place, if so, judging whether unloading is finished, and if so, generating unloading finishing information of the driver; inputting the unloading completion information of the driver into a Hash function to obtain a digital abstract, and writing the digital abstract and the unloading completion information of the driver into a block chain;
s6, receiving the confirmation signing information from the goods owner, inputting the confirmation signing information into a hash function to obtain a digital abstract, and writing the digital abstract and the confirmation signing information into a block chain;
and S7, the freight is sent to a driver end, the freight payment information is input into a Hash function to obtain a digital abstract, and the digital abstract and the freight payment information are written into a block chain.
In a preferred embodiment of the present invention, the step S3 includes generating a transportation path for a driver carrying the transportation order, and the method of generating the transportation path includes:
planning a first conveying path and a second conveying path according to one or any combination information of a discharging place, a loading place, conveying time, a truck weight parameter and a truck size parameter;
the road screening of the first carrying path and the second carrying path comprises the following steps:
S-A, judging whether the road to be screened meets the weight parameter and the size parameter of the truck, and if so, executing the next step;
S-B, splitting each road to be screened into N sections of A-level roads and M sections of B-level roads according to the information of the unloading place and the loading place; n and M are positive integers greater than or equal to 2;
and S-C, selecting the path with the most A-level roads as a first conveying path, and selecting the path with the second most A-level roads as a second conveying path.
In a preferred embodiment of the present invention, the determination criteria for the a-level road and the B-level road include one or any combination of the following: the highest speed limit of the road, the number of traffic lights, the road congestion condition, the road charging condition and the width of the road; and respectively giving different weights to the judgment standards;
if the highest speed limit of the road is lower than a preset driving speed threshold, the road is judged to be a B-level road, and if the highest speed limit of the road is higher than or equal to the preset driving speed threshold, the road is judged to be an A-level road; if the number of the traffic lights of the road is greater than a preset traffic light threshold value, judging the road as a B-level road, and if the number of the traffic lights of the road is less than or equal to the preset traffic light threshold value, judging the road as an A-level road; if the road congestion condition of the road is higher than a preset road congestion threshold value, determining the road as a B-level road, and if the road congestion condition of the road is lower than or equal to the preset road congestion threshold value, determining the road as an A-level road; if the road has a charging condition, determining the road as a B-level road, and if the road has no charging condition, determining the road as an A-level road; and if the width of the road is greater than or equal to the preset road width threshold value, determining the road as the A-level road, and if the width of the road is less than the preset road width threshold value, determining the road as the B-level road.
In a preferred embodiment of the present invention, the generating a conveyance path further includes:
and refreshing the road information at intervals of Xmin, wherein X is a positive number, and min represents time point.
In a preferred embodiment of the present invention, the S4 includes:
s4-1, judging whether the driver arrives at a loading place, and if so, executing the next step;
s4-2, searching currently available temporary stop points after receiving a crossing occupation request from a driver end;
s4-3, receiving information of occupying the temporary stop points sent by a driver end, and displaying a path guide picture;
s4-3, judging whether the driver arrives at a loading place, and if so, executing the next step;
and S4-4, receiving a picture of finished goods loading from a driver end, and scanning the picture to judge whether the goods loading is finished.
In a preferred embodiment of the present invention, the S5 includes:
s5-1, judging whether the driver arrives at a unloading place, and if so, executing the next step;
s5-2, searching currently available temporary stop points after receiving a crossing occupation request from a driver end;
s5-3, receiving information of occupying temporary stop points sent from a driver end, and displaying a path guide picture;
s5-3, judging whether the driver arrives at the unloading place, and if so, executing the next step;
and S5-4, receiving a picture of finished unloading from a driver end, and scanning the picture to judge whether the unloading is finished.
In a preferred embodiment of the present invention, the system further comprises a message prompt applied to the owner end and the driver end, wherein the message prompt comprises:
when the transportation order information is generated, the goods main end receives the message prompt of generating the transportation order information;
when the driver arrives at the loading place, the cargo owner end receives the message prompt that the driver arrives at the loading place;
when the driver arrives at the unloading place, the cargo main end receives a message prompt that the driver arrives at the unloading place;
when the goods owner confirms the signing information, the driver end receives the message prompt of the goods owner confirming the signing information;
when the freight is sent to the driver end, the driver end receives the message prompt of the freight being sent to the account.
In a preferred embodiment of the present invention, when the owner terminal communicates with the driver terminal, the safety processing is performed on the information sent by the owner terminal or/and the driver terminal, and the information safety processing method includes the following steps:
s81, extracting keywords to be sent to the opposite side information; the key words comprise one or any combination of mobile phone numbers, identification card numbers and bank card numbers;
s82, inputting the extracted keywords into a Hash function to obtain a keyword digital abstract;
s83, converting the keyword digital abstract obtained in the step S82 into a hexadecimal abstract value;
s84, sequentially filling each character in the hexadecimal abstract value into a safety form, wherein the form is i rows and j columns, and has (i-1) x (j-1) safety squares in total, the safety form comprises character squares capable of being filled and character squares incapable of being filled, the result in the character squares incapable of being filled is the result of adjacent character squares capable of being filled with 1, the character squares incapable of being filled and the character squares capable of being filled are alternately appeared, no more than three character squares capable of being filled are arranged between two character squares incapable of being filled in the same row, and no more than three character squares capable of being filled in are arranged between two character squares capable of being filled; extracting results in the safety form to obtain a result to be sent, and sending the result to be sent to a counterpart terminal;
and S85, the opposite side receives the result to be sent by the sending end, fills the received result to be sent into a safety form, extracts the result which can be filled into the character grid in the form to obtain the safety result value of the form, and queries by using the obtained safety result value to obtain the corresponding keyword.
In a preferred embodiment of the present invention, in step S83, the method for converting the keyword digital digest into a hexadecimal digest value comprises the following steps:
s831, judging whether the keyword digital abstract is hexadecimal or not:
if the keyword digital abstract is hexadecimal, the keyword digital abstract is a hexadecimal abstract value;
if the key word digit abstract is not hexadecimal, executing the next step;
s832, if the keyword digital abstract is in a P scale, P =2, 3, 4, \8230;, 15; the method for converting the keyword digital abstract of the P system into the abstract value of the hexadecimal system comprises the following steps:
s8321, converting the P-system keyword digital abstract into a decimal abstract value, wherein the method comprises the following steps:
U＝P 1 *P p-1 +P 2 *P p-2 +P 3 *P p-3 +…+P p ，
wherein, P 1 A value representing the 1 st digit from left to right in the keyword digital summary in P-ary;
P 2 a 2 nd digit value from left to right in the keyword digital summary of the P-ary;
P 3 a value representing the 3 rd digit from left to right in the keyword digital summary in P-ary;
P p a P-th digit value from left to right in the P-ary keyword digital summary is represented;
p represents the total number of digits of the keyword digital abstract in the P system;
u represents a decimal digest value;
s8322, the decimal abstract value U is converted into a hexadecimal abstract value, and the method comprises the following steps:
dividing the decimal digest value U by 16 to obtain a first quotient and a first remainder;
judging the relation between the first quotient and 16:
if the first quotient is greater than or equal to 16, the first quotient is divided by 16 to obtain a second quotient and a second remainder;
if the first quotient is less than 16, ending;
judging the relationship between the second quotient and 16:
if the second quotient is greater than or equal to 16, dividing the second quotient by 16 to obtain a third quotient and a third remainder;
if the second quotient is less than 16, ending;
judging the relationship between the third quotient and 16:
if the third quotient is greater than or equal to 16, dividing the third quotient by 16 to obtain a fourth quotient and a fourth remainder;
until the obtained quotient is less than 16; when the method is finished, writing a first remainder, a second remainder, a third remainder, a fourth remainder, \8230;. The last quotient obtained from right to left, wherein the written result is a hexadecimal digest value.
In a preferred embodiment of the present invention, in step S831, the method for determining whether the keyword digital abstract is hexadecimal includes the following steps:
s831-1, arranging all characters in the keyword digital abstract from big to small, wherein the numerical value of the character A or a is 10, the numerical value of the character B or B is 11, the numerical value of the character C or C is 12, the numerical value of the character D or D is 13, the numerical value of the character E or E is 14, the numerical value of the character F or F is 15, and obtaining a character string Q thereof 1 Q 2 Q 3 …Q q Wherein Q is 1 Representing the 1 st large character, Q, in a keyword digital summary 2 Representing the 2 nd largest character in the keyword digital summary, Q 3 Represents the 3 rd largest character, Q, in the keyword digital summary q Representing the qth large character in the keyword digital abstract, wherein q represents the total number of characters in the keyword digital abstract;
s831-2, extraction thereofThe 1 st large character Q in the keyword digital abstract 1 Relationship between character F and character F:
if Q 1 = F or Q 1 If not, the keyword digital abstract is hexadecimal;
if Q 1 Not equal to F and Q 1 If not, the key word number abstract is not hexadecimal; executing the next step;
s831-3, if Q 1 = E or Q 1 If the key word digital abstract is fifteen system;
if Q 1 Not equal to E and Q 1 If not, the key word number abstract is not a pentadecan system; executing the next step;
s831-4, if Q 1 = D or Q 1 If the number is not less than d, the keyword digital abstract is fourteen-system;
if Q 1 Not equal to D and Q 1 D, the key word number abstract is not fourteen-system; executing the next step;
s831-5, if Q 1 = C or Q 1 If the key word digital abstract is thirteen-system, the key word digital abstract is thirteen-system;
if Q 1 Not equal to C and Q 1 Not equal to c, the key word number abstract is not thirteen-system; executing the next step;
s831-6, if Q 1 = B or Q 1 If the key word number abstract is twelve-system number, the key word number abstract is twelve-system number;
if Q 1 Not equal to B and Q 1 B, the key word number abstract is not a twelve-system; executing the next step;
s831-7, if Q 1 = A or Q 1 If the key word digital abstract is an eleven-system;
if Q 1 Not equal to A and Q 1 Not equal to a, the key word number abstract is not an eleven-system; executing the next step;
s831-8, if Q 1 =9, then keyword number digest is decimal;
if Q 1 Not equal to 9, the key word number abstract is not decimal; executing the next step;
s831-9, if Q 1 =8, then the keyword number digest isA nine-system;
if Q 1 Not equal to 8, the key word number abstract is not a nine-system; executing the next step;
s831-10, if Q 1 If not, the keyword digital abstract is octal;
if Q 1 Not equal to 7, the key word number abstract is not an octal system; executing the next step;
s831-11, if Q 1 If =6, the keyword digital abstract is in a seven-system;
if Q 1 Not equal to 6, the key word number abstract is not a seven-system; executing the next step;
s831-12, if Q 1 If the key word digital abstract is in a six-system form, the key word digital abstract is in a six-system form;
if Q 1 Not equal to 5, the key word number abstract is not a six-system; executing the next step;
s831-13, if Q 1 If the keyword digital abstract is in a quinary system, the keyword digital abstract is in a quinary system;
if Q 1 Not equal to 4, the key word number abstract is not a quinary system; executing the next step;
s831-14, if Q 1 If =3, the keyword digital abstract is quaternary;
if Q 1 Not equal to 3, the key word number abstract is not quaternary; executing the next step;
s831-15, if Q 1 If the key word number abstract is ternary, the key word number abstract is ternary;
if Q 1 Not equal to 2, the keyword digital abstract is binary.
In summary, due to the adoption of the technical scheme, the safety and the authenticity of the transportation order information can be ensured by the transportation order information storage method based on the block chain.
Additional aspects and advantages of the invention will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the invention.
Drawings
The above and/or additional aspects and advantages of the present invention will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:
FIG. 1 is a schematic of the process of the present invention.
Detailed Description
Reference will now be made in detail to embodiments of the present invention, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the accompanying drawings are illustrative only for the purpose of explaining the present invention, and are not to be construed as limiting the present invention.
The invention provides a transportation order information storage method based on a block chain, which comprises the following steps:
s1, receiving goods source information issued by a goods main terminal, inputting the goods source information into a hash function to obtain a digital abstract, and writing the digital abstract and the goods source information into a block chain;
s2, displaying the goods source information to a driver end, and then receiving quotation order receiving information from the driver end; inputting the driver quotation receipt information into a hash function to obtain a digital abstract, and writing the digital abstract and the driver quotation receipt information into a block chain;
s3, after receiving the shipping information of the selected driver from the shipper end, generating transportation order information; inputting the transportation order information into a hash function to obtain a digital abstract, and writing the digital abstract and the transportation order information into a block chain;
s4, judging whether the driver arrives at a loading place, if so, judging whether loading is finished, and if so, generating loading finishing information of the driver; inputting the driver loading completion information into a Hash function to obtain a digital abstract, and writing the digital abstract and the driver loading completion information into a block chain;
s5, judging whether the driver arrives at the unloading place, if so, judging whether unloading is finished, and if so, generating unloading finishing information of the driver; inputting the unloading completion information of the driver into a Hash function to obtain a digital abstract, and writing the digital abstract and the unloading completion information of the driver into a block chain;
s6, receiving the receipt confirmation information from the goods owner, inputting the receipt confirmation information into a hash function to obtain a digital abstract, and writing the digital abstract and the receipt confirmation information into a block chain;
and S7, the freight is sent to a driver end, the freight payment information is input into a Hash function to obtain a digital abstract, and the digital abstract and the freight payment information are written into a block chain.
In a preferred embodiment of the present invention, the step S3 includes generating a transportation path for a driver carrying the transportation order, and the method of generating the transportation path includes:
planning a first conveying path and a second conveying path according to one or any combination information of a discharging place, a loading place, conveying time, a truck weight parameter and a truck size parameter;
the road screening of the first conveying path and the second conveying path comprises the following steps:
S-A, judging whether the road to be screened meets the weight parameter and the size parameter of the truck, and if so, executing the next step;
S-B, splitting each road to be screened into N sections of A-level roads and M sections of B-level roads according to the information of unloading places and loading places; n and M are positive integers greater than or equal to 2;
and S-C, selecting the path with the most A-level roads as a first conveying path, and selecting the path with the second most A-level roads as a second conveying path.
In a preferred embodiment of the present invention, the determination criteria for the a-level road and the B-level road include one or any combination of the following: the highest speed limit of the road, the number of traffic lights, the road congestion condition, the road toll condition and the road width; and respectively giving different weights to the judgment standards;
if the highest speed limit of the road is lower than a preset running speed threshold, determining the road as a B-level road, and if the highest speed limit of the road is higher than or equal to the preset running speed threshold, determining the road as an A-level road; if the number of the traffic lights of the road is greater than a preset traffic light threshold value, judging the road as a B-level road, and if the number of the traffic lights of the road is less than or equal to the preset traffic light threshold value, judging the road as an A-level road; if the road congestion condition of the road is higher than a preset road congestion threshold value, determining the road as a B-level road, and if the road congestion condition of the road is lower than or equal to the preset road congestion threshold value, determining the road as an A-level road; if the road has a charging condition, determining the road as a B-level road, and if the road has no charging condition, determining the road as an A-level road; and if the width of the road is greater than or equal to the preset road width threshold value, determining the road as the A-level road, and if the width of the road is less than the preset road width threshold value, determining the road as the B-level road.
In a preferred embodiment of the present invention, the generating a conveyance path further includes:
and refreshing the road information at intervals of Xmin, wherein X is a positive number, and min represents time point.
In a preferred embodiment of the present invention, the S4 includes:
s4-1, judging whether the driver arrives at a loading place, and if so, executing the next step;
s4-2, searching currently available temporary stop points after receiving a crossing occupation request from a driver end;
s4-3, receiving information of occupying the temporary stop points sent by a driver end, and displaying a path guide picture;
s4-3, judging whether the driver arrives at a loading place, and if so, executing the next step;
and S4-4, receiving a picture of finished goods loading from a driver end, and scanning the picture to judge whether the goods loading is finished.
In a preferred embodiment of the present invention, the S5 includes:
s5-1, judging whether the driver arrives at a discharging place, and if so, executing the next step;
s5-2, searching currently available temporary stop points after receiving a crossing occupation request from a driver end;
s5-3, receiving information of occupying temporary stop points sent from a driver end, and displaying a path guide picture;
s5-3, judging whether the driver arrives at a unloading place, and if so, executing the next step;
and S5-4, receiving a picture of finished unloading from a driver end, and scanning the picture to judge whether the unloading is finished.
In a preferred embodiment of the present invention, the system further comprises a message prompt applied to the owner end and the driver end, wherein the message prompt comprises:
when the transportation order information is generated, the goods main end receives the message prompt of generating the transportation order information;
when the driver arrives at the loading place, the cargo owner end receives the message prompt that the driver arrives at the loading place;
when the driver arrives at the unloading place, the cargo owner end receives the message prompt that the driver arrives at the unloading place;
when the goods owner confirms the signing information, the driver end receives the message prompt of the goods owner confirming the signing information;
when the freight is sent to the driver end, the driver end receives the message prompt of the freight being sent to the account.
In a preferred embodiment of the present invention, when the owner terminal communicates with the driver terminal, the safety processing is performed on the information sent by the owner terminal or/and the driver terminal, and the information safety processing method includes the following steps:
s81, extracting keywords to be sent to the opposite side information; the key words comprise one or any combination of mobile phone numbers, identification card numbers and bank card numbers;
s82, inputting the extracted keywords into a hash function to obtain a keyword digital abstract; the hash function used is MD5.
S83, converting the keyword digital abstract obtained in the step S82 into a hexadecimal abstract value;
s84, filling each character in the hexadecimal abstract value into a safety form according to the sequence, wherein the form is formed by i rows and j column lines, the total number of (i-1) × (j-1) safety squares comprises character squares capable of being filled and character squares incapable of being filled, the sum of the total number of the character squares incapable of being filled and the total number of the hexadecimal abstract value is less than or equal to (i-1) × (j-1), the result of the character squares incapable of being filled is that the sum of the results of the adjacent upper, lower, left and right character squares capable of being filled is 1 or less than 1, and the result is not more than F and not less than 0; the unfilled character grids and the unfilled character grids appear alternately, namely no more than three unfilled character grids can be filled between two unfilled character grids in the same row, and no more than three unfilled character grids can be filled between two unfilled character grids; extracting a result in the safety form to obtain a result to be sent, and sending the result to be sent and the safety form to a counterpart terminal;
TABLE 1 safety Table
In table 1, the security table has 9 rows and 10 columns, which form a total of (9-1) × (10-1) =8 × 9=72 security squares, whose unfilled character squares are shaded squares, and the remaining unfilled character squares are filled character squares; assuming that its hexadecimal digest value is a0123456789ABCDEF99, it is shown in table 2 after filling table 1.
TABLE 2 safety Table shows results
TABLE 3 safety Table shows the results
The result obtained by adding the shaded part to the result in table 2 is shown in table 3, the result in table 3 is extracted to obtain the result to be sent A9a101233456556178595AB70CDEFF9CA9, and the result to be sent A9a101233456556178595AB70CDEFF9CA9 and table 1 are sent to the opposite end.
And S85, the opposite side receives the result to be sent by the sending end, fills the received result to be sent into a safety form, extracts the result which can be filled into the character grids in the form to obtain a safety result value, namely A0123456789ABCDEF99, and queries by using the obtained safety result value to obtain the corresponding keyword.
TABLE 4 safety Table shows the results
In a preferred embodiment of the present invention, in step S83, the method for converting the keyword digital digest into a hexadecimal digest value comprises the following steps:
s831, judge whether the keyword digital abstract is hexadecimal:
if the keyword digital abstract is hexadecimal, the keyword digital abstract is a hexadecimal abstract value;
if the key word digit abstract is not hexadecimal, executing the next step;
s832, if the keyword digital abstract is in a P scale, P =2, 3, 4, \8230;, 15; the method for converting the keyword digital abstract of the P system into the abstract value of the hexadecimal system comprises the following steps:
s8321, converting the P-system keyword digital abstract into a decimal abstract value, wherein the method comprises the following steps:
U＝P 1 *P p-1 +P 2 *P p-2 +P 3 *P p-3 +…+P p ，
wherein, P 1 A value representing the 1 st digit from left to right in the keyword digital summary in the P system;
P 2 a 2 nd digit value from left to right in the P-system keyword digital summary;
P 3 a value representing the 3 rd digit from left to right in the keyword digital summary in P system;
P p a value representing the P-th digit from left to right in the keyword digital summary in P-ary;
p represents the total number of digits of the keyword digital abstract in P system;
u represents a decimal digest value;
s8322, the decimal abstract value U is converted into a hexadecimal abstract value, and the method comprises the following steps:
dividing the decimal digest value U by 16 to obtain a first quotient and a first remainder;
judging the relation between the first quotient and 16:
if the first quotient is greater than or equal to 16, dividing the first quotient by 16 to obtain a second quotient and a second remainder;
if the first quotient is less than 16, ending;
judging the relationship between the second quotient and 16:
if the second quotient is greater than or equal to 16, dividing the second quotient by 16 to obtain a third quotient and a third remainder;
if the second quotient is less than 16, ending;
judging the relationship between the third quotient and 16:
if the third quotient is greater than or equal to 16, dividing the third quotient by 16 to obtain a fourth quotient and a fourth remainder;
until the obtained quotient is less than 16; when the method is finished, the first remainder, the second remainder, the third remainder, the fourth remainder, \8230, the 8230and the final quotient obtained by writing from right to left are written, and the written result is the hexadecimal abstract value.
In a preferred embodiment of the present invention, in step S831, the method for determining whether the keyword digital abstract is hexadecimal includes the following steps:
s831-1, arranging all characters in the keyword digital abstract from large to small, wherein the numerical value of the character A or a is 10, the numerical value of the character B or B is 11, the numerical value of the character C or C is 12, the numerical value of the character D or D is 13, the numerical value of the character E or E is 14, the numerical value of the character F or F is 15, and obtaining a character string Q thereof 1 Q 2 Q 3 …Q q Wherein Q is 1 Represents the 1 st large character, Q, in the keyword digital summary 2 Representing the 2 nd largest character, Q, in a keyword digital summary 3 Representing the large 3 rd character, Q, in the keyword digital summary q Representing the qth large character in the keyword digital abstract, wherein q represents the total number of characters in the keyword digital abstract;
s831-2, extracting the 1 st large character Q in the keyword digital abstract 1 Relationship between character F and character F:
if Q 1 = F or Q 1 = f, the keyword digital abstract is hexadecimal;
if Q 1 Not equal to F and Q 1 F, the key word number abstract is not hexadecimal; executing the next step;
s831-3, if Q 1 = E or Q 1 If the key word digital abstract is fifteen system;
if Q 1 Not equal to E and Q 1 Not equal to e, the key word number abstract is not a pentadecan system; executing the next step;
s831-4, if Q 1 = D or Q 1 = d, the keyword digital abstract is fourteen-system;
if Q 1 Not equal to D and Q 1 If not, the key word number abstract is not fourteen-system; executing the next step;
s831-5, if Q 1 = C or Q 1 If the key word digital abstract is thirteen-system, the key word digital abstract is thirteen-system;
if Q 1 Not equal to C and Q 1 Not equal to c, the key word number abstract is not thirteen-system; executing the next step;
s831-6, if Q 1 = B or Q 1 = b, the keyword digital abstract is twelve-system;
if Q 1 Not equal to B and Q 1 B, the key word number abstract is not a twelve-system; executing the next step;
s831-7, if Q 1 = A or Q 1 If the key word digital abstract is an eleven-system;
if Q 1 Not equal to A and Q 1 Not equal to a, the key word number abstract is not elevenPreparing; executing the next step;
s831-8, if Q 1 =9, then keyword number digest is decimal;
if Q 1 Not equal to 9, the key word number abstract is not decimal; executing the next step;
s831-9, if Q 1 =8, the keyword digital abstract is nine-system;
if Q 1 Not equal to 8, the key word number abstract is not a nine-system; executing the next step;
s831-10, if Q 1 If not, the keyword digital abstract is octal;
if Q 1 Not equal to 7, the key word number abstract is not an octal system; executing the next step;
s831-11, if Q 1 =6, the keyword digital abstract is in a seven-system;
if Q 1 Not equal to 6, the key word number abstract is not a seven-system; executing the next step;
s831-12, if Q 1 =5, the keyword digital abstract is in a six-system state;
if Q 1 Not equal to 5, the key word number abstract is not a six-system; executing the next step;
s831-13, if Q 1 =4, the keyword digital abstract is in a quinary system;
if Q 1 Not equal to 4, the key word number abstract is not a quinary system; executing the next step;
s831-14, if Q 1 If =3, the keyword digital abstract is quaternary;
if Q 1 Not equal to 3, the key word number abstract is not quaternary system; executing the next step;
s831-15, if Q 1 =2, the keyword digital abstract is ternary;
if Q 1 And not equal to 2, the keyword digital abstract is binary system.
The invention is explained in detail with reference to the attached figure 1, which mainly comprises the following steps:
step 1: the owner of goods uses cell-phone APP to issue goods source information, goods source information field: the system comprises a source bill number, a shipper ID, a shipper name, a shipper phone, a detailed address of a loading site, a detailed address of a unloading site, a loading ground-warp latitude, a unloading ground-warp latitude, a loading time, a required delivery time, a source information generation time, a cargo name, a cargo weight, a vehicle type requirement and a freight rate. The mobile phone APP submits the goods source information to the server, the program in the server inputs the goods source information into the hash function to obtain the digital abstract, and the digital abstract and the goods source information are written into the block chain.
And 2, step: the driver uses the cell-phone APP quotation to connect the order, and the quotation connects the order field: driver ID, driver name, driver phone, source order number, driver quoted freight, quoted pickup time. The mobile phone APP submits the driver quotation receipt information to the server, the driver quotation receipt information is input into a hash function by a program in the server to obtain a digital abstract, and the digital abstract and the driver quotation receipt information are written into the block chain.
And 3, step 3: the shipper uses cell-phone APP to select the driver to take the carrier, generates transportation order information, transportation order information field: a transport order number, a source order number, a shipper ID, a shipper name, a shipper phone, a loading site detailed address, a unloading site detailed address, a loading site latitude, an unloading site latitude, a loading time, a required delivery time, a source information generation time, a cargo name, a cargo weight, a vehicle type requirement, a freight charge, a driver ID, a driver name, a driver phone, a transport vehicle license plate number, a transport order generation time. The mobile phone APP submits the transportation order information to the server, the program in the server inputs the transportation order information into a hash function to obtain a digital abstract, and the digital abstract and the transportation order information are written into the block chain.
And 4, step 4: the driver reachs the loading place, begins the loading, accomplishes the back, uses cell-phone APP to shoot and upload the loading photo, and the field is accomplished in the driver loading: the transport order number, the loading completion time and the character string of the loading picture after base64 coding. The mobile phone APP submits the driver loading completion information to the server, the driver loading completion information is input into the Hash function by the program in the server to obtain the digital abstract, and the digital abstract and the driver loading completion information are written into the block chain.
And 5: the driver arrives the ground of unloading, begins to unload, accomplishes the back, uses cell-phone APP to shoot and uploads the unloading photo, and the driver unloads and accomplishes the field: the transport order number, the unloading completion time and the character string of the unloading picture after base64 coding. The mobile phone APP submits the unloading completion information of the driver to the server, the program in the server inputs the unloading completion information of the driver into the Hash function to obtain the digital abstract, and the digital abstract and the unloading completion information of the driver are written into the block chain.
Step 6: after the driver unloads and accomplishes, the owner of goods uses cell-phone APP to confirm to sign for, confirms to sign for the field: shipping order number, confirming the time of receipt. The mobile phone APP submits the signing confirmation information to the server, the program in the server inputs the signing confirmation information into a hash function to obtain a digital abstract, and the digital abstract and the signing confirmation information are written into the block chain.
And 7: the owner of goods uses cell-phone APP to pay freight for the driver, pays freight information: a shipping order number, a shipping cost amount, a payer name, a payer bank card number, a payee name, a payee bank card number, a bank receipt number. The mobile phone APP submits the payment freight information to the server, the program in the server inputs the payment freight information into a hash function to obtain a digital abstract, and the digital abstract and the payment freight information are written into the block chain.
While embodiments of the present invention have been shown and described, it will be understood by those of ordinary skill in the art that: various changes, modifications, substitutions and alterations can be made to the embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the claims and their equivalents.
Claims (9)
1. A transportation order information storage method based on a block chain is characterized by comprising the following steps:
s1, receiving goods source information issued by a goods main terminal, inputting the goods source information into a hash function to obtain a digital abstract, and writing the digital abstract and the goods source information into a block chain;
s2, displaying the goods source information to a driver end, and then receiving quotation receiving information from the driver end; inputting the driver quotation order receiving information into a hash function to obtain a digital abstract, and writing the digital abstract and the driver quotation order receiving information into a block chain;
s3, after receiving the selected driver carrying information from the cargo owner end, generating transportation order information; inputting the transportation order information into a hash function to obtain a digital abstract, and writing the digital abstract and the transportation order information into a block chain;
s4, judging whether the driver arrives at a loading place, if so, judging whether loading is finished, and if so, generating driver loading finishing information; inputting the driver loading completion information into a Hash function to obtain a digital abstract, and writing the digital abstract and the driver loading completion information into a block chain;
s5, judging whether the driver arrives at the unloading place, if so, judging whether unloading is finished, and if so, generating unloading finishing information of the driver; inputting the unloading completion information of the driver into a Hash function to obtain a digital abstract, and writing the digital abstract and the unloading completion information of the driver into a block chain;
s6, receiving the confirmation signing information from the goods owner, inputting the confirmation signing information into a hash function to obtain a digital abstract, and writing the digital abstract and the confirmation signing information into a block chain;
s7, the freight is sent to a driver end, the freight payment information is input into a Hash function to obtain a digital abstract, and the digital abstract and the freight payment information are written into a block chain;
when the cargo owner end and the driver end carry out information communication, the safety processing is carried out on the sending information of the cargo owner end or/and the driver end, and the information safety processing method comprises the following steps:
s81, extracting keywords to be sent to the opposite side information; the key words comprise one or any combination of mobile phone numbers, identity card numbers and bank card numbers;
s82, inputting the extracted keywords into a hash function to obtain a keyword digital abstract;
s83, converting the keyword digital abstract obtained in the step S82 into a hexadecimal abstract value;
s84, sequentially filling each character in the hexadecimal abstract value into a safety form, wherein the form is i rows and j columns, and has (i-1) x (j-1) safety squares in total, the safety form comprises character squares capable of being filled and character squares incapable of being filled, the result in the character squares incapable of being filled is the result of adjacent character squares capable of being filled with 1, the character squares incapable of being filled and the character squares capable of being filled are alternately appeared, no more than three character squares capable of being filled are arranged between two character squares incapable of being filled in the same row, and no more than three character squares capable of being filled in are arranged between two character squares capable of being filled; extracting results in the safety form to obtain a result to be sent, and sending the result to be sent to a counterpart terminal;
and S85, the opposite side receives the result to be sent by the sending end, fills the received result to be sent into a safety form, extracts the result which can be filled into the character grid in the form to obtain the safety result value of the form, and queries by using the obtained safety result value to obtain the corresponding keyword.
2. The method for storing transportation order information based on block chain as claimed in claim 1, wherein step S3 comprises generating a transportation path for a driver carrying the transportation order, and the method for generating the transportation path comprises:
planning a first conveying path and a second conveying path according to one or any combination information of a discharging place, a loading place, conveying time, a truck weight parameter and a truck size parameter;
the road screening of the first conveying path and the second conveying path comprises the following steps:
S-A, judging whether the road to be screened meets the truck weight parameter and the truck size parameter, and if so, executing the next step;
S-B, splitting each road to be screened into N sections of A-level roads and M sections of B-level roads according to the information of the unloading place and the loading place; n and M are positive integers greater than or equal to 2;
and S-C, selecting the path with the most A-level roads as a first conveying path, and selecting the path with the second most A-level roads as a second conveying path.
3. The method for storing transportation order information based on block chain according to claim 2, comprising:
the judgment standard of the A-level road and the B-level road comprises one or any combination of the following: the highest speed limit of the road, the number of traffic lights, the road congestion condition, the road toll condition and the road width; and respectively giving different weights to the judgment standards;
if the highest speed limit of the road is lower than a preset running speed threshold, determining the road as a B-level road, and if the highest speed limit of the road is higher than or equal to the preset running speed threshold, determining the road as an A-level road; if the number of the traffic lights of the road is greater than a preset traffic light threshold value, judging the road as a B-level road, and if the number of the traffic lights of the road is less than or equal to the preset traffic light threshold value, judging the road as an A-level road; if the road congestion condition of the road is higher than a preset road congestion threshold, determining the road as a level B road, and if the road congestion condition of the road is lower than or equal to the preset road congestion threshold, determining the road as a level A road; if the road has a toll situation, determining the road as a B-level road, and if the road has no toll situation, determining the road as an A-level road; and if the width of the road is greater than or equal to the preset road width threshold value, determining the road as the A-level road, and if the width of the road is less than the preset road width threshold value, determining the road as the B-level road.
4. The method for storing transportation order information based on block chains according to claim 2, wherein the generating of the transportation path further comprises:
and refreshing the road information at intervals of Xmin, wherein X is a positive number, and min represents time point.
5. The method for storing transportation order information based on block chain according to claim 1, wherein the S4 comprises:
s4-1, judging whether the driver arrives at a loading place, and if so, executing the next step;
s4-2, searching currently available temporary stop points after receiving a crossing occupation request from a driver end;
s4-3, receiving information of occupying the temporary stop points sent by a driver end, and displaying a path guide picture;
s4-3, judging whether the driver arrives at a loading place, and if so, executing the next step;
and S4-4, receiving a picture of finished goods loading from a driver end, and scanning the picture to judge whether the goods loading is finished.
6. The method for storing transportation order information based on block chain according to claim 1, wherein the S5 comprises:
s5-1, judging whether the driver arrives at a unloading place, and if so, executing the next step;
s5-2, searching currently available temporary stop points after receiving a crossing occupation request from a driver end;
s5-3, receiving information of occupying temporary stop points sent from a driver end, and displaying a path guide picture;
s5-3, judging whether the driver arrives at the unloading place, and if so, executing the next step;
and S5-4, receiving the picture of finished unloading from the driver end, and scanning the picture to judge whether the unloading is finished.
7. The blockchain-based transportation order information storage method according to claim 1, further comprising a message prompt applied to a host side and a driver side, wherein the message prompt comprises:
when the transportation order information is generated, the goods main end receives a message prompt of generating the transportation order information;
when the driver arrives at the loading place, the cargo owner end receives the message prompt that the driver arrives at the loading place;
when the driver arrives at the unloading place, the cargo main end receives a message prompt that the driver arrives at the unloading place;
when the goods owner confirms the signing information, the driver end receives the message prompt of the goods owner confirming the signing information;
when the freight charge is given to the driver end, the driver end receives the message prompt of the freight charge being sent to the account.
8. The method for storing transportation order information based on block chain as claimed in claim 1, wherein in step S83, the method for converting the keyword digital summary into the hexadecimal summary value comprises the following steps:
s831, judging whether the keyword digital abstract is hexadecimal or not:
if the keyword digital abstract is hexadecimal, the keyword digital abstract is a hexadecimal abstract value;
if the key word digit abstract is not hexadecimal, executing the next step;
s832, if the keyword digital abstract is in a P scale, P =2, 3, 4, \8230;, 15; the method for converting the keyword digital abstract of the P system into the abstract value of the hexadecimal system comprises the following steps:
s8321, converting the P-system keyword digital abstract into a decimal abstract value, wherein the method comprises the following steps:
U＝P 1 *P p-1 +P 2 *P p-2 +P 3 *P p-3 +…+P p ，
wherein, P 1 A value representing the 1 st digit from left to right in the keyword digital summary in the P system;
P 2 a 2 nd digit value from left to right in the P-system keyword digital summary;
P 3 a value representing the 3 rd digit from left to right in the keyword digital summary in P-ary;
P p a value representing the P-th digit from left to right in the keyword digital summary in P-ary;
p represents the total number of digits of the keyword digital abstract in the P system;
u represents a decimal digest value;
s8322, the decimal abstract value U is converted into a hexadecimal abstract value, and the method comprises the following steps:
dividing the decimal digest value U by 16 to obtain a first quotient and a first remainder;
judging the relation between the first quotient and 16:
if the first quotient is greater than or equal to 16, the first quotient is divided by 16 to obtain a second quotient and a second remainder;
if the first quotient is less than 16, ending;
judging the relationship between the second quotient and 16:
if the second quotient is greater than or equal to 16, dividing the second quotient by 16 to obtain a third quotient and a third remainder;
if the second quotient is less than 16, ending;
judging the relationship between the third quotient and 16:
if the third quotient is greater than or equal to 16, the third quotient is divided by 16 to obtain a fourth quotient and a fourth remainder;
until the obtained quotient is less than 16; when the method is finished, writing a first remainder, a second remainder, a third remainder, a fourth remainder, \8230;. The last quotient obtained from right to left, wherein the written result is a hexadecimal digest value.
9. The method for storing block chain-based transportation order information according to claim 8, wherein the method for determining whether the keyword digital digest is hexadecimal in step S831 comprises the steps of:
s831-1, arranging all characters in the keyword digital abstract from large to small, wherein the numerical value of the character A or a is 10, the numerical value of the character B or B is 11, the numerical value of the character C or C is 12, the numerical value of the character D or D is 13, the numerical value of the character E or E is 14, the numerical value of the character F or F is 15, and obtaining a character string Q thereof 1 Q 2 Q 3 …Q q Wherein Q is 1 Represents the 1 st large character, Q, in the keyword digital summary 2 Representing the 2 nd largest character, Q, in a keyword digital summary 3 Represents the 3 rd largest character, Q, in the keyword digital summary q Representing the qth large character in the keyword digital abstract, wherein q represents the total number of characters in the keyword digital abstract;
s831-2, extracting the 1 st large character Q in the keyword digital abstract 1 Relationship between character F and character F:
if Q 1 = F or Q 1 If not, the keyword digital abstract is hexadecimal;
if Q 1 Not equal to F and Q 1 If not, the key word number abstract is not hexadecimal; executing the next step;
s831-3, if Q 1 = E or Q 1 If the key word digital abstract is fifteen system;
if Q 1 Not equal to E and Q 1 Not equal to e, the key word number abstract is not a pentadecan system; executing the next step;
s831-4, if Q 1 = D or Q 1 = d, the keyword digital abstract is fourteen-system;
if Q 1 Not equal to D and Q 1 If not, the key word number abstract is not fourteen-system; executing the next step;
s831-5, if Q 1 = C or Q 1 If the key word digital abstract is thirteen-system, the key word digital abstract is thirteen-system;
if Q 1 Not equal to C and Q 1 Not equal to c, the key word number abstract is not thirteen-system; executing the next step;
s831-6, if Q 1 = B or Q 1 = b, the keyword digital abstract is twelve-system;
if Q 1 Not equal to B and Q 1 B, if the key word number abstract is not twelve system; executing the next step;
s831-7, if Q 1 = A or Q 1 = a, the keyword digital abstract is an eleventh system;
if Q 1 Not equal to A and Q 1 Not equal to a, the key word number abstract is not an eleven-system; executing the next step;
s831-8, if Q 1 =9, the keyword number abstract is decimal;
if Q 1 Not equal to 9, the key word number abstract is not decimal; executing the next step;
s831-9, if Q 1 =8, keyword number abstractIs nine-system;
if Q 1 Not equal to 8, the key word number abstract is not a nine-system; executing the next step;
s831-10, if Q 1 If not, the keyword digital abstract is octal;
if Q 1 Not equal to 7, the key word number abstract is not in octal system; executing the next step;
s831-11, if Q 1 If =6, the keyword digital abstract is in a seven-system;
if Q 1 Not equal to 6, the key word number abstract is not a seven-system; executing the next step;
s831-12, if Q 1 If the key word digital abstract is in a six-system form, the key word digital abstract is in a six-system form;
if Q 1 Not equal to 5, the key word number abstract is not a six-system; executing the next step;
s831-13, if Q 1 If the keyword digital abstract is in a quinary system, the keyword digital abstract is in a quinary system;
if Q 1 Not equal to 4, the key word number abstract is not a quinary system; executing the next step;
s831-14, if Q 1 If =3, the keyword digital abstract is quaternary;
if Q 1 Not equal to 3, the key word number abstract is not quaternary; executing the next step;
s831-15, if Q 1 =2, the keyword digital abstract is ternary;
if Q 1 Not equal to 2, the keyword digital abstract is binary.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110691114.5A CN113379351B (en) | 2021-06-22 | 2021-06-22 | Transportation order information storage method based on block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110691114.5A CN113379351B (en) | 2021-06-22 | 2021-06-22 | Transportation order information storage method based on block chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113379351A CN113379351A (en) | 2021-09-10 |
| CN113379351B true CN113379351B (en) | 2022-10-21 |
Family
ID=77578304
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110691114.5A Active CN113379351B (en) | 2021-06-22 | 2021-06-22 | Transportation order information storage method based on block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113379351B (en) |
Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2005025521A (en) * | 2003-07-02 | 2005-01-27 | Nagoya Industrial Science Research Inst | Password input processing method, password input processing system, password input processing program and storage medium |
| EP1619820A2 (en) * | 2001-02-02 | 2006-01-25 | Asier Technology Corporation | Data encryption system using key matrix |
| CN105258707A (en) * | 2015-11-24 | 2016-01-20 | 上海斐讯数据通信技术有限公司 | Navigation optimization method and system, and electronic equipment |
| CN107679814A (en) * | 2017-11-06 | 2018-02-09 | 成都德旺云车邦信息技术有限公司 | The whole process control system and method for complete vehicle logistics transport |
| CN109392307A (en) * | 2017-06-13 | 2019-02-26 | 北京嘀嘀无限科技发展有限公司 | Paths planning method and system |
| CN109995518A (en) * | 2017-12-29 | 2019-07-09 | 北京京东尚科信息技术有限公司 | Method for generating cipher code and device |
| CN110287392A (en) * | 2019-06-20 | 2019-09-27 | 沈阳航空航天大学 | A kind of safe space network inquiry method based on safe partition tree |
| CN111314054A (en) * | 2020-01-21 | 2020-06-19 | 衡阳师范学院 | Novel high-security lightweight ECEG block cipher realization method, system and storage medium |
| CN111553632A (en) * | 2020-04-24 | 2020-08-18 | 华侨大学 | Logistics management platform and logistics management method based on Internet of things and block chain technology |
| EP3734510A1 (en) * | 2017-12-29 | 2020-11-04 | I.P. Solutions, Ltd. | Composite code pattern, generating device, reading device, method, and program |
| CN111898953A (en) * | 2020-07-31 | 2020-11-06 | 沙师弟(重庆)网络科技有限公司 | Freight regulation and control method based on group planning |
| CN111898824A (en) * | 2020-07-31 | 2020-11-06 | 沙师弟(重庆)网络科技有限公司 | Same-city logistics multipoint distribution path planning method |
| CN111932155A (en) * | 2020-09-23 | 2020-11-13 | 南京福佑在线电子商务有限公司 | Intelligent order vehicle matching method, system and device |
| CN112036799A (en) * | 2020-09-04 | 2020-12-04 | 南京福佑在线电子商务有限公司 | Intelligent freight matching method, device and system |
| CN112766607A (en) * | 2021-02-02 | 2021-05-07 | 腾讯科技（深圳）有限公司 | Travel route recommendation method and device, electronic device and readable storage medium |
| CN112801399A (en) * | 2021-02-08 | 2021-05-14 | 腾讯科技（深圳）有限公司 | Path generation method and device, terminal equipment and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101059798B1 (en) * | 2009-07-03 | 2011-08-26 | 한국인터넷진흥원 | Password input system and method using two alpha-numeric matrices |
-
2021
- 2021-06-22 CN CN202110691114.5A patent/CN113379351B/en active Active
Patent Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1619820A2 (en) * | 2001-02-02 | 2006-01-25 | Asier Technology Corporation | Data encryption system using key matrix |
| JP2005025521A (en) * | 2003-07-02 | 2005-01-27 | Nagoya Industrial Science Research Inst | Password input processing method, password input processing system, password input processing program and storage medium |
| CN105258707A (en) * | 2015-11-24 | 2016-01-20 | 上海斐讯数据通信技术有限公司 | Navigation optimization method and system, and electronic equipment |
| CN109392307A (en) * | 2017-06-13 | 2019-02-26 | 北京嘀嘀无限科技发展有限公司 | Paths planning method and system |
| CN107679814A (en) * | 2017-11-06 | 2018-02-09 | 成都德旺云车邦信息技术有限公司 | The whole process control system and method for complete vehicle logistics transport |
| EP3734510A1 (en) * | 2017-12-29 | 2020-11-04 | I.P. Solutions, Ltd. | Composite code pattern, generating device, reading device, method, and program |
| CN109995518A (en) * | 2017-12-29 | 2019-07-09 | 北京京东尚科信息技术有限公司 | Method for generating cipher code and device |
| CN110287392A (en) * | 2019-06-20 | 2019-09-27 | 沈阳航空航天大学 | A kind of safe space network inquiry method based on safe partition tree |
| CN111314054A (en) * | 2020-01-21 | 2020-06-19 | 衡阳师范学院 | Novel high-security lightweight ECEG block cipher realization method, system and storage medium |
| CN111553632A (en) * | 2020-04-24 | 2020-08-18 | 华侨大学 | Logistics management platform and logistics management method based on Internet of things and block chain technology |
| CN111898953A (en) * | 2020-07-31 | 2020-11-06 | 沙师弟(重庆)网络科技有限公司 | Freight regulation and control method based on group planning |
| CN111898824A (en) * | 2020-07-31 | 2020-11-06 | 沙师弟(重庆)网络科技有限公司 | Same-city logistics multipoint distribution path planning method |
| CN112036799A (en) * | 2020-09-04 | 2020-12-04 | 南京福佑在线电子商务有限公司 | Intelligent freight matching method, device and system |
| CN111932155A (en) * | 2020-09-23 | 2020-11-13 | 南京福佑在线电子商务有限公司 | Intelligent order vehicle matching method, system and device |
| CN112766607A (en) * | 2021-02-02 | 2021-05-07 | 腾讯科技（深圳）有限公司 | Travel route recommendation method and device, electronic device and readable storage medium |
| CN112801399A (en) * | 2021-02-08 | 2021-05-14 | 腾讯科技（深圳）有限公司 | Path generation method and device, terminal equipment and storage medium |
Non-Patent Citations (4)
| Title |
|---|
| Security, Privacy, and Access Control in Information-Centric Networking：A Survey;Reza Tourani 等;《IEEE Communications Surveys & Tutorials》;20171207;第20卷(第1期);第566-600页 * |
| 一种分数维改进的长方棋盘覆盖算法;王海燕 等;《长春工程学院学报(自然科学版)》;20170915;第18卷(第03期);第119-123页 * |
| 物联网WSS簇间节点安全链路模型;周伟伟 等;《计算机研究与发展》;20180715;第55卷(第07期);第1393-1408页 * |
| 矩阵在古典密码学中的应用;许贝;《成功(教育)》;20110508(第09期);第293页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113379351A (en) | 2021-09-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110245186B (en) | Service processing method based on block chain and related equipment | |
| US20180365638A1 (en) | Method and device for processing data in logistics and distribution, and courier mobile terminal-based logistics and distribution method and device | |
| CN105719185B (en) | The data comparison and common recognition method of block chain | |
| CN106997520A (en) | A kind of long-distance Logistics Distribution Information Platform system and application method | |
| CN107392608A (en) | Digital asset method of commerce and block catenary system based on block catenary system | |
| US20140188748A1 (en) | Methods and systems for determining estimated package delivery/pick-up times | |
| CN107679983A (en) | Amount tree constructing method and device, amount take route inspection method and apparatus | |
| CN101986102B (en) | Method for matching electronic map in urban geographic information system | |
| CN111489121A (en) | AI intelligent big data vehicle and goods matching method | |
| CN106779937B (en) | Network payment-based card-free subway ticket selling and checking terminal, server and method | |
| CN111915752A (en) | High-speed ETC charging method, device and medium based on block chain | |
| CN110838047A (en) | Online taxi appointment driver credit management method and device, server and storage medium | |
| CN111931245A (en) | Information processing method and device | |
| CN109919125A (en) | Travel stroke restoring method and its system based on bank slip recognition | |
| CN104835024A (en) | Logistics data processing method and system based on zone bit identification code | |
| EP3360050A1 (en) | Parallel processing for solution space partitions | |
| CN113379351B (en) | Transportation order information storage method based on block chain | |
| CN109102303B (en) | Risk detection method and related device | |
| WO2021120760A1 (en) | Method and device for issuing electronic invoice employing blockchain | |
| CN112347190A (en) | Block chain-based shared office joining park management system | |
| CN112150143A (en) | Capital management method and device based on block chain technology | |
| CN111105306A (en) | Resource transaction strategy determination method and device and server | |
| CN114360084B (en) | Highway toll settlement method and device | |
| CN108415686A (en) | Divide account computational methods and device during random number offer | |
| CN110633275B (en) | ETC transaction data retention analysis method and device |
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 |