OPPOURTUNISTIC FLOODING IN LOW DUTY-CYCLE WIRELESS SENSOR NETWORKS WITH RELIABLE LINKS

Abstract

In this research an algorithm called DATAF (Data Aggregation Tree and Acknowledgement  Based Flooding) is proposed. An Acknowledgement Based Flooding, which exploits the linkdetection to achieve flooding reliability using the concept of collective ACKs. And then by using data aggregation tree framework for these processes it requires the help of the shortest path way by using a multi-hop wireless protocol. By using an algorithm for DAT, called Directed Diffusion for Data Propagation and Aggregation. It works mostly with how query or interest is going to be diffused throughout the network. By simulation, the proposed scheme significantly reduces energy consumption caused by broadcasting of messages as well as it improves appropriate data reliability in wireless sensor networks. In this proposed system, a new concept is proposed a calculation called Data Aggregation Tree and Ack Based Flooding. Showcasing a new Ack Based Flooding, this misuses the connection location to accomplish flooding unwavering quality utilizing the idea of aggregate ACKs. And after that by utilizing information conglomeration tree system for this procedure it requires the assistance of briefest pathway by utilizing a multi-jump wireless convention. Here by utilizing calculation for DAT, called Directed Diffusion for information engendering and conglomeration. This calculation does not rely on upon any topological requirement. This calculation is information driven calculation. It works for the most part with how inquiry or interest will be diffused all through the system. Here this research accomplished improved flooding proficiency, Low vitality utilization, High execution and reduced postponement and repetition