Recently, a promising network topology for wireless networks, the Hierarchical Layer Graph, has been introduced. This topology consists of arbitrary many layers of nodes with low-interference short-distance links in the lower layers and long-distance links in the higher layers which allow for paths with a small number of hops. The construction algorithm which was given for this topology is based on node IDs. In this paper, we present a novel distributed construction algorithm that computes each node?s rank in the hierarchy based on arbitrary metrics. A mathematical analysis shows the benefits which our algorithm entails.