A study on routing approach for In-Network Aggregation in wireless sensor networks

In this study, we can design data aggregation using the routing protocols, Data aggregation can reduce the cost of communication in the wireless sensor network. Heavy traffic occurs when the multiple sensor nodes has detect one or more events. 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 three other known protocols: the Information Fusion-based Role Assignment (InFRA), Shortest Path Tree (SPT) algorithms and Centered-At-Nearest-Source algorithm (CNS).