“Bottleneck Nodes” are those connecting two or more areas alone with the reason of the deployment. Compared to other nodes, this kind of nodes are more important to the lifetime of the whole network. How to find these nodes is a problem about how to find the minimum cut set in graph theory, and is difficult to implement in a distributed way. In this paper, a new kind of nodes named “quasi-Bottleneck Nodes” which have similar effect on the performance of the wireless sensor network and can be found out much more easily is introduced. Theoretical analysis and extensive simulation show that “quasi-Bottleneck Nodes” have a significant impact on the performance of the whole network (including the speed of energy consumption and packet lost ratio), and a distributed algorithm to find out all the “quasi-Bottleneck Nodes” and two effective solutions to eliminate the bad effect of these nodes are presented.