Algorithm 2 Optimal Number of UDAP in a Wireless Network

Step: 1  $\mathbf{Input}\mathbf{data}:$ $\mathrm{Initialize}\mathrm{variables}$ $CapNodo=\mu \forall \mu \in \mathbb{N}$ $Coverage=\lambda \forall \lambda \in {\mathbb{Q}}^{+}$ Step: 2  $\mathbf{Minimum}\mathbf{spanning}\mathbf{tree}\mathbf{generation}:$ $B_{M,N}\leftarrow zeros$ for  $i=1:M$ $\hspace{1em}$$XY1=[X_T(1:N),Y_T(1:N)]$ $\hspace{1em}$$XY2=[X_T(N+i),Y_T(N+i)]$ $\hspace{1em}$$tmp\leftarrow Prim(XY1,XY2,CapNodo,Coverage)$ $\hspace{1em}$$B(i,temp)\leftarrow ones$ endfor Step: 3  $\mathbf{SCP}\mathbf{resolution}\mathbf{and}\mathbf{UDAP}\mathbf{selection}:$ $s\leftarrow sum\left(B\right);L=1:N$ $ind\leftarrow find(s=0)$ $L\left(ind\right)\leftarrow ⌀;B(:,ind)\leftarrow ⌀;B=B^{\prime }$ $[solC,solL]\leftarrow GreedySCP\left(B\right)$ $R\leftarrow ordered\left(sol{L}^{\prime }{,}^{\prime }row{s}^{\prime }\right)$ $X_{el}=X_d\left(R\right);Y_{el}=Y_d\left(R\right)$ $X_d=X_{el};Y_d=Y_{el}$ Step: 4  $\mathbf{Calculation}\mathbf{of}\mathbf{distances}:$ $G\leftarrow ⌀;M=length\left(X_{el}\right);D\leftarrow ⌀$ $X_T=[X_u,X_d,X_{eb},X_c];Y_T=[Y_u,Y_d,Y_{eb},Y_c]$ for  $i=1:card\left(X_T\right)$ $\hspace{1em}$for  $j=1:card\left(Y_T\right)$ $\hspace{1em}\hspace{1em}$$D(i,j)\leftarrow Haversine(\left[Y_i{X}_i\right],\left[Y_j{X}_j\right])$ $\hspace{1em}$endfor endfor $D(D=0)\leftarrow \infty$ Step: 5  $\mathbf{Minimum}\mathbf{roads}\mathbf{and}\mathbf{route}\mathbf{costs}:$ $D_{max}\leftarrow \delta \forall \delta \in {\mathbb{Q}}^{+}$ $G\leftarrow Assignweights(D,D_{max},N,M,K,P)$ $\left[rpciai\right]\leftarrow \mathrm{compress}\mathrm{sparse}\mathrm{matrix}\left(G\right)$ $A=\left[rpciai\right]$ $pred\leftarrow Dijkstra(A,\alpha )$ $CostT\leftarrow RouteCost(\alpha ,pred)$