In order to speed up the path searching and cut the energy consumption , a new bestworst ant system (BWAS)based dynamic clustering routing algorith m for wireless sensor networks are presented in this paper. The optimal multihop path from clusterhead nodes to sink node was found while the dynamic clusterin g models were used for energy management in wireless sensor networks. It transmit s the data to the sink node along this path. The ant colony algorithm was improv ed by evaluating the best and worst ants during the path searching process and t he rewardpunishment mechanism was introduced to guide the search, which avoid o verusing a certain gate node and balance the energy consumption in the network w ith the dynamic clustering models. Compared with the ACS routing algorithm, the BWAS algorithm alleviates the energy consumption of the nodes and extends the se rvice life of wireless sensor networks. It has less dead nodes during the same t ime and has good robustness.