Implementation of DRINA Algorithm for Energy Efficient Routing in Wireless Sensor Network

Wireless Sensor Networks (WSNs) are widely implemented in different area of applications like Military surveillance, Home automation and Pollution monitoring etc. It is possible that the data collected by adjacent nodes can be redundant due to large numbers of nodes in these networks, so aggregation of data should be exploited for energy conservation in WSNs. It is very important to transmit the aggregated data to the sink node effectively and reliably. Here, DRINA (Data routing for in-network aggregation) algorithm is proposed. It uses data aggregation as key point and reliably route data using a fault-tolerant routing mechanism. The proposed algorithm is compared with two algorithms namely Shortest Path Tree and Information Fusion Based Role Assignment. The derived results shows that the total number of packet sent for same information is 67% less than Information Fusion Based Role Assignment algorithm and 73% less than Shortest Path Tree algorithm. The packet delivery ratio of proposed algorithm is 95 %.