Abstract—The fundamental challenge in the design of Wireless Sensor Networks (WSNs) is to maximize their lifetime. Data aggregation has emerged as a basic approach in WSNs in order to reduce the number of transmissions of sensor nodes, hence minimizing the overall power consumption in the network. Data aggregation is affected by several factors, such as the placement of aggregation points, the aggregation function, and the density of sensors in the network. The determination of an optimal selection of aggregation points is thus extremely important. We present exact and approximate algorithms to find the minimum number of aggregation points in order to maximize the network lifetime. Our results clearly indicate that the routing tree built by SDRINA provides the best aggregation quality when compared to existing algorithms. The obtained results show that our proposed solution outperforms in different performance metrics and in different scenarios required by WSNs. We also study the tradeoffs between energy savings and the potential delay involved in the data aggregation process.

Index Terms—Keywords: In-network aggregation, Routing protocol, Wireless sensor networks, Clusters, Hop trees

Cite: Ajey Kumar R and Keerthi D S, "SDRINA: SECURED AND RELIABLE DATA ROUTING APPROACH FOR IN-NETWORK AGGREGATION IN WIRELESS SENSOR NETWORKS," International Journal of Electrical and Electronic Engineering & Telecommunications, Vol. 3, No. 3, pp. 1-10, July 2014.