Algorithm 1: Placing $d_{max}$ sensors with the highest DM score and the lowest correlation

Set:                ${\mathsf{\Omega }}^d=\varphi$ Compute $D{M}_{\omega } \forall \omega \in \mathsf{\Omega }$ Place the first sensor in the location with the highest DM score,              ${\omega }^{*}=\underset{\omega \in \mathsf{\Omega }}{\max }D{M}_{\omega }$ Set: ${\mathsf{\Omega }}^d\leftarrow {\omega }^{*}$ $d\leftarrow d_{max}-1$ While $d>0$ do: Find $\left\{\min \left(N,\left|\mathsf{\Omega }\backslash \left({\mathsf{\Omega }}^d{{\displaystyle \cup }}^{ }{B}^d\right)\right|\right)\right\}$ candidate locations in all optional locations, $\mathsf{\Omega }\backslash \left({\mathsf{\Omega }}^d{{\displaystyle \cup }}^{ }{B}^d\right)$, with the highest DM score:        ${\mathsf{\Omega }}^N=\underset{\begin{array}{c}\omega \in \Omega \backslash \left({\mathsf{\Omega }}^d{{\displaystyle \cup }}^{ }{B}^d\right)\\ \left|{\mathsf{\Omega }}^N\right|=\min \left(N,\left| \mathsf{\Omega }\backslash \left({\mathsf{\Omega }}^d{{\displaystyle \cup }}^{ }{B}^d\right)\right|\right)\end{array}}{\max }D{M}_{\omega }$ For each location in ${\omega }^n\in {\mathsf{\Omega }}^N$, compute the correlation of $C_{\omega }^q$ with all locations where sensors have already been placed; i.e., ${\omega }^d\in {\mathsf{\Omega }}^d$. Place the next sensor in location ${\omega }^{*}$ within ${\mathsf{\Omega }}^N$, which presents the lowest summation of correlations with all locations in ${\mathsf{\Omega }}^d$:         ${\omega }^{*}=\underset{{\omega }^n\in {\mathsf{\Omega }}^N}{\min }{\displaystyle {\displaystyle \sum }_{{\omega }^d\in {\mathsf{\Omega }}^d}}corr\left(C_{{\omega }^d}^q,C_{{\omega }^n}^q \right)$ Set:          i. ${\mathsf{\Omega }}^d\leftarrow {\mathsf{\Omega }}^d{{\displaystyle \cup }}^{ }{\omega }^{*}$          ii. $d\leftarrow d_{max}-1$