Intended for network-wide dissemination of commands, configurations and code binaries, flooding has been investigated extensively in wireless networks. However, little work has yet been done on low-duty-cycle wireless sensor networks in which nodes stay asleep most of time and wake up asynchronously. In this type of network, a broadcasting packet is rarely received by multiple nodes simultaneously, a unique constraining feature that makes existing solutions unsuitable. Combined with unreliable links, flooding in low-duty-cycle networks is a new challenging issue. Therefore, flooding tree construction is an important and fundamental problem in WSNs, and has been extensively investigated in the literature. However, we note that the flooding tree construction problem in asynchronous low-duty-cycle WSNs has not been sufficiently investigated in existing work. So, in this paper we study about various flooding techniques like Minimum-Delay and Energy-Efficient Flooding Tree in Asynchronous Low-Duty-Cycle and Opportunistic Flooding in Low-Duty-Cycle Wireless Sensor Networks with Unreliable Links , after we get the performance result of every flooding technique. Index Terms- WSN, Flooding, low-duty-cycle, Sink, Delay
