Node Value and Content Popularity-Based Caching Strategy for Massive VANETs

Algorithm 1

The process to get betweenness centrality and eigenvector centrality. Set forward path.

G: the network topology

Initialize,,,

for node on the delivery path from consumer to server do

 if content in cache

  then send content back to the consumer

    discard interest packet

 else

  get the adjacency matrix of the nodes according G

  : record the number of shortest paths between and

  : record number of shortest paths from to through

  calculate,

   ⟵ 

   ⟵ 

  forward the interest packet to the next hop towards server

 end if

end for