The two most well-known techniques for addressing the scalability issues in this research, which concentrate on unstructured networks, are Ad hoc wireless networks and clustering. This study investigates the clustering technique to manage enduring clusters for structured networks under size restrictions. We noticed that there was no formal basis for ad-hoc network clustering in the literature. Our research closes this gap by promoting the application of Cooperative game theory connecting players’ clusters, and alliances to nodes. For this theoretical context, we can create a special clustering algorithm for scattered nodes in general. This algorithm, which has been shown is founded on the idea of switch operations, in which nodes decide whether or not to leave their coalition based on the effectiveness of the alliance. A transferable capability is present in the coalition-forming game, and these choices are made independently on each node. This general approach is therefore chosen for carefully defining their value functions and the heuristics used to choose the appropriate switch operations, both structured and unstructured networks can be efficiently used. according to these detailed Through simulations, we demonstrate which we suggested results work better than those currently in use, particularly the size and stability of the cluster.