Abstract: In order to overcome the disadvantages of LEACH(low energy adaptive clustering hierarchy) in randomly choosing cluster heads and in single-hop communications among cluster heads,we propose a new clustering routing algorithm ,i.e.,RACMH(radius adaptive clustering multi-hop routing algorithm).The new algorithm combines the radius adaptive clustering technology with the multi-hop communication mode,and the nodes become either the cluster heads or the cluster members in an independent way according to local communication.The covered regions of the clusters are limited in a certain radius,and all the cluster heads build a routing tree according to the weight message and transport data to the base station in a multi-hop communication manner.Simulation is made,and the results show that,compared with LEACH,the algorithm performs much better in prolonging network lifetime,saving network energy dissipation and balancing network load.