CN116938516A - Traffic flow monitoring system based on alliance chain and Internet of vehicles - Google Patents

Traffic flow monitoring system based on alliance chain and Internet of vehicles Download PDF

Info

Publication number
CN116938516A
CN116938516A CN202310649265.3A CN202310649265A CN116938516A CN 116938516 A CN116938516 A CN 116938516A CN 202310649265 A CN202310649265 A CN 202310649265A CN 116938516 A CN116938516 A CN 116938516A
Authority
CN
China
Prior art keywords
vehicle
traffic
vehicles
winner
reputation
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
Application number
CN202310649265.3A
Other languages
Chinese (zh)
Inventor
郭剑雄
李彦弟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhuhai Campus Of Beijing Normal University
Original Assignee
Zhuhai Campus Of Beijing Normal University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Zhuhai Campus Of Beijing Normal University filed Critical Zhuhai Campus Of Beijing Normal University
Priority to CN202310649265.3A priority Critical patent/CN116938516A/en
Publication of CN116938516A publication Critical patent/CN116938516A/en
Pending legal-status Critical Current

Links

Classifications

    • 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/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
    • H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
    • H04L63/0442—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload wherein the sending and receiving network entities apply asymmetric encryption, i.e. different keys for encryption and decryption
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • 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
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/04—Payment circuits
    • G06Q20/06—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme
    • G06Q20/065—Private payment circuits, e.g. involving electronic currency used among participants of a common payment scheme using e-cash
    • 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
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/30—Payment architectures, schemes or protocols characterised by the use of specific devices or networks
    • G06Q20/36—Payment architectures, schemes or protocols characterised by the use of specific devices or networks using electronic wallets or electronic money safes
    • G06Q20/367—Payment architectures, schemes or protocols characterised by the use of specific devices or networks using electronic wallets or electronic money safes involving electronic purses or money safes
    • 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
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0201—Market modelling; Market analysis; Collecting market data
    • G06Q30/0206—Price or cost determination based on market factors
    • 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
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/0601—Electronic shopping [e-shopping]
    • G06Q30/0611—Request for offers or quotes
    • 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
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/08—Auctions
    • 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
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10—Services
    • G06Q50/26—Government or public services
    • G—PHYSICS
    • G08—SIGNALLING
    • G08G—TRAFFIC CONTROL SYSTEMS
    • G08G1/00—Traffic control systems for road vehicles
    • G08G1/01—Detecting movement of traffic to be counted or controlled
    • G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
    • G—PHYSICS
    • G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
    • G16Y10/00—Economic sectors
    • G16Y10/40—Transportation
    • G—PHYSICS
    • G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
    • G16Y10/00—Economic sectors
    • G16Y10/45—Commerce
    • G—PHYSICS
    • G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
    • G16Y30/00—IoT infrastructure
    • G16Y30/10—Security thereof
    • G—PHYSICS
    • G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
    • G16Y40/00—IoT characterised by the purpose of the information processing
    • G16Y40/10—Detection; Monitoring
    • G—PHYSICS
    • G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
    • G16Y—INFORMATION AND COMMUNICATION TECHNOLOGY SPECIALLY ADAPTED FOR THE INTERNET OF THINGS [IoT]
    • G16Y40/00—IoT characterised by the purpose of the information processing
    • G16Y40/50—Safety; Security of things, users, data or systems
    • 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/08—Network architectures or network communication protocols for network security for authentication of entities
    • H04L63/0823—Network architectures or network communication protocols for network security for authentication of entities using certificates
    • 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
    • H04L63/123—Applying verification of the received information received data contents, e.g. message integrity
    • 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/40—Network security protocols
    • 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/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/46—Secure multiparty computation, e.g. millionaire problem
    • H04L2209/466—Electronic auction
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/56—Financial cryptography, e.g. electronic payment or e-cash
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/72—Signcrypting, i.e. digital signing and encrypting simultaneously
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/84—Vehicles
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2463/00—Additional details relating to network architectures or network communication protocols for network security covered by H04L63/00
    • H04L2463/102—Additional details relating to network architectures or network communication protocols for network security covered by H04L63/00 applying security measure for e-commerce

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Computer Security & Cryptography (AREA)
  • Finance (AREA)
  • Computing Systems (AREA)
  • Development Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • Economics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Marketing (AREA)
  • General Engineering & Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Operations Research (AREA)
  • Tourism & Hospitality (AREA)
  • Educational Administration (AREA)
  • General Health & Medical Sciences (AREA)
  • Human Resources & Organizations (AREA)
  • Primary Health Care (AREA)
  • Health & Medical Sciences (AREA)
  • Chemical & Material Sciences (AREA)
  • Analytical Chemistry (AREA)
  • Game Theory and Decision Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention provides a traffic flow monitoring system based on a alliance chain and the Internet of vehicles, which comprises an alliance chain database based on a Reputation delegation proof-of-stare (DPoS) consensus mechanism and a lightweight transaction framework based on a budget limited reverse auction mechanism, wherein the budget limited reverse auction mechanism comprises an honest budget selection and pricing (TruthfulBudgetedSelectionandPricing, TBSAP) algorithm.

Description

