## 3 Materials and Methods  
A description of the notation used in this article is presented in Table 2. \begin{table}
\begin{tabular}{c c c} \hline \hline
**Authors** & **Main Focus/Outcome** & **Factors Not Taken into Account** \\ \hline [PERSON]. [PERSON], [PERSON] & Method for infrared and cameras sensor & \\ [PERSON], [PERSON], [PERSON] & fusion applied to indoor positioning in & Value of intersection of coverage areas. \\ [PERSON], [PERSON] [5] & intelligent spaces. & \\ \hline [PERSON], [PERSON] [6] & The method of optimal coverage of the & Square of uncovered territory. Possibility \\  & territory by sensors of different & of changing intersection value. \\  & coverage radius. & \\ \hline [PERSON], [PERSON], [PERSON] [7] & An algorithm to cover a given area while & Square of uncovered area, the \\  & prioritizing areas of higher fire hazard risk. & intersection of coverage areas. \\ \hline [PERSON]. [PERSON], [PERSON], [PERSON], [PERSON] [8] & The placement of sensors optimizing & Value of intersection of coverage areas. \\  & (accuracy and cost). & Network’s cost. \\ \hline [PERSON], [PERSON], [PERSON], [PERSON], [PERSON], [PERSON], & Node redeployment-based & Network’s cost. Uncovered area. \\  & [PERSON] [9] & Bodacious-instance Coverage Mechanism. \\ \hline [PERSON], [PERSON], & The use of low-cost sensor networks in the & The intersection of coverage areas, \\  & environmental sciences. & network’s survivability. \\ \hline [PERSON], [PERSON], [PERSON] [10] & The optimization of the neighbor discovery & \\  & to reduce the power consumption in wireless & Network’s survivability. \\  & sensor networks. & \\ \hline [PERSON], [PERSON], P. & Cost-effective wireless sensor & \\ [PERSON], [PERSON], [PERSON], [PERSON] & network system. & Uncovered area, system survivability. \\  & [PERSON] [13,14] & Structure-based identification method to & \\  & [PERSON] [15] & identify the influential nodes in & Connections between nodes vulnerability \\  & industrial networks & \\ \hline [PERSON], [PERSON], V. & Approach to estimating the survivability of a & \\  & Serven network based on Dijkstra and & Sensors and connections bandwidth. \\  & Lee algorithms. & \\ \hline [PERSON], [PERSON], [PERSON] [17] & Network viability using & \\  & Markov chains. & Sensor network’s survivability. \\ \hline \hline \end{tabular}
\end{table} 
Table 1: Literature review comparison. The task of maximizing the coverage of the sensor network while minimizing the cost and assessing the survivability will be solved in two steps. The first step is to find the optimal parameters of the network and territory coverage construction. The second step is an assessment of the survivability of the obtained network. To find the optimal parameters of the network and for the construction of territory coverage, we consider an area of arbitrary shape with an area that is equal to \(T_{s}\) m\({}^{2}\). This area should be covered by sensors with a radius of coverage \(r\) m. The coverage area of one sensor is denoted as \(S_{1}\). The cost of the entire network will be equal to the number of network sensors multiplied by the cost of one sensor. The cost of the sensor is understood as the total costs associated with the purchase, operation and maintenance of the sensor. The cost of one sensor is denoted as \(P_{1}\), and the area of the covered area as \(S_{covered}\). Thus, the task of minimizing the cost of the network with maximization of coverage can be presented as:  
\[\left\{ \begin{array}{l}P=NP_{1}\to min\\ S_{covered}\to max\end{array} \right.. \tag{1}\]  
In Equation (1), \(N\) is the number of sensors, which is calculated as follows:  
\[N=\left[\frac{T_{s}}{S_{1}}\right], \tag{2}\]  
where \(T_{s}\)--area of the territory, \(S_{1}\)--the area covered by one sensor. To find the exact number of sensors, the possibility of the intersection of the sensor coverage areas and the size of the uncovered area should be taken into account. Therefore, the coverage area of one sensor should not be considered as \(\pi r^{2}\).