Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. Neighboring devices elect one appropriate device as clusterhead. Due to the dynamic environment, clusterhead selection becomes an important issue. We consider the problem of appropriate clusterhead selection in wireless ad-hoc networks and sensor networks. This work analyzes synchronous as well as asynchronous heuristics for discovering nodes with prolonged topological stability. These nodes appear more appropriate to be elected as clusterheads, since the frequency of clusterhead re-election and re-clustering can be decreased. The heuristics described rely on 2-hop topological information and avoid any use of geographical data.