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).

No abstract

Routing in mobile ad-hoc networks with a large number of nodes or with high mobility is a very difficult task and energy conservation is very important for mobile devices. In geographic routing each node require information about neighbors to forward data packets. Earlier periodic updations are used for location updation but it consumes much amount of node energy and bandwidth utilized for unnecessary updation where there is no changes in the location information. In this paper adaptive position update used with less energy consumption and utilize the bandwidth for location updation only when there is a change in the network. The GPSR protocol used for packet forwarding in both greedy forwarding and perimeter forwarding. This adaptive updation utilize only less amount of node energy than other beaconing scheme.