Algorithm 1 Repeated Link Reinforcement Process-Run at destination node.
1:	Rc← Ø;
2:	Rb← Ø;
3:	while connection is ACTIVE do
4:	$R_c=\prod _{i=1}^n{R}_i$	▹ Ri: PDR value of ith link
5:	if Rc < Rreq && Rc ≥ Rb(1+ξ) then
6:	Rb =Rc;
7:	(u,v) = Determine poorest link;	▹ u,v ∈ G
8:	Initiate a link reinforcement process (v);
9:	else if Rc ≥ Rreqthen
10:	Rb← ø;
11:	Pause for time(trei);
12:	else if Rc ≤ Rbthen
13:	Rb← ø;
14:	Remove newly added robotic relay node;
15:	Pause for time(trei);
16:	end if
17:	end while