## 3 Proposed Technique
### Autonomous Clustering  
Hierarchical clustering will lead to autonomous clustering. Autonomous clustering will be conducted in two possible ways, internal clustering (Intra Cluster) and external clustering (Inter Cluster). The intra-cluster scenario will work with the tree mode of transaction. It uses tree scenarios along with CH activity. The inter cluster works among the different cloud leads to route searching and route holding. It uses standard AODV protocol to broadcast the information from source to destination. Without the support of the CH, the node in both scenarios will not operate. The CH node kicks the next neighbor node to connect with the communication flow. The residual energy of each node plays a vital role to connect with the next node in the scenario. In the proposed technique, the self-organizing of nodes in the cluster was deeply discussed. Self-organizing among the nodes of the independent cluster forms a temporary backbone node and an energy consumption process with the help of the Initialize node, named the kick node or leader node. The kick node is the first and the starting node in the cluster. While at the formation of the cluster, the first node will be the leader node and  
Figure 1: Flowchart of the Self-Organizing Chain. search for the other nearest node to connect to. Self-organizing will happen in two major ways: (1) tree-based scenario and (2) zone-based scenario. The tree-based scenario helps to connect the individual node to form a chain. The information from the source to the destination will be channelized through the tree-based structure. It mainly helps to form the initial work of the self-organizing scenario. However, in the zone-based scenario, the interconnected nodes will be formed in a bunch, which helps to segment similar energy nodes among the clusters. In SAARICS, controlling of the node density plays a major role to avoid unnecessary issues in the cluster scenario. The node will be controlled in the MANET with the help of transmission power. SAARICS predominantly works as a high-assurance network. Moreover, the proposed SAARICS avoids packet loss and energy consumption by controlling and reducing the density of nodes because each node in the cluster avails the transmission power to transmit the data from place to place. Even though the possibility of the nodes will be in two scenarios, the intra-cluster scenario plays a vital role. By merging, splitting, and holding the nodes, the transmission power of the nodes will be managed and controlled. The self-clustering technique, or the algorithm, is a distributed algorithm that executes each node and the cluster node relationship autonomously. The failure of the individual node never affects the other node in the network. As it is a self-organized cluster of nodes, automatically, the failure node will be diminished or dropped down by the leader of the cluster CH [20]. That helps to continue the network communication without any disturbances. The pairing of the basic two nodes is shown clearly in Figure 2.  
Initially, node \(n_{1}\) starts to identify the adjacent node, considering the adjacent node as n. After identifying the adjacent node, node \(n_{1}\) will compare the transmission power of the adjacent node. Upon comparing the transmission power, node \(n_{1}\) forwards the node chain request to node \(n_{2}\) and receives a response from node \(n_{2}\) to form a self-organizing node chain connection. Since the cluster leader or head is the dominant power producer in the cluster group, the complete transmission energy of the cluster makes a beeline to be limited to diminish the impedance created by the groups. The total energy consumption of each node will be calculated to obtain the overall frequency range of the cluster formation. The individual \(i\)th node transmission power is more important than the summation of all nodes in the cluster:  
\[\sum_{i=1}^{H}Po_{i\bar{k}} \tag{1}\]  
Figure 2: Pairing of Two Nodes.