The Differ-Level Flooding Protocol Based On Wireless Sensor Networks

For the simpleness and robustness of the traditional Structure-less Routing, it has been the best choice of Wireless Sensor Networks, especially when low processing ability nodes exist in the networks. Flooding is a typical traditional Structure-less Routing, but for the problem of "Information Explosion" and "Overlap", we now use its improved versions. Gossiping solve the "Information Explosion" problem but did nothing to "reduplicate". SPIN Routing solve the problem in a consult way which is very effective and save energy consumption, but its implementation procedure is relatively complex. When less data need to be collection, the "three times hand shake" waste unnecessary energy.This paper proposes a classification flooding algorithm, it abandons consult way in favor of using two methods to determine which node has the right to flooding. The base station broadcast message to make sure all the nodes time synchronization.at the same time nodes do not need to exchange information. We get a better synchronization but pay for a little. By reading the field values in the sensor data packet to decide whether to send messages or not, and the process uses no more than 10 time allocation's method, which reduces the delay in data transmission. results on OMNET++platform shows that, compared with Flooding, the algorithms not only keep simple and robust, but also greatly reduce the amount of nodes which will forward messages in Flooding, and the diffusion efficiency has greatly improved. As a Structure-less Routing protocols, it fit for small and medium networks.