In order to reduce the amount of data transmission network and improve the efficiency of data integration and reduce network delay, a hybrid ant algorithm based on neighborhood search is proposed for wireless sensor networks data aggregation.First, Making use of the advantages of ant algorithm in searching for the shortest path, the algorithm construct the shortest path .To overcome the disadvantages of prematurity and slow the rate of convergence in ant algorithm, At the same time, a variable neighborhood search mutation operator is applied to optimize search results.when iterrations number is achieved.Not only the energy consumption is considered ,but also the data transmission delay is considered. Experiment results show that the algorithm which reduce energy consumption and tetwork delay ,is more stable and has better perfoming .