Traffic flow monitoring system based on alliance chain and Internet of vehicles
[ field of technology ]
The invention belongs to the field of real-time traffic monitoring in smart cities. In particular to a vehicle flow monitoring system based on a alliance chain and the Internet of vehicles
[ background Art ]
In the smart city construction process, urban traffic management departments are important thrusters for the construction of the internet of vehicles. However, because internet of vehicles users are generally mutually different, the lack of trust faces a great impediment to information sharing. Therefore, in order to promote the enthusiasm of users, a fair and faithful transaction mechanism is indispensable. How to design such a mechanism is another challenge. Thus, a reliable and efficient traffic monitoring system based on federation chain technology and budget-limited reverse auction mechanisms is designed and implemented.
Secondly, existing solutions to traffic flow monitoring can be divided into two categories. One is based on a scheme of additionally installing a monitoring probe on a monitored road section, and the other is based on a scheme of analyzing traffic flow by utilizing real-time data of road vehicles based on an Internet of things crowdsourcing technology. The former scheme requires massive cameras to be arranged at each road node, is very expensive and is easily damaged by nature or human factors. Most of the latter schemes fail to well guarantee user privacy or pay user data value in the design process, so that user enthusiasm is lost. And considering that the existing block chain transaction mechanism of the Internet of things cannot well realize the characteristics of high reliability and low delay, the system cannot meet the real-time traffic flow monitoring requirement of a big data age. Thus, a reliable and efficient traffic monitoring system based on federation chain technology and budget-limited reverse auction mechanisms is designed and implemented. And a budget-limited reverse auction algorithm is developed to meet individual rationality, profitability, authenticity, and computational efficiency.
[ invention ]
The invention provides a vehicle flow monitoring mechanism based on a alliance chain and the Internet of vehicles. Based on the alliance chain and the reverse auction mechanism, a reliable and efficient traffic monitoring system is designed and implemented. By introducing an asymmetric encryption light-weight information transaction framework, the security and reliability of the system are improved, and meanwhile, the efficiency of recording and storing operations in the alliance chain is further improved by a alliance chain database based on a reputation entrusting rights proving consensus mechanism. A lightweight transaction framework based on a budget-limited reverse auction mechanism to encourage vehicles within a city to actively assume the role of traffic management. In order to promote the enthusiasm of users to participate in crowdsourcing tasks, an honest budget selection and pricing algorithm is designed, the algorithm meets the requirements of individuality, user profitability, honest property and high calculation efficiency, and the platform can obtain the maximum benefit on the premise of setting budget and guaranteeing fairness.
In order to achieve the above purpose, the technical scheme of the invention is as follows:
a traffic flow monitoring system based on a alliance chain and the Internet of vehicles is a real-time traffic monitoring system based on the alliance chain, the system comprises an alliance chain database based on a reputation commission proving consensus mechanism and a lightweight transaction framework based on a budget limited reverse auction mechanism, and the lightweight transaction framework based on the budget limited reverse auction mechanism comprises a honest budget selection and pricing algorithm.
The alliance chain database based on the reputation delegated proof consensus mechanism comprises a corresponding account of a vehicle user, a traffic management department account (TA) and a Certificate Authority (CA). Each vehicle needs to register with the certificate authority CA through a license plate associated with the CA to obtain a unique identification ID. Each legitimate vehicle will be assigned a private/public key pair (SK i ，PK i ) After registration, vehicle v i The certificate Cer signed by the private key of the CA will be obtained i The certificate may prove the authenticity of its identity.
Preferably, the traffic monitoring system based on the alliance chain and the Internet of vehicles comprises an alliance chain database based on a reputation delegation proof consensus mechanism.
It can be seen that the coalition chain database based on the reputation delegated proof consensus mechanism comprises the following steps:
step 1 (witness choice): all traffic management authorities TA are considered to be full nodes, the full node set being represented asAll vehicles are considered as lightweight nodes, and the consensus process is performed between all nodes, each +.>All having a reputation value Rep associated therewith a . The reputation value will determine its weight in witness elections;
step 2 (block generation): will be assembledActive witness in (a) are ordered in random order, each +.>In turn, the leader is responsible for generating a new chunk according to this ordering, and must verify and examine all transactions that have recently occurred and package those valid transactions into a new chunk;
step 3 (consensus process): after a new block is generated, the leader broadcasts it to allAll witness verifies the identity of the leader and checks this block. Next each witness +.>And comparing the verification result of the self with the verification results of other witness, and sending confirmation information to the leader after confirmation, wherein the witness is synonymously accepted by the new block. When the ratio of the accepted witness exceeds 2/3, the leader adds the new block to the alliance chain;
step 4 (reputation update): when one consensus wheel ends or breaks,the corresponding reputation value of all nodes in (1) needs to be updated according to their performance in this round of consensus round.
Preferably, the traffic monitoring system based on the alliance chain and the Internet of vehicles comprises a lightweight transaction framework based on a budget-limited reverse auction mechanism.
It can be seen that the lightweight transaction framework based on the budget limited reverse auction mechanism comprises the steps of:
step 1: the traffic management authority TA issues its task set T, which is sent to all active vehicles in the city. The published message may be expressed as pubmsg= { SK '(T), cer', STime };
step 2: after the vehicle receives the task information PubMsg issued by the traffic management authority TA, the vehicle verifies the certificate of the TA using the public key of the certificate authority CA, and decrypts the task set using the public key of the TA.
Step 3: traffic control TA gathers all active user requests and decides winning vehicle set W and each winner v therein i Corresponding consideration p i 。
Step 5: if winner v i Receiving order information OrdMsg from traffic control authority TA means winner v i The traffic information provider that has been selected as the round of task. Winner v i Can use the private key of the user to check order information OrdMsg information and complete corresponding task T i The response message ResMsg is then sent back to the traffic control TA. The information is encrypted by a traffic management department TA public key;
step 6: traffic control authority TA receives winner v i After the returned traffic information data, the quality of the task completion must be confirmed to reach the established standard, and the traffic management department TA sends the traffic information data to the winner v i Digital monetary compensation p for public wallet payment i ；
Step 7: winner v i Receipt of payment from TA, v i The confirmation information connmsg is sent back to the traffic control authority TA. The traffic control authority TA then signs the message with a confirmation message, so that a complete transaction record is formed;
step 8: the built-in intelligent synthetic date of the traffic management TA records a series of such transactions in the current city for a period of time and packages them into a new block. This block needs to go through the consensus process and then be added to the existing coalition chain. After the consensus process is completed, the block is permanently accessed to the coalition chain in linear timing order.
Preferably, the vehicle flow monitoring system based on the alliance chain and the internet of vehicles comprises an honest budget selection and pricing algorithm.
It follows that the one honest budget selection and pricing algorithm described comprises the following steps:
step 1 (winner allocation stage): in the winner allocation phase, the traffic management department TA follows a greedy strategy to select vehicles with the largest current unit marginal benefit from the active vehicle user set V to join the set X one by one. Specifically, the method comprises the steps of firstly selecting the vehicle to be selected according to unit marginal benefit when selecting the ith winnerSorting, and selecting the vehicle with the largest unit marginal benefit to add X on the premise that the total payment cost does not exceed the budget B i-1 Obtaining X i . At most L winners are selected to obtain a winner set X L ；
Step 2 (payment decision phase): from the active vehicle set V -i Is selected from L i Individual vehicle composition and v i Associated collectionI of (a) (j+1) Individual element->Selected by the traffic management department TA, the highest bid is defined as
The invention has the advantages that: the invention realizes reliable and efficient transaction of traffic information through the alliance chain technology, and designs a fair and honest mechanism to select information providers so as to maximize the benefits of traffic management departments of the Internet of vehicles platform and prevent malicious competition.
In order to enhance the safety and reliability of the system, the invention adopts an asymmetric encryption technology to realize a lightweight information transaction framework, and designs and realizes a reliable and efficient traffic monitoring system based on a alliance chain technology and a budget-limited reverse auction mechanism.
In order to excite a vehicle to bear a collection task, a budget-limited reverse auction algorithm is developed, individual rationality, profitability, authenticity and calculation efficiency are met, and a reputation-based DPoS consensus mechanism is designed to improve the efficiency of recording and storage in a alliance chain.
The invention stimulates the enthusiasm of vehicle individuals to finish tasks by innovatively defining utility functions and auction mechanisms for task completion in a crowdsourcing system, and designs an auction mechanism with budget limitation and integrity (Truthfulness) so as to fundamentally avoid market health damage caused by dishonest quotations of users, thereby ensuring that the target traffic vehicle flow monitoring task can be properly finished on the premise that the total cost can be controlled within the budget range.
[ description of the drawings ]
Fig. 1 is a diagram of traffic information transaction frames between a TA and a vehicle in accordance with the present invention.
FIG. 2 is an example BRTM system of the present invention.
[ detailed description ] of the invention
The present invention will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present invention more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
The invention belongs to the field of real-time traffic monitoring in smart cities. Specifically, the method is characterized in that a reliable, efficient and safe traffic monitoring platform system is built by utilizing a alliance chain technology to be connected with road vehicles, the problem of traffic flow monitoring by traffic management departments is solved, the traffic flow monitoring task is decomposed into real-time vehicles on a road through an internet of things crowdsourcing technology, the real-time vehicles on the road are distributed with traffic information collecting subtasks to avoid resource waste caused by large-scale camera arrangement, enthusiasm of vehicle individuals for completing tasks is stimulated through creatively defining utility functions and auction mechanisms for task completion in the crowdsourcing system, and the auction mechanisms with budget limitation and integrity (Truthfulness) are designed to fundamentally avoid market health damage caused by dishonest quotations of users, so that the method can properly complete the target traffic flow monitoring task on the premise that the overall cost can be controlled within a budget range. The method can be applied to the real-time traffic vehicle flow monitoring scene of the subordinate smart city.
Existing solutions for traffic flow monitoring can be divided into two categories. One is based on a scheme of additionally installing a monitoring probe on a monitored road section, and the other is based on a scheme of analyzing traffic flow by utilizing real-time data of road vehicles based on an Internet of things crowdsourcing technology. The former scheme requires massive cameras to be arranged at each road node, is very expensive and is easily damaged by nature or human factors. Most of the latter schemes fail to well guarantee user privacy or pay user data value in the design process, so that user enthusiasm is lost. Even if the solution is based on the blockchain, the technology is not applied to the traffic monitoring problem in advance at present, and the existing blockchain transaction mechanism of the internet of things cannot realize the characteristics of high reliability and low delay well, so that the real-time traffic monitoring requirement of a big data age cannot be met.
In view of the above, a traffic monitoring mechanism based on a alliance chain and the internet of vehicles is presented herein. We design and implement a reliable and efficient traffic monitoring system based on the alliance chain and reverse auction mechanism. By introducing an asymmetric encryption light-weight information transaction framework, the security and reliability of the system are improved, and meanwhile, the efficiency of recording and storing operations in the alliance chain is further improved based on a reputation-based trust right proving consensus mechanism. In order to promote the enthusiasm of users to participate in crowdsourcing tasks, a reverse auction algorithm with budget limitation is designed, the algorithm meets individuality, user profitability, honest and high calculation efficiency, and the platform can obtain maximum benefits on the premise of setting budget and ensuring fairness.
And a fair and honest mechanism is designed to select information providers to maximize profits of the internet of vehicles platform traffic management department and prevent malicious competition.
To achieve reliable and efficient transactions, the present invention employs and designs a coalition chain Based Real-time traffic monitoring system (BRTM). The system utilizes modern cryptography methods and digital signature techniques to protect the communication content from privacy disclosure. Aiming at the situation that the network resources of the vehicle are limited, the invention does not adopt the traditional Proof-of-Work (PoW) consensus mechanism, but redesigns a Proof-Based Delegated Proof-of-state (DPoS) consensus mechanism based on Reputation so as to reduce the confirmation time and improve the throughput of the system. All traffic authorities in each city may be considered complete nodes, which are interconnected to complete the consensus process. In BRTM systems, each traffic control authority has a reputation value associated with its behavior reflecting its behavior in the previous consensus round. A complete node with a higher reputation value means that it has a higher voting weight and is more likely to be the leader in future consensus rounds, thus ensuring the reliability and efficiency of the consensus process.
In order to solve the design problem of the fair and honest auction mechanism, the invention provides a reverse auction mechanism with limited budget so as to encourage vehicles in the city to actively take on the task issued by traffic management departments. Traffic management departments issue task sets that contain traffic information tasks for various locations. Each active vehicle submits the tasks it can complete and the corresponding, and then the traffic management department selects a winner set from the active vehicles to undertake its tasks and pay their rewards accordingly. The present invention aims to maximize the profit of traffic management by selecting the best winner set, which can be categorized as a non-monotonic sub-modulo maximization problem with knapsack constraints. A simple greedy strategy may give an effective solution, but it does not satisfy honesty. If there is no loyalty, vehicles may increase their utility by providing higher pricing or by hooking with other vehicles, which would compromise the fairness and effectiveness of the auction mechanism. Thus, the present invention designs an honest budget selection and pricing (Truthful Budgeted Selection and Pricing, TBSAP) algorithm to ensure personal rationality, profitability, authenticity, and computational efficiency of the auction mechanism.
(1) Introduction to System model
As shown in fig. 1, the model includes two main entities: traffic authorities (Traffic Administration, TA) and vehicles. The TA is responsible for monitoring real-time traffic conditions in the smart city and collecting traffic information by paying a certain amount to vehicles on the road. The vehicle may participate in data collection by accepting a task request from the TA. Smart city is denoted S a ，Wherein TA a Representing a city S a TA, V in (a) a ＝{v a1 ，v a2 ，...，v ab ,..} represents city S a All active vehicle users participating in this crowdsourcing task. When considering a city, we can also omit the city subscript for convenience of representation, such as the active user set v= { V 1 ，v 2 ，...，v n Sum local crowdsourcing task set t= { T 1 ，t 2 ，...，t m }. There is a set of delivery quality assessment mechanisms that will be done for each delivered task t j E T gives the completion quality score result a j . Vehicle user v i Can complete a set T consisting of a plurality of crowdsourcing tasks simultaneously based on the capability and willingness of the user i ，T i For a subset of T, the cost c of TA unknowns generated i . Then vehicle user v i At price b i Bidding task combination T i ，b i Representing v i Face T i The lowest price that can be accepted. One can embody a task to collect traffic information at a location in the city, so that a vehicle can complete multiple crowdsourcing tasks according to its own driving route and submit the results to the TA. TA then selects a winning vehicle set W and pays p for each user therein i Digital monetary compensation of (a), then the vehicle user v i The utility of E V is U in case of winning i ＝p i -c i Otherwise, 0; while TA yields +.>Wherein the method comprises the steps ofSecond, to facilitate cost control, the TA has a total digital monetary budget +.>
(2) Lightweight coalition chain design
The invention provides a mechanism based on alliance chain technology, which enables the TA and the vehicle to safely share data and ensures the reliability and the integrity of the data. The mechanism includes a federated link network based on consensus algorithms, an intelligent contract layer, and an application layer that provides user interfaces for different entities to share data. An example BRTM system is shown in FIG. 2, wherein gray bars indicate that the vehicle requests to assume a mission and black bars indicate that the TA accepts the corresponding request. The figure illustrates the interaction process between the TA and the vehicle.
(2.1) System initialization
Each vehicle needs to register with a Certificate Authority (CA) through a license plate associated with the CA to obtain a unique identification ID. Each legitimate vehicle will then be assigned a private/public key pair (SK i ，PK i ) Wherein the private key is maintained by the vehicle itself and the public key is a pseudonym known to all legitimate nodes in the federation chain. These key pairs are used to ensure the security and reliability of the data over the federation chain. Specifically, when a vehicle needs to submit data through the coalition chain, it encrypts the data using its own private key and sends the encrypted data onto the coalition chain. Other nodes may use the public key of the vehicle to decrypt the data and verify its authenticity. Likewise, when other nodes send data to the vehicle, they encrypt using the public key of the vehicle and send the encrypted data to the vehicle. Only the vehicle can decrypt the data and read its content using its private key. After registration, vehicle v i The certificate Cer signed by the private key of the CA will be obtained i The certificate may prove the authenticity of its identity. This way it is ensured that all data transmitted in the smart city is safe and reliable. Vehicle user v i Corresponding to an account A i ＝{ID i ，Cer i ，(SK i ，PK i )，B i }, wherein B is i To account for the digital currency balance. Similarly, TA also corresponds to an account a ' = { ID ', cer ', (SK ', PK '), B ', rep ' }, where B ' represents its digital monetary budget balance and Rep ' represents its reputation value. After a round of transaction is completed, the digital currency corresponding to the payment is transferred from B' to B i 。
(2.2) information transaction step
Step 1: the traffic management authority (TA) issues its task set T, which is sent to all active vehicles in the city. The published message may be expressed as pubmsg= { SK ' (T), cer ' and STime }, where the task set is encrypted by the TA's private key to ensure security, cer ' is the TA's digital certificate, and STime is the timestamp of the message when it was generated.
Step 2: upon receiving the task information PubMsg issued by the TA, the vehicle verifies the certificate of the TA using the public key of the CA, and decrypts the task set using the public key of the TA. v i Determining a subset of tasks to be accepted and corresponding offers based on their own status and location, denoted as task-price pairs (T i ，b i ) And submits request information reqmsg= { PK' (SK) i (T i ，b i ))，Cer i STime to TA. At this point the task-bid pair it submitted (T i ，b i ) Is through public key SK of TA i And if the encryption is carried out, only the TA can decrypt and read the content, so that the privacy is protected.
Step 3: the TA gathers all active users' requests and decides a set of winners W and each winner v therein i Corresponding consideration p i . This process is implemented by a built-in smart contract, which will use the following budgeted auction mechanism (see (3) honest budget selection and pricing algorithm (TBSAP)).
Step 4: TA sends order information to each v i E W, the information may be expressed as ordmsg= { PK i (SK′(p i ) Cer', STime }. Here reward information p i By v i Is encrypted by the public key SK' of (1) and can only be v i Decrypting the reading.
Step 5: if v i Receiving order information OrdMsg from TA, then means v i The traffic information provider that has been selected as the round of task. v i Can use the private key of the user to check OrdMsg information and complete the corresponding task T i Response message resmsg= { PK' (SK) i (data))，Cer i STime is sent back to TA. The information is encrypted by the TA public key for the same reason as in step 2.
Step 6: TA receives v i Returned crossAfter the information data is communicated, it is necessary to confirm whether the quality of the task completion meets its established standard. If it is, TA is v i Digital monetary compensation p for public wallet payment i 。
Step 7: upon receipt of payment from TA, v i The acknowledgement information connmsg is sent back to TA, connmsg= { PK' (SK) i (Confirm))，Cer i STime }. The TA is then signed with a confirmation message, and a complete transaction record is formed.
Step 8: the TA's built-in smart synthetic date records a series of such transactions over a period of time in the current city and packages them into a new block. This block needs to be added to the existing coalition chain through the consensus process, and the present invention adopts the DPoS consensus mechanism, which will be described in the next section (2.3). After the consensus process is completed, the block is permanently accessed to the coalition chain in linear timing order.
(2.3) reputation-based DPoS mechanism
The reputation-based DPoS mechanism comprises the following steps:
step 1 (Witness choice Witness electric): all TAs are considered to be Full nodes, and the Full Node set is represented asAll vehicles are Lightweight nodes (Lightweight nodes) that are limited to computing storage resources, storing only the block header files. The consensus process is performed between all nodes, eachAll having a reputation value Rep associated therewith a . The reputation value will determine its weight in the witness election. A TA with a higher reputation value will get more votes and be more likely to be selected as a witness. Because in each election period, for TA a Voting result R a Defined as->Wherein->Is an indication function. If TA a′ Voting support TA a Then->Otherwise, 0. Both the reputation value and the voting results are stored in the federation chain so that each node can check them on its own. Then select a witness Committee +.> Is made up of->The highest outcome of the votes is divided into two parts +.>And-> Representing a set of active witness +.>Representing a set of alternative witness persons. />From the highest voting result
A witness composition with the ability to generate new blobs like the leader, while an alternative witness can only verify and broadcast the blobs generated messageAnd (5) extinguishing.
Step 2 (Block Generation): will be assembledActive witness in (a) are arranged in random order, each +.>In turn, this ordering is the leader responsible for generating a new block. The leader must verify and check all transactions that have recently occurred and package those valid transactions into a new block. If a node fails to successfully generate a block within its own turn within a given time, it is skipped and no longer has the opportunity to become the leader during this election period. Through->After the secondary consensus round (i.e. one election period), the witness election is re-performed according to +.>A new witness Commission is selected for the new reputation value of the complete node>
Step 3 (consensus process Consensus Process): after a new block is generated, the leader should broadcast it to allAll witness should verify the identity of the leader and check this block. The results of their signature verification are then broadcast out through their private key. Next, each witness +.>Comparing the verification result with the verification results of other witness, and sending a piece of confirmation information to the collar after confirmationThe leader, on behalf of the witness, receives the new chunk synonymously. When the accepted witness ratio exceeds 2/3, the leader adds this new chunk to the federation chain. All full nodes should synchronize their local federation chain memory according to the longest chain principle, and all lightweight nodes will also update their federation chain header files.
Step 4 (reputation update Reputation Update): when one consensus wheel ends or breaks,
the corresponding reputation value of all nodes in (1) needs to be updated according to their performance in this round of consensus round. With Rep a (i) Represents the full node in the ith round of consensus round +.>Is to define delta first a (i)＝A·α a (i)+B·β a (i)+C·γ a (i) A. The invention relates to a method for producing a fibre-reinforced plastic composite When->Participate in witness election voting, alpha a (i) =1, otherwise α a (i) = -1. When TA a Beta not being the leader in this consensus round a (i) =0; if he is the leader and a new block accepted by the other witness is generated, beta a (i) =1, otherwise β a (i) = -1. When->If he is a witness but not the leader, if he correctly verifies the leader-generated blocks, gamma a (i) =1, otherwise γ a (i) = -1. If TA a Not witness, gamma a (i) =0. Next, define +.>Is a reputation value of (2):
setting all TA a Reputation initial value is Rep a (0) =0.5 and the coefficient is set according to importance as B > C > a > 0.
(3) Honest budget selection and pricing algorithm (TBSAP)
Assume the problem: the TA in the smart city S gathers the requests ((T) of all active users 1 ，b 1 )，(T 2 ，b 2 )，…，(T n ，b n ) The TA needs to select the winner set W and its corresponding reward set according to a policyThereby meeting budget constraints->The benefit P (W) of the TA is maximized under the limitations of (c), and this policy manager demonstrates that the individuality, profit, honest-type, and computational efficiency are met.
Assuming that the consideration given by TA is the same as the bid price of each vehicle, p i ＝b i The question may be converted to a budget allocation optimization question, i.e., selecting a winner set such thatMax, wherein-> Since this problem is reducible to the classical set coverage problem, which is an NP-hard problem, the optimal solution cannot be found in polynomial time. We will design an approximation algorithm that approximates the optimal solution as closely as possible while guaranteeing computational efficiency. It can be demonstrated that the presence of a specific agent,
is a sub-modulo function. Defining a marginal benefit function->b * Is a vehicle v * Is a price for (1). A well-known Myerson auction theory, a reverse auction mechanism is honest if and only if it satisfies monotonicity and Critical Payment characteristics. Based on this theory, the present invention designs a reverse auction mechanism with budget constraints, including a winner allocation phase and a payout decision phase. The detailed steps of this mechanism are given next.
Step 1 (winner allocation stage): first defining a unit marginal profit function asIn the winner allocation phase, the TA follows a greedy strategy to select one by one from the active vehicle user set V the vehicle joining set X with the largest current unit marginal benefit. Specifically expressed as that the vehicle to be selected is firstly subject to unit marginal benefit +.>Sorting, and selecting the vehicle with the largest unit marginal benefit to add X on the premise that the total payment cost does not exceed the budget B i-1 Obtaining X i . At most L winners are selected to obtain a winner set X L 。
Step 2 (payment decision phase): consider v i ∈X L For not containing v i Active vehicle set V of (2) -i Reference X L Is selected from V -i Is selected from L i Individual vehicle composition and v i Associated collectionIf to let v i Successful substitution->I of (a) (j+1) Individual element->Selected by TA, its highest bid is defined as +.>Thus, a maximum price list +.>Wherein each b' i(j) All by v i Replacement->The highest price allowed. So for any v i ∈X L Determining the payment is:
the above steps are summarized as algorithm 1.
The system of the invention protects communication content from privacy disclosure by using a modern cryptography method and a digital signature technology, designs a alliance chain database based on a Reputation entrusting and interest proving (DPoS) consensus mechanism, stimulates vehicles to bear collection tasks, and a lightweight transaction framework based on a budget limited reverse auction mechanism, meets individual rationality, profitability, authenticity and computational efficiency, and fundamentally avoids dishonest quotations of users by using an honest budget selection and pricing (Truthful Budgeted Selection and Pricing, TBSAP) algorithm.
The invention realizes reliable and efficient transaction of traffic information through the alliance chain technology, and designs a fair and honest mechanism to select information providers so as to maximize the income of traffic management departments of the Internet of vehicles platform and prevent malicious competition.
To achieve reliable and efficient transactions, the present invention employs and designs a coalition chain Based Real-time traffic monitoring system (BRTM). The system utilizes modern cryptography methods and digital signature techniques to protect the communication content from privacy disclosure. Aiming at the situation that the network resources of the vehicle are limited, the invention does not adopt the traditional Proof-of-Work (PoW) consensus mechanism, but redesigns a alliance chain database based on a Reputation delegate benefit Proof (DPoS) consensus mechanism, so as to reduce the confirmation time and improve the system throughput.
In order to solve the design problem of the fair and honest auction mechanism, the invention provides a lightweight transaction framework based on a budget-limited reverse auction mechanism, so as to encourage vehicles in the city to actively take on the task issued by traffic management departments. Thus, the present invention designs an honest budget selection and pricing (Truthful Budgeted Selection and Pricing, TBSAP) algorithm to ensure personal rationality, profitability, authenticity and metering of auction mechanisms.
The foregoing description of the preferred embodiments of the invention is not intended to be limiting, but rather is intended to cover all modifications, equivalents, alternatives, and improvements that fall within the spirit and scope of the invention.

Claims (7)

1. A traffic monitoring system based on a coalition chain and the internet of vehicles, the system comprising a coalition chain database based on a reputation delegated rights and interests proving consensus mechanism and a lightweight transaction framework based on a budget limited reverse auction mechanism, characterized in that:
the alliance chain database based on the reputation delegated proof consensus mechanism comprises a corresponding account of a vehicle user, a traffic management department account (TA) and a Certificate Authority (CA). Each of whichIndividual vehicles need to register with the certificate authority CA through a license plate associated with the CA to obtain a unique identification ID. Each legitimate vehicle will be assigned a private/public key pair (SK i ，PK i ) After registration, vehicle v i The certificate Cer signed by the private key of the CA will be obtained i The certificate may prove the authenticity of its identity.
The lightweight transaction framework based on the budget-limited reverse auction mechanism includes an honest budget selection and pricing algorithm.
2. The vehicle flow monitoring system based on alliance chains and internet of vehicles of claim 1, wherein: the alliance chain database based on the reputation delegate proof consensus mechanism comprises the following steps:
step 1 (witness choice): all traffic authorities TA are considered to be full nodesEach city/full node setAll having a reputation value Rep associated therewith a Reputation value Rep a Its weight in witness election will be determined and voting will take place.
Step 2 (block generation): to active witness collectionActive witness in (a) are ordered in random order, each city/active witness set +.>Alternately becoming a leader according to the order, responsible for generating a new block;
step 3 (consensus process): after a new block is generated, the leader should broadcast it to all the highest sets of votesAll witness should verify the identity of the leader and check this block;
step 4 (reputation update): when a consensus round ends or breaks, the full node setThe corresponding reputation value of all nodes in (1) needs to be updated according to their performance in this round of consensus round.
3. A coalition chain and internet of vehicles based traffic monitoring system according to claim 2, wherein: step 1 (witness selection) described, for each election period, for TA a Voting result R a The definition is as follows:
wherein TA a Representing a city S a In (1), a smart city is denoted as S a 。
4. A coalition chain and internet of vehicles based traffic monitoring system according to claim 2, wherein: step 4 (reputation update), when TA a Not witness gamma a (i) When=0, the following definition is givenIs a reputation value of (2):
all TAs a Reputation initial value is Rep a (0) =0.5 and the coefficient B > C > a > 0 is set according to importance,
wherein Pep a (i) Representing all nodes in the ith round of consensus roundIs the reputation, delta a (i)＝A·α a (i)+B·βa(i)+C·γ a (i)。
5. The vehicle flow monitoring system based on alliance chains and internet of vehicles of claim 1, wherein: the lightweight transaction framework based on budget limited reverse auction comprises the following steps:
step 1: the traffic management department TA issues its task set T, and sends it to all active vehicles in the city, and the issued message may be expressed as pubmsg= { SK '(T), cer', STime };
step 2: after the vehicle receives the task information PubMsg issued by the traffic management TA, the vehicle verifies the certificate of the traffic management TA using the public key of the certificate authority CA, and decrypts the task set using the public key of the traffic management TA.
Step 3: traffic control TA gathers all active user requests and decides winning vehicle set W and each winner v therein i Corresponding consideration p i ；
Step 4: traffic control authority TA sends order information OrdMsg to each winner/winning vehicle set v i E W, the order information may be represented as ordmsg= { PK i (SK′(p i ))，Cer′，STime}；
Step 5: winner v i The order information OrdMsg can be checked by using the private key of the user and the corresponding task T can be completed i The response message ResMsg is then sent back to the traffic control TA, which can be expressed as resmsg= { PK' (SK) i (data))，Cer i ，STime}；
Step 6:traffic control authority TA receives winner v i After returning the traffic information data, confirming that the quality of task completion reaches the established standard, and the traffic management department TA sends the traffic information data to the winner v i Digital monetary compensation p for public wallet payment i ；
The step 7: winner v i After receiving payment from traffic management authority TA, winner v i The confirmation information connmsg is sent back to the traffic management TA, which can be expressed as connmsg= { PK' (SK) i (Confirm))，Cer i ，STime}；
The step 8: the embedded intelligent dating department of traffic management TA records a series of such transactions in the current city for a period of time and packages them into a new block which is then permanently accessed into the coalition chain in linear time sequence order.
6. The vehicle flow monitoring system based on alliance chains and internet of vehicles of claim 1, wherein: an honest budget selection and pricing algorithm (i.e., budget-limited reverse auction mechanism) is described that includes the steps of:
step 1 (winner allocation stage): in the winner distribution stage, the traffic management department TA follows a greedy strategy to select one by one from the active vehicle user sets V the vehicle joining set X with the largest current unit marginal benefit, and select the vehicle joining set X with the largest unit marginal benefit i-1 Obtaining X i . At most L winners are selected to obtain a winner set X L . The unit marginal benefit function may be expressed as
Step 2 (payment decision phase): from the active vehicle set V -i Is selected from L i Individual vehicle composition and v i Associated collectionI of (a) (j+1) Element v i(j+1) Selected by traffic management department TAThe highest bid price is defined as
7. The vehicle flow monitoring system based on alliance chains and internet of vehicles of claim 6, wherein: step 2 (payment decision stage) of the complaint, v for any winner/winner set i ∈X L Determining the payment is:
CN202310649265.3A 2023-06-02 2023-06-02 Traffic flow monitoring system based on alliance chain and Internet of vehicles Pending CN116938516A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310649265.3A CN116938516A (en) 2023-06-02 2023-06-02 Traffic flow monitoring system based on alliance chain and Internet of vehicles

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310649265.3A CN116938516A (en) 2023-06-02 2023-06-02 Traffic flow monitoring system based on alliance chain and Internet of vehicles

Publications (1)

Publication Number Publication Date
CN116938516A true CN116938516A (en) 2023-10-24

Family

ID=88388520

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310649265.3A Pending CN116938516A (en) 2023-06-02 2023-06-02 Traffic flow monitoring system based on alliance chain and Internet of vehicles

Country Status (1)

Country Link
CN (1) CN116938516A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117750528A (en) * 2024-02-20 2024-03-22 南京信息工程大学 Automatic driving dynamic induction optimization method based on reverse auction algorithm

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117750528A (en) * 2024-02-20 2024-03-22 南京信息工程大学 Automatic driving dynamic induction optimization method based on reverse auction algorithm
CN117750528B (en) * 2024-02-20 2024-05-14 南京信息工程大学 Automatic driving dynamic induction optimization method based on reverse auction algorithm

Similar Documents

Publication Publication Date Title
Feng et al. MCS-Chain: Decentralized and trustworthy mobile crowdsourcing based on blockchain
Khorasany et al. Lightweight blockchain framework for location-aware peer-to-peer energy trading
CN109345438B (en) Privacy-protection alliance taxi taking method and system
US10554407B1 (en) Protocols for decentralized networks
Guo et al. Reliable traffic monitoring mechanisms based on blockchain in vehicular networks
CN113079486B (en) Vehicle networking crowd sensing and incentive method with privacy protection characteristic based on block chain
Wang et al. Secure ride-sharing services based on a consortium blockchain
CN112434343A (en) Virtual power plant safety scheduling and transaction method based on dual block chain technology
CN111292014A (en) Intelligent agricultural machinery scheduling system based on alliance chain and scheduling method thereof
Cao et al. Blockchain-empowered security and privacy protection technologies for smart grid
Wang et al. Blockchain-based model for nondeterministic crowdsensing strategy with vehicular team cooperation
CN112613861B (en) Electric power pre-selling transaction method, device and system based on alliance chain
Chen et al. Blockchain based non-repudiable IoT data trading: Simpler, faster, and cheaper
CN116938516A (en) Traffic flow monitoring system based on alliance chain and Internet of vehicles
Wang et al. A fast and secured vehicle-to-vehicle energy trading based on blockchain consensus in the internet of electric vehicles
US11245528B1 (en) Protocols for decentralized networks
CN113971597A (en) Shared charging pile transaction system, method, equipment and terminal
Yakubu et al. Blockchain-based secure multi-resource trading model for smart marketplace
Zhang et al. Designing secure and dependable mobile sensing mechanisms with revenue guarantees
Baranwal et al. Blockchain based resource allocation in cloud and distributed edge computing: A survey
CN113626876A (en) Consensus method based on power grid block chain
Wang et al. Towards a Smart Privacy‐Preserving Incentive Mechanism for Vehicular Crowd Sensing
Li et al. Multitask-Oriented Collaborative Crowdsensing Based on Reinforcement Learning and Blockchain for Intelligent Transportation System
Razmjouei et al. DAG-based smart contract for dynamic 6G wireless EVs charging system
Emami et al. A blockchain-based privacy-preserving anti-collusion data auction mechanism with an off-chain approach

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