To resolve the problem of low efficiency of ClusterTree routing algorithm and high control overhead of AODVjr.Routing algorithm,a new routing algorithm based on Target Cluster Tree is given on the basis of neighbor table and routing discovery mechanism of AODVjr.In this algorithm the ancestor nodes and descendant nodes are regarded as key search objects of the routing path between the source node and destination node,and its key point is to determine the next hop.There are two kinds of situation in the process of routing,one is that the nodes of target cluster tree are found in the adjacent nodes,and the other is that the next hop is choosed based on the improved AODVjr algorithm.The NS2 simulation results show that the routing algorithm in this paper has fewer routing hops than ClusterTree routing algorithm and less control overhead than AODVjr routing algorithm,it avoids going to extremes between these two parameters.