Aiming at the peculiarities of the resource organization in distributed, heterogeneous grid environment, a new protocol based on resource tree is proposed in this paper. The resource tree is constructed through bounded two-level broadcasting technique. We investigate the data structures used by this protocol and the resource tree construction algorithm in detail in this paper. Our simulation results show that the protocol proposed in this paper has a number of advantages, including: low node storage overhead, supporting dynamic resource addition & deletion, effectively hiding the heterogeneity of the resources in wide-area networks, high scalability of resource organization, fast construction of resource trees and high resource searching performance, etc. Although there is some broadcasting overhead involved, we can still get relative high performance due to the limited number of control packets required in this protocol.