An Efficient Approach for Data Aggregation Routing using Survival Analysis in Wireless Sensor Networks

Abstract

Wireless Sensor Network (WSN) is a collection of small sensor nodes with a communications infrastructure to achieve mutual communication and to monitor and record conditions at diverse locations. The major constraints of WSN are limited availability of power and it is prone to frequent node failures. In order to prolong the lifetime of the sensor nodes, the sensor data should efficiently reach the base station and there should be a reduction in message transmission, which consumes the majority of the battery power. Aggregation of data at intermediate sensor nodes helps in saving the energy that would be spent if the nodes send directly to the base station. In addition to aggregation, the mechanism to overcome node failures is also essential to ensure the successful delivery of the data packets to the base station. This paper proposes an efficient way based on inverse-square law along with survival analysis for aggregating data without the formation of an explicit structure and to overcome node failures. Our evaluation of performance shows a considerable decrease in the number of transmissions required to carry the sensed data to the base station and also a considerable increase in packet delivery ratio. By using this approach, it is possible to minimize power usage of sensor nodes effectively.