Escape Path Obstacle-Based Mobility Model (EPOM) for Campus Delay-Tolerant Network

Algorithm 2

Escape path movement for node i.

	Initially escapeVertex = ϕ, neighbors = ϕ, distToDest = ϕ
(1)	get obstacle’s vertices
(2)	escapeVertex: = nearest vertex
(3)	Repeat
(4)	move to the escapeVertex
(5)	neighbors: = neighbor vertices
(6)	escapeVertex: = nearest neighbor
(7)	until distToDeste (escapeVertex) ≤ distToDest (all neighbors)
(8)	move to the destination(1)Move along the shortest path trajectories until an obstacle is reached, keeping a minimal distance to the obstacle.(2)Generate an escape path using Algorithm 2.(3)Complete the movement to the next obstacle (in case of more than one obstacle) or destination.(4)Repeat 2 and 3 until the final destination is reached.