Performance Evaluation of MBA-OLSR Routing Protocol for MANETs

Algorithm 1

The multipath Dijkstra algorithm.

Calculate 𝑁 routes in 𝐺 from 𝑠 to 𝑑

𝑀𝑢𝑙𝑡𝑖𝑃𝑎𝑡ℎ𝐷𝑖𝑗𝑘𝑠𝑡𝑟𝑎(𝑠,𝑑,𝐺,𝑁)

𝐶₁=𝐶

𝐺₁=𝐺

for  𝑖=1 to 𝑁  do

 𝑆𝑜𝑢𝑟𝑐𝑒𝑇𝑟𝑒𝑒_𝑖=𝐷𝑖𝑗𝑘𝑠𝑡𝑟𝑎(𝐺_𝑖,𝑠)

 𝑃_𝑖=𝐺𝑒𝑡𝑃𝑎𝑡ℎ(𝑆𝑜𝑢𝑟𝑐𝑒𝑇𝑟𝑒𝑒_𝑖,𝑑)

 for all arcs e in 𝐸

  If  𝑒 is in 𝑃_𝑖 or 𝑅𝑒𝑣𝑒𝑟𝑠𝑒(𝑒) is in 𝑃_𝑖  then

   𝐶_𝑖+1(𝑒)=𝑓_𝑝(𝐶_𝑖(𝑒))

   else if the vertex 𝐻𝑒𝑎𝑑(𝑒) is in 𝑃_𝑖  then

   𝐶_𝑖+1(𝑒)=𝑓_𝑒(𝐶_𝑖(𝑒))

  else

   𝐶_𝑖+1(𝑒)=𝐶_𝑖(𝑒)

 end if

 end for

𝐺_𝑖+1=(𝑉,𝐸,𝐶_𝑖+1)

end for

return (𝑃₁,𝑃₂,…,𝑃_𝑁)