In this paper we suggest a mechanism to describe the quality of nodes over time from the network point of view, and use this quality for extracting the links connecting the pair of best nodes. Therefore, links (or nodes) can be properly selected so as to improve the routing performance. We also present a distributed algorithm to construct a forest of nodes with the high quality. The constructed forest reduces the broadcasting overhead by selecting a subset of the neighboring nodes for forwarding a packet. Furthermore, the subset of the forwarding nodes belongs to the set of nodes with the high quality, which in turn improves routing performance. We also provide some simulation results to show the efficiency of the algorithm.