A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks

Algorithm 1

Maintaining the matrix 𝐴 and its slide-windows.

Require: packet 𝑀_𝑘, current time 𝑡+1

Ensure: matrix 𝐴, slide-window win

   When packet 𝑀_𝑘 comes

   local  variables:  𝑖,𝑗,𝑐

(1)  𝑖←𝑀_𝑘.𝑔𝑒𝑡𝑆𝑜𝑢𝑟𝑐𝑒𝑁𝑜𝑑𝑒𝐼𝐷()

(2) 𝑆𝑒𝑞𝑢𝑒𝑛𝑐𝑒←𝑀_𝑘.𝑔𝑒𝑡𝑃𝑎𝑠𝑠𝑒𝑑𝑁𝑜𝑑𝑒𝑠()

(3) 𝑐←1

(4) for  𝑗∈𝑆𝑒𝑞𝑢𝑒𝑛𝑐𝑒  do

(5)   win[𝑖,𝑗,𝑡]←𝑐

(6)   𝑐←𝑐+1

(7) end for

(8) for  𝑖←1 to 𝑛  do

(9)  for  𝑗←1 to 𝑛  do

(10)  𝑎_𝑖,𝑗←∑^𝑘=𝑡_{𝑘=𝑡−𝑟+1}win𝑖,𝑗,𝑘𝑟

(11) end  for

(12) end for

(13) return  𝐴, win