Description

Wireless sensor networks have emerged as a unmarked type of networking systems with limited computing, communication, and storage possessions. A wireless sensor networks consists of nodes located to sense environmental condition for a broad range of applications, such as background monitoring, scientific assessment, disaster discovery, field examination, and configuration monitoring. In these applications, prolonging the wireless sensor network lifetime of and guaranteeing packet release delays are important for achieving suitable quality of service. In the existing system, many sensing applications share in common that their source nodes deliver packets to sink nodes via multiple hops, leading, to the problem on how to find routes that enable all packets to be delivered in required time frames, while simultaneously taking into account factors such as energy efficiency and load balancing. The technique that is used in this project is to make it simpler for wireless sensor networks problem. To make the energy more efficient a protocol is used that is called EDAL. It is rebuilt from the existing system called OVR which uses NP-hard algorithm. To make more prominent a centralized heuristic is design to make the computational overhead more smaller and to detect the dead nodes. As it has some limitation distributed heuristic is design which is the best for large scale networks. The centralized heuristics that has developed in EDAL requires information to be collected from each node to a centralized one. But in distributed sensor networks, step will typically incur additional overhead.