## 5 Analyses and Simulation Results
### Analyses on the Fair Camera Node Selection (FCNS) Algorithm
\begin{table}
\begin{tabular}{|c|c|c|c|c|c|c|c|c|c|c|c|c|c|} \hline \hline  & \multicolumn{2}{|c|}{**Camera ID**} & **1** & **2** & **3** & **4** & **5** & **6** & **7** & **8** & **9** & **10** & **11** & **12** \\ \cline{2-13}
**Query** & \multicolumn{2}{|c|}{Camera Selection Times} & \multicolumn{2}{|c|}{Camera Selection Times} & \multicolumn{2}{|c|}{Camera Selection Times} & \multicolumn{2}{|c|}{8} & 7 & 8 & 7 & 8 & 8 & 9 & 8 & 7 & 7 & 8 & 8 \\
**Number = 15** & \multicolumn{2}{|c|}{Camera Selection Times} & \multicolumn{2}{|c|}{8} & 7 & 8 & 7 & 8 & 0 & 0 & 15 & 7 & 15 & 0 & 6 \\ \hline  & \multicolumn{2}{|c|}{**Camera ID**} & **13** & **14** & **15** & **16** & **17** & **18** & **19** & **20** & **21** & **22** & **23** & **24** \\ \cline{2-13}
**Query** & \multicolumn{2}{|c|}{Camera Selection Times} & \multicolumn{2}{|c|}{7} & 8 & 8 & 8 & 6 & 8 & 8 & 8 & 8 & 8 & 9 & 9 \\
**Number = 15** & \multicolumn{2}{|c|}{Camera Selection Times} & \multicolumn{2}{|c|}{8} & 6 & 3 & 15 & 0 & 0 & 0 & 15 & 15 & 11 & 4 & 15 & 0 \\  & \multicolumn{2}{|c|}{with MCNS Algorithm} & \multicolumn{2}{|c|}{**Camera ID**} & **1** & **2** & **3** & **4** & **5** & **6** & **7** & **8** & **9** & **10** & **11** & **12** \\ \cline{2-13}
**Query** & \multicolumn{2}{|c|}{Camera Selection Times} & \multicolumn{2}{|c|}{15} & 15 & 15 & 15 & 15 & 15 & 16 & 16 & 15 & 15 & 15 & 15 & 15 \\
**Number = 30** & \multicolumn{2}{|c|}{Camera Selection Times} & \multicolumn{2}{|c|}{15} & 15 & 14 & 16 & 12 & 0 & 0 & 30 & 18 & 30 & 0 & 9 \\ \cline{2-13}
**Number = 30** & \multicolumn{2}{|c|}{Camera ID} & **13** & **14** & **15** & **16** & **17** & **18** & **19** & **20** & **21** & **22** & **23** & **24** \\ \cline{2-13}
**Query** & \multicolumn{2}{|c|}{Camera Selection Times} & \multicolumn{2}{|c|}{15} & 15 & 15 & 16 & 15 & 14 & 15 & 16 & 15 & 16 & 15 & 17 & 16 \\
**Number = 30** & \multicolumn{2}{|c|}{Camera Selection Times} & \multicolumn{2}{|c|}{10} & 11 & 30 & 0 & 0 & 0 & 30 & 30 & 14 & 16 & 30 & 0 \\ \hline \end{tabular}
\end{table} 
Table 2: Numbers of camera sensor selections. which are selected more. Consequently, by losing some nodes before the other ones, responding to queries with good coverage is impossible. To analyze the coverage issue in detail, another simulation is presented. The aim of this simulation is to compare coverage of desired area in many queries by presented algorithm and Minimum Camera Node Selection algorithm. The simulation has the same assumptions of subsection 5.1 (such as Coverage Data Structure, network topology) and it is related to a cluster head with 24 camera nodes. Also, it is assumed that all camera nodes have 2J energy at the beginning and according to Table 1 each camera will fail after 30 times of activation. Figure 10 depicts the average coverage percent of both algorithms in 60 queries. As Figure 10 shows, the coverage percent of the presented algorithm is high in roughly the first 60 queries and then the coverage reduces extremely because many nodes fail almost together. But, coverage percent of MCNS reduces by about 20% after 30 th and 60 th queries because of some nodes failure. Simulation results show: although the presented algorithm gets minimum coverage more quickly, it provides good coverage for longer time in comparison with MCNS.