A Safety-Aware Location Privacy-Preserving IoV Scheme with Road Congestion-Estimation in Mobile Edge Computing

View full-text article in PMC

. 2023 Jan 3;23(1):531. doi: 10.3390/s23010531

Algorithm 1 bcn Reception

1:
procedureOn_bcn_Reception(beacon* bsm) ▹ for each vehicle $v_{i}$ receiving a beacon $b s m$ from $v_{j}$
2:
Calculate the temporary distance $T e m p o_d i s t$ between $v_{i}$ and $v_{j}$ ;
3:
if $(T e m p o_d i s t < = D e l i m i t e r_r a d i u s)$ then ▹ if $v_{j}$ is a potential delimiter
4:
if $(T e m p o_d i s t < = P r v_N e i g h b o r_r a d i u s)$ then ▹ if $v_{j}$ is in the privacy neighbors radius
5:
$M y_s e t . i n s e r t (v_{j})$ ; ▹ insert $v_{j}$ in $M y_s e t$
6:
end if
7:
if ( $v_{i}$ and $v_{j}$ are on the same road) then
8:
if (( $v_{i}$ and $v_{j}$ are on the same direction) AND ( $v_{j}$ is in front of $v_{i}$ )) then
9:
if (( $v_{i}$ and $v_{j}$ are on the same lane) AND ( $T e m p o_d i s t$ is > than $F r o n t_1_d i s t$ )) then ▹ trying to obtain the farthest same lane front delimiter
10:
$F r o n t_1_i d \leftarrow b s m . S e n d e r I D ();$ ▹ which is $v_{j}$
11:
$F r o n t_1_d i s t \leftarrow T e m p o_d i s t;$ ▹ updating $F r o n t_1_d i s t$
12:
$F r o n t_1_s p e e d \leftarrow b s m . S e n d e r S p e e d ();$ ▹ updating $F r o n t_1_s p e e d$
13:
else if ( $T e m p o_d i s t$ is > than $F r o n t_2_d i s t$ ) then ▹ $v_{i}$ and $v_{j}$ are not on the same lane
14:
$F r o n t_2_i d \leftarrow b s m . S e n d e r I D ();$ ▹ which is $v_{j}$
15:
$F r o n t_2_d i s t \leftarrow T e m p o_d i s t;$ ▹ updating $F r o n t_2_d i s t$
16:
$F r o n t_2_s p e e d \leftarrow b s m . S e n d e r S p e e d ();$ ▹ updating $F r o n t_2_s p e e d$
17:
end if
18:
else if (( $v_{i}$ and $v_{j}$ are on the same direction) AND ( $v_{j}$ is behind of $v_{i}$ )) then
19:
if (( $v_{i}$ and $v_{j}$ are on the same lane) AND ( $T e m p o_d i s t$ is > than $R e a r_1_d i s t$ )) then ▹ trying to get the farthest same lane rear delimiter
20:
$R e a r_1_i d \leftarrow b s m . S e n d e r I D ();$ ▹ which is $v_{j}$
21:
$R e a r_1_d i s t \leftarrow T e m p o_d i s t;$ ▹ updating $R e a r_1_d i s t$
22:
$R e a r_1_s p e e d \leftarrow b s m . S e n d e r S p e e d ();$ ▹ updating $R e a r_1_s p e e d$
23:
else if ( $T e m p o_d i s t$ is > than $R e a r_2_d i s t$ ) then ▹ $v_{i}$ and $v_{j}$ are not on the same lane
24:
$R e a r_2_i d \leftarrow b s m . S e n d e r I D ();$ ▹ which is $v_{j}$
25:
$R e a r_2_d i s t \leftarrow T e m p o_d i s t;$ ▹ updating $R e a r_2_d i s t$
26:
$R e a r_2_s p e e d \leftarrow b s m . S e n d e r S p e e d ();$ ▹ updating $R e a r_2_s p e e d$
27:
end if
28:
end if
29:
end if
30:
end if
31:
$n_N e i g h b o r + +;$ ▹ increment the n_Neighbor number of $v_{i}$
32:
$P r o c e s s_B e a c o n (B S M);$
33:
end procedure