Policy 1 Selection Policy
1:	BEGIN:
2:	$k$: denotes the current time slot, $x$: denotes the duration of time slot.
3:	INPUT: $D\left(0\right), n, \lambda ,\alpha , {\alpha }_2,\Delta v$
4:	If $∆v=0$ then
5:		$D=D\left(0\right)$
6:	Else
7:	$D\left(k\right)=D\left(k-1\right)=kx∆v$
8:	End if
9:	Acquire: $H_s\left(k\right), {\gamma }_s\left(k\right)$ via $D\left(k\right)$
10:	Acquire: UAVL’s position: $d_1\left(k\right), d_2\left(k\right)$
11:	While     $E\left(k\right)={\left[0,1\right]}^T\left|{\displaystyle |}E\left(k\right)={\left[1,0\right]}^T{\displaystyle |}\right|J\left(k\right)={\left[0,1\right]}^T{\displaystyle |}{\displaystyle |}J\left(k\right)={\left[1,0\right]}^T$  do
12:		Acquire: $P_L\left(k\right)=P_L^e\left(k\right)+P_L^j\left(k\right)$
13:		power set in all cases: $\left\{P_L^i\left(k\right)\right\},\mathrm{i}=1,2,3,4.$
14:	End while
15:	For$i=1:4, i++$ do
16:		If the Equations (13) (14) (15) then
17:		derive Power-efficient package rate maximum problem
18:		Acquire $P_L^{i*}\left(k\right)$
19:		else
20:		$P_L^{i*}\left(k\right)=0, E\left(k\right)={\left[0,0\right]}^T, J\left(k\right)={\left[0,0\right]}^T$
21:		Endif
22:	endfor
23:	$P_L^{*}\left(k\right)=\min \left\{P_L^{i*}\left(k\right)\right\}, i^{*}=\arg \min \left\{P_L^{i*}\left(k\right)\right\}$
24:	Output: $E\left(k\right)=E^{i*}\left(k\right), J\left(k\right)=J^{i*}\left(k\right)$
25:	If$E\left(k\right)=E\left(k-1\right)\&\&J\left(k\right)=J\left(k-1\right)$ then
26:		UAVL doesn’t shift the eavesdropping-jamming model.
27:	else
28:		UAVL shifts the eavesdropping-jamming model from $E\left(k-1\right), J\left(k-1\right) to E\left(k\right), J\left(k\right)$
29:	endif
30:	$k=k+1$
31:	Go back to line 6 until $k=m+1$
32:	END