Scheduling the nodes to work alternately can prolong the network lifetime efficiently. The existing solutions usually depend on the geographic information which may compromise the effectiveness as a whole. In this paper, a stochastic sleeping scheduling mechanism is studied and four stochastic scheduling schemes based on different information are introduced. Furthermore, analysis and simulation are provided in detail. The results show that stochastic sleeping scheduling mechanism can reduce the working node number and guarantee a high coverage rate in different level if the sleeping probability is set based on neighbors information properly.