Abstrait

A Review on Routing Protocols for In-Network Aggregation in Wireless Sensor Networks

P.THIRUMOORTHY , DR.N.K.KARTHIKEYAN, S.SUDHA, B.MANIMEGALAI

In this project, we can design data aggregation using the routing protocols, that can reduce the cost of communication in the wireless sensor network. Due to the multiple sensor nodes has detected one or more events, results in heavy traffic. To save the energy, the network should notify the event properly, only when an event occurs. Overhead occurs in InFRA because its scalability is very low. In The proposed DRINA (Data Routing for In-Network Aggregation) algorithm reduces the communication cost and saves the energy consumption by building the routing tree, maximized the number of overlapping routes and eliminating the redundant data. The performance of the DRINA has compared to two other known protocols: the Information Fusion-based Role Assignment (InFRA) and Shortest Path Tree (SPT) algorithms and Centered-At- Nearest-Source algorithm.