## 5 Simulation and Results
### Analysis of Indicator Simulation Results
#### 5.3.3 Reconstruction Performance of Cluster Head Failure Under Interference  
To evaluate the reconstruction ability of various algorithms with cluster head failures caused by interference or collision in emergency rescue environments, we randomly disable selected cluster heads during the simulation process. In the simulation, 200 nodes are randomly distributed and divided into 10 clusters. The simulation is repeated 20 times at each number of dropped cluster head nodes to obtain the average value. Figures 16 and 17  
Figure 15: Average cluster head duration.  
show the number of disconnected nodes and the reconfiguration time of the network after cluster head failure, respectively. Among them, dropped nodes refer to cluster members who are still unable to reconnect due to exceeding the communication range of the new cluster head after reconstruction is completed, and recovery time refers to the longest delay from the failure of the cluster head to the last cluster member rejoining the cluster. The disconnected node is the cluster member that, once reconfiguration ends, still lies outside the communication range of the new cluster head and therefore cannot rejoin. The reconfiguration time is the longest delay from the moment of cluster head failure to the instant the last member node rejoins the new cluster.  
In terms of the recovery time, the proposed CWCA algorithm demonstrates the best performance compared to K-means++, WCA, RS, and IWCA. When the cluster head fails, the backup cluster head in CWCA can respond rapidly and directly take over the member nodes within the cluster, enabling swift recovery. In contrast, K-means++, WCA, IWCA,  
Figure 16: Reconfiguration time after cluster head failure.  
Figure 17: Number of disconnected nodes after cluster head failure.  
and RS require the reselection of the cluster head before reconstructing the cluster structure, which results in longer recovery times. Among them, IWCA has the most complex cluster head selection process, leading to the longest recovery time. The RS algorithm employs a random cluster head selection mechanism, and its recovery time ranks second only to CWCA.  
Regarding the number of disconnected nodes, CWCA, K-means++, and IWCA all constrain the distance between nodes during initial clustering, thereby maintaining a relatively low and comparable level of node disconnection. In contrast, WCA and RS exhibit a significantly higher number of disconnected nodes, severely impairing network coverage. Although IWCA is also based on the K-means++ algorithm for initial partitioning, it reselects cluster heads within each partition using impact factors, resulting in slightly fewer disconnected nodes than the original K-means++. Because CWCA limits the number of nodes per partition, rather than strictly partitioning by distance, its performance in this aspect is slightly worse than k-means++.  
In summary, CWCA has the shortest reconfiguration time and fewer disconnected nodes in the scenario of cluster head failure, demonstrating superior stability and interference resilience relative to the other algorithms.