Algorithm 2 Prioritized warning message dissemination.

Input:S, D, R, ${\alpha }_f$, and W Output:$B_f$ selection and time slot reservation for warning message dissemination Begin: Repeat   If D∈R Then      S$>>$D   Else      For i = 1 To sizeof(R)         ${\mu }_i$⟵$|D_x-R_{i_x}|$ + $|D_y-R_{i_y}|$         ${\kappa }_i$⟵$H(R_i,D)$             If $H(S,D)$ = 1 Then                If S = Rear & D = Front node Then                    ${\delta }_i$⟵$\frac{{\mu }_i}{{\kappa }_i}$                Else                    ${\delta }_i$⟵${\mu }_i$${\kappa }_i$                End If             Else                If S, D move towards each other Then                    ${\delta }_i$⟵$\frac{{\mu }_i}{{\kappa }_i}$                Else                    ${\delta }_i$⟵${\mu }_i$${\kappa }_i$                End If             End If      End For      $B_f$⟵ Min($\delta$)      If ${\alpha }_f$ = $\varphi$ Then         If W[SN_bit] = 1             ℓ⟵W[severity_bits]             Switch(ℓ)                Case: 00                    S waits for a free ${\daleth }_s$                Case: 01                    S requests to release a ${\daleth }_s$                Case: 10                    S releases ${\daleth }_s$ already reserved by                    a non-warning or a lower priority warning                    message.             End Switch         Else             S waits for a free ${\daleth }_s$         End If      Else         S reserves a ${\daleth }_s$ from ${\alpha }_f$      End If         S$>>$$B_f$         S⟵$B_f$   End If Until$B_f$ = D End