Vehicle-to-Vehicle (V2V) Message Content Plausibility Check for Platoons through Low-Power Beaconing

. 2019 Dec 12;19(24):5493. doi: 10.3390/s19245493

Algorithm 1 Whisper check at U.

1:
procedureWhisper-Check( $W_{V}$ ) ▹U received whisper $W_{V}$ from V
2:
Extract $L_{V}$ , $I_{V}$ , and $d i g (C_{V})$ from $W_{V}$
3:
if $I_{U} \in L_{V}$ then ▹ Did V hear my whisper?
4:
if $B_{U} (I_{V}) = = \emptyset$ then ▹B is the WID-certificate binding set; No binding exists for V yet
5:
$B_{U} (I_{V}) \leftarrow d i g (C_{V})$ ▹ Make one for V; $C_{V}$ is the link to BSM from V
6:
$L_{U} \leftarrow L_{U} \cup I_{V}$ ▹ Store V’s whisper ID (WID) for rebroadcast
7:
8:
else ▹ Binding exists for $I_{V}$
9:
if $B_{U} (I_{V}) = = d i g (C_{V})$ then ▹ Binding confirmed?
10:
$C (I_{V})$ ++ ▹ Credit up
11:
else ▹ Conflict
12:
return ▹ Ignore this whisper
13:
end if
14:
end if
15:
else
16:
return ▹ Ignore this unverifiable neighbor
17:
end if
18:
end procedure