## 4 Optimized Hidden Node Detection Paradigm
### Hidden Node Detection
The load factor 'N\({}_{l}\)' requires the buffer capacity that is calculated d by using the Equation (9). \[N_{l}=\left[\frac{N_{helllo}}{N_{bm}}\right] \tag{9}\]

Table 2 shows the details of the notations used and their respective explanations. \begin{table}
\begin{tabular}{c c} \hline \hline
**Notation** & **Description** \\ \hline \(C_{es}\) & Consumed energy of coordinator node for synchronization \\ \(M_{s}\) & Number of synchronized messages by each newly joining node \\ \(E_{r}\) & Energy consumed by radio of multimedia sensor \\ \(E_{a}\) & Energy consumed for amplifying \\ \hline \hline \end{tabular}
\end{table} 
Table 2: Notations used and their description. When the nodes that are available at the distance of a one hop neighborhood node of coordinator node receive the messages they start calculating distance from the coordinator node to detect the hidden nodes depicted in Figure 3. Let us assume that coordinator node 'C' has three neighbor nodes: '\(N_{n1}\)', '\(N_{n2}\)' and '\(N_{n3}\)' with distance that calculates '\(d_{1}\)', '\(d_{2}\)' and '\(d_{3}\)' with known ranges '\(r_{1}\)', '\(r_{2}\)', '\(r_{3}\)' and '\(r_{4}\)' and '\(r_{n}\)' a hidden node '\(N_{h}\)'. Hence, the straight distance is at the possible values '\(s_{1}\)' and '\(s_{2}\)' from the coordinator node. The neighbor discovery method used in [27] is applied if there exist more than three multimedia sensor nodes. Thus, multimedia sensor nodes of more than three are connected either by '\(N_{n1}\)', '\(N_{n2}\)' and '\(N_{n3}\)'. We replace '\(N_{n1}\)', '\(N_{n2}\)', '\(N_{n3}\)' and '\(N_{nm}\)' with a new joined node or an existing hidden node that yields a pair of distance approximations. We can include more neighbor nodes to make a more accurate selection. ### Message Exchange Phase

In this phase, the multimedia sensor nodes exist at a 1-hop neighborhood node that initiates the message exchange process to gather the information about the neighboring nodes. All sensor nodes use unicast addressing methodology that refers to the neighbor handshake indication (NHI) process. The NHI contains the identity of the nodes and the current location of the multimedia sensor node. Let us assume that the mobile multimedia sensor node comprises an identical standpoint and a list \begin{table}
\begin{tabular}{c c} \hline \hline
**Notation** & **Description** \\ \hline \(S_{n}\) & Number of synchronizing nodes \\ d & Distance between coordinator and newly joined node \\ \(E_{b}\) & Energy consumed for broadcasting \\ \(E_{s}\) & Energy consumed by coordinator node for scheduling \\ \(C\) & Coordinator node \\ \(C_{n}\) & Non-coordinator nodes \\ \(C_{i\epsilon}\) & Coordinator’s initial energy \\ \(C_{n\epsilon}\) & Residual energy of coordinator \\ \(E_{k\epsilon}\) & Energy consumed by coordinator node for data collection \\ \(\mathrm{Sd}\) & Subdivision \\ \(N_{l}\) & Node load \\ \(N_{hello}\) & Number of hello message by node \\ \(N_{wn}\) & Maximum buffer size of node \\ \(N_{h}\) & Hidden node \\ \hline \hline \end{tabular}
\end{table} 
Table 2: _Cont._

Figure 3: Hidden node discovery process. of overlapped neighbor nodes that are accessible in the same sensing position that yields the NHI. This aims to guarantee that each multimedia sensor node should detect their neighbor's hidden nodes and their location:

\[T_{n}=\sum_{i=0}^{N}(N_{ni}\ ) \tag{10}\]

In Equation (10), the total neighbor nodes '\(T_{n}\)' are calculated to determine the exact number of all 1-hop neighbor nodes.