The invention relates to route method based on tree structure. It includes the following steps: judging data source after grouping; for the lower level node checking up run routing list, selecting one node as relay node, and transmitting the data grouping into the upper level node; for the upper level node checking the down run routing list, selecting one route reached to destination node, and transmitting the data grouping to the next jump node. The up run routing list records the node ID, jump number and the neighbor node ID and jump number. The down one records upper layer node list, peer node list, down run chain route information. The invention has the advantages of little control spending, high data transmitting efficiency, low bandwidth consumption, suiting for network topology dynamic change.