G

Graph with all the vehicles in the scenario

V(G)

G’s set of vertices. G

E(G)

G’s set of edges. G

v
 A vehicle ∈V(G)

L_{i}(x,y)

Current position with of x and y coordinates

id

Unique identification of the vehicle.

N(v_{i})

Neighbors list at 1hop of v

listN(v_{i})

Neighbors list at 2hop of v

\(G[E^{\prime }_{u}]\)

Subgraph containing the neighbors at 1 and 2hops

ϕ(v)

Function for identification of the cut vertex.

vCutting

Set of identified Cut Vertices

v
_{
s}

Sender vehicle

v
_{
c}

Candidate vehicle for data retransmission

R
_{
max}

Communication radius

T

Time window for updating
