Algorithm 2: Vehicles Messages receiving and priority allocation based on deadline and size

Input: (Vehicles Messages) Output: $W_1$ & $W_2$ (Messages Priorities)   For 1 to n    $\mathsf{\Omega }$ = $M_s$//Receive Messages from $V_i$ (i = 1 to n) and assign to $\mathsf{\Omega }$   End of for loop   For 1 to n Find Weight of  $\mathsf{\Omega }$ according to message nature    W = Deadline * Size   If W =< Deadline * Size of theTable 1     then assign $W_1$ in ascending order    Else $W_2$    Return $W_1$& $W_2$   End of for loop