## 3 Proposed Technique
### Finding Positions of the Nodes  
In our proposed technique, the node switches its communication method depending upon the connectivity of the adjacent node. An autonomous self-positioning technique using SAARICS to aid nodes in improved locations was used. Each node runs independently with the help of a local sensing area to make a decision on where to move. For node \(n_{i}\), the positions that are closer to it than to any of its neighbors belong to the SAARICS node \(S_{i}\) of \(n_{i}\). We formally defined the node \(n_{i}\) as  
\[S_{i}\ =\ \big{\{}\omega\ \epsilon\ \beta\ :di(n_{i},\ \omega\ )\ <di(n_{j},\ \omega\ )\,\ \forall\ n_{j}\in I\{n_{i}\ \} \tag{4}\]  
where \(\beta\) represents the set of all positions in \(L\)s, \(i\), \(I\) is a set of all nodes and \(di(n_{i})\), and \(\omega\) stands for Euclidean distance between nodes \(n_{i}\) where \(x_{i}\), \(y_{i}\) and locations \(x_{uv}\), \(y_{uv}\in\beta\).  
The interval between the node to node is defined as time \(j\) and time \(k\). At that time, the cluster will never divide or merge during the process. \(Dis(h)\) is defined as the range of \(h\) nodes among the inter cluster and the intra cluster. \(Disintra(h)\) is the distance between the nodes in the intra cluster and the \(Dis_{inter}(h)\) is classified into the node distance in the inter cluster between the \(K\) and G.  
\[Dis(h)=\alpha 1\times Dis_{intra(h)}+\ \alpha 2\ \times Dis_{inter(h)} \tag{5}\]  
where \(\alpha 1\) and \(\alpha 2\) are the weights of the \(Dis_{intra}(h)\) and \(Dis_{inter}(h)\), respectively. The ry node (the intermediate node present in every cluster) can calculate the distance \(Dis(h)\) and delivers the node information through the spanning tree. Then, the cluster head calculates \(Dis(h)\) divided by the transmission power (K-G) for all nodes in the cluster. The estimated cluster mobility range will be mentioned as \(Dis_{max}\).  
In Figure 3, the nodes are moved inside the cluster to connect with the flow of nodes from source to destination. The inter-cluster connection among the nodes is shown with 10 nodes, which are represented with three clusters, namely C1, C2, and C3. C1 consists of nodes 1, 2, 3, and 4. Node 5, 6, and 7 in C2 and cluster C3 contain nodes 8, 9, and 10, respectively. In Figure 4, the border node or the neighbour nodes to the other cluster nodes were moved to the adjacent cluster. Nodes 5, 3, 7, and 9 were moved from one cluster to another cluster, as shown in Figure 4. Node 3 switches its position from C1 to C2 without connections. It moves independently like node 6 and 7. Instead, node 5 moves to the first cluster and links with the node chain of 1, 2, and 4. In the same way, the nodes 6, 7, and 9 move inside the cluster. Figure 4 show the inter-cluster connection among the clusters. The maximum number of nodes crosses cluster to cluster and connects with the node chain in the individual cluster.  
Figure 4: Inter-Cluster Model with Movement of Nodes.  
Figure 3: Intra-Cluster Connection Among Nodes.  
In Figure 5, the single and multiple cluster scenarios are explained clearly. In the single cluster scenario, the nodes can be connected within a range and be automatically managed by themselves. In some cases, the nodes can be moved to the nearby clusters to connect the chain of the high-residual-energy nodes. Therefore, it has to transmit the information from one cluster to another cluster. Various possibilities for the node movement in the cluster scenario are also revealed. The nodes from the different cluster regions were connected with various aspects to transmit the information from one point to another. Sometimes, the source will be in one cluster and destination will be in another cluster region.