Table - PMC

Skip to main content

View full-text article in PMC

. 2024 May 2;24(9):2913. doi: 10.3390/s24092913

Algorithm 1: Collect CPP at junctions

Input:

C u r r P o s_{G P S}

,

J u n c_{P o s}

,

P a c k e t_{C P P}

,

C P P_M a n a g e m e n t_{t a b l e}

Output: void

Begin
$T i m e r_{c o l l e c t i o n}$ ← null
if $C u r r P o s_{G P S}$ = $J u n c_{P o s}$ then
if $P a c k e t_{C P P} . Type$ = CPP_Master OR CPP_Sub_Set AND then
$T i m e r_{c o l l e c t i o n}$ ← GetTimerStart(1 s)
while $T i m e r_{c o l l e c t i o n}$ ≠ TIMEOUT do
if $P a c k e t_{C P P} . Type$ = CPP_Master then
$C P P_M a n a g e m e n t_{t a b l e}$ .Update( $P a c k e t_{c p p}$ )
else if $P a c k e t_{c p p} . Type$ = CPP_SubSet then
$C P P_M a n a g e m e n t_{t a b l e}$ .Update( $P a c k e t_{c p p}$ )
else if
if $C P P_M a n a g e m e n t_{t a b l e}$ ≠ null then
if $C u r r P o s_{G P S}$ = $J u n c_{P o s}$ then
FindOptimizedPath( $C P P_M a n a g e m e n t_{t a b l e}$ )
end if
end if
end while
end if
end if
return 0