Method for sharing models among autonomous vehicles based on blockchain

Patent metadata

Field	Value
Publication number	US-11509472-B2
Application number	US-202117155057-A
Country	US
Kind code	B2
Filing date	Jan 21, 2021
Priority date	Jan 22, 2020
Publication date	Nov 22, 2022
Grant date	Nov 22, 2022

Abstract

The present disclosure discloses a method for sharing models among autonomous vehicles based on a blockchain, the method comprising the steps of: 1) creating a mobile edge computing network; 2) generating a key pair for each node in the mobile edge computing network; 3) creating a local model set of a mobile node set in the mobile node computing network; 4) enabling each mobile node to communicate with a corresponding nearest mobile edge computing node; 5) creating supernode sequences by the mobile edge computing node; 6) creating a blockchain based on the supernode sequences; and 7) updating the local model set.

First claim

The invention claimed is:

1. A method for sharing models among autonomous vehicles based on a blockchain, comprising the steps of:
(1) creating a mobile edge computing network by:
providing autonomous vehicles each installed with on-board sensors as mobile nodes and providing road side units as mobile edge computing nodes, and creating the mobile edge computing network configured for a wireless communication between each mobile node and each mobile edge computing node by using a mobile node set V comprising m mobile nodes and a mobile edge computing node set MECN comprising n mobile edge computing nodes,
where V={v 1 ,v 2 , . . . ,v j , . . . ,v m }, v j represents a j-th mobile node and m≥2, and
MECN={MECN 1 , MECN 2 , . . . , MECN k , . . . , MECN n }, MECN k represents a k-th mobile edge computing node and n≥50;

(2) generating a key pair for each mobile node and each mobile edge computing node in the mobile edge computing network by:
calculating a first key pair for each mobile node and a second key pair for each mobile edge computing node in the mobile edge computing network by using the Elliptic Curve Cryptography, to obtain a first key pair set Key V of the mobile node set V and a second key pair set Key MECN of the mobile edge computing node set MECN, wherein
Key V ={( K 1 pu ,K 1 pr ),( K 2 pu ,K 2 pr ), . . . ,( K j pu ,K j pr ), . . . ,( K m pu ,K m pr )}
Key MECN ={( K 1 pu , K 1 pr ),( K 2 pu , K 2 pr ), . . . ,( K k pu , K k pr ), . . . ,( K n pu , K n pr )}

where K j pu and K j pr represent first public and private keys of the j-th mobile node v j respectively, and K k pu and K k pr represent second public and private keys of the k-th computing node MECN k respectively;
(3) creating a local model set LM of the mobile node set V by:
inputting, by each mobile node, environmental perception information acquired by the on-board sensors of each mobile node, to a deep neural network DNN for iterative training, to obtain the local model set LM of the mobile node set V, wherein
LM={lm 1 ,lm 2 , . . . ,lm j , . . . ,lm m }

where lm j represents a local model of the j-th mobile node v j ;
(4) enabling the j-th mobile node v j to communicate with the nearest k-th mobile edge computing node MECN k from the j-th mobile node v j by the sub-steps of:
(4a) selecting, by the j-th mobile node v j , the nearest k-th mobile edge computing node MECN k from the j-th mobile node v j , based on the environmental perception information acquired by the sensors of the j-th mobile node v j , and sending a local model uploading request L_Req v j and the first private key K k pr to the nearest k-th mobile edge computing node MECN k , wherein

L_Req

v
j

⁢

:

⁢

⁢

{

K
j
pu

lm
j

timestamp
j

}

where timestamp j represents when the local model uploading request L_Req v j is established by the j-th mobile node v j ;
(4b) viewing, by the nearest k-th mobile edge computing node MECN k , the local model uploading request L_Rec v j , via the first private key K j pr , and then confirming, by the nearest k-th mobile edge computing node MECN k , an identity of the j-th mobile node v j sending the local model uploading request L_Req v j , via the first public key K k pu , and then sending from the nearest k-th mobile edge computing node MECN k to the j-th mobile node v j a response L_Res MECN k of allowing the local model lm j of the j-th mobile node v j to be uploaded and the second private key K k pr ,

L_Res

MECN
k

⁢

:

⁢

⁢

{

L_Req

v
j

K
_

k
pu

timestamp
k

}

where timestamp k represents when the response L_Res MECN k is established by the nearest k-th mobile edge computing node MECN k ;
(4c) uploading from the j-th mobile node v j to the nearest k-th mobile edge computing node MECN k the local model lm j of the j-th mobile node v j ;
(5) creating P supernode sequences, by the mobile edge computing node set MECN, by the sub-steps of:
(5a) setting the number of iterations as p, where initially p=1, and setting the maximum number of iterations as P, where P≥1;
(5b) selecting, by the mobile edge computing node set MECN, 21 mobile edge computing nodes as supernodes depending on a BFT-DPoS consensus mechanism and randomly sorting the 21 mobile edge computing nodes to obtain a supernode sequence
MECN p ={ MECN s p , s= 1, 2, . . . , 21},

where MECN s p represents a s-th supernode of the 21 supernodes selected at a p-th time;
(5c) judging whether p=P or not, if the judgment result is yes, creating the P supernode sequences, otherwise, setting p=p+1 and performing the sub-step (5b);
(6) creating a blockchain based on the P supernode sequences by the sub-steps of:
(6a) setting a t-th block in the blockchain to be created as Block t , where h(Block t ) is a Hash Value of the Block t and timestamp t is a timestamp of Block t , and setting t=1, p=1, and s=1;
(6b) generating, by the MECN s p , a Block t comprising the LM, the h(Block t ), and the timestamp t , and setting the Block t as a genesis block of the blockchain to be created;
(6c) setting s=2 and t=2;
(6d) generating, by the MECN s p , a Block t comprising the LM, the h(Block t ), the h(Block t-1 ) and the timestamp t ;
(6e) broadcasting, by the MECN s p , the Block t to other supernodes, where h(Block t ) is compared with a preset threshold ε by each of the other supernodes, if the h(Block t )<ε, then the Block t is valid, otherwise the Block t is inv

Assignees

• Univ Xidian

Inventors

• Li Changle
• Li Fan
• Fu Yuchuan
• Zhao Pincan

Classifications

• G06N3/045

  Combinations of networks · CPC title

• H04L9/3066 Primary

  involving algebraic varieties, e.g. elliptic or hyper-elliptic curves · CPC title

• G06N3/08

  Learning methods · CPC title

• H04L2209/84

  Vehicles · CPC title

• H04L9/0643 Primary

  Hash functions, e.g. MD5, SHA, HMAC or f9 MAC · CPC title