Context-Aware Multicast Protocol for Emergency Message Dissemination in Vehicular Networks

Algorithm 1

Generating the network graph.

 input: 𝑉—the set of nodes (vehicles)

   𝑑_𝑢𝑣; ∀𝑢; 𝑣∈𝑉—the distance between 𝑢 and 𝑣

   𝑅_𝑢^𝑡𝑥,∀𝑢∈𝑉—the maximum transmission range

 output: 𝐸—the set of edges

(1)    𝐸⟵∅

(2)   for each pair of nodes (𝑢; 𝑣) in 𝑉 do

(3)   if 𝑑_𝑢𝑣≤𝑅_𝑢^𝑡𝑥 then 𝐸⟵𝐸∪{⟨𝑢,𝑣⟩}

(4)   if 𝑑_𝑢𝑣≤𝑅_𝑣^𝑡𝑥 then 𝐸⟵𝐸∪{⟨𝑢,𝑣⟩}