This paper describes an algorithm for clustering an ad hoc network, in which the devices have highly varying resources. Such a heterogeneous ad hoc network is formed when wireless and fixed consumer devices like laptops, personal data assistants, cellular phones and servers automatically interconnect. The aim of clustering is twofold: to reduce broadcast traffic, which is typical to ad hoc routing protocols, and to concentrate traffic to devices with more available resources and less mobility. Further, the clustering process identifies nodes that are suitable for service provision. The algorithm is lightweight as it operates with a single periodically sent message. We provide simulation results that show the performance of the algorithm.