An Energy Efficient Routing and Fault Tolerant Data Aggregation (EERFTDA) algorithm for wireless sensor networks

Article type: Research Article

Authors: Subhashree, V.K.^{; *} | Tharini, C.

Affiliations: Department of Electronics and Communication Engineering, B.S. Abdur Rahman University, Vandalur, Chennai, Tamilnadu, India. E-mails: subhashree_ece_phd_2013@bsauniv.ac.in, tharini@bsauniv.ac.in

Correspondence: [*] Corresponding author. E-mail: subhashree_ece_phd_2013@bsauniv.ac.in.

Abstract: Major issues found in large scale wireless sensor networks are energy consumption of sensor nodes, redundant data transmission by neighbouring nodes, outlier generation due to unwanted event sensing and node failure. To address these issues, a novel Energy Efficient Routing and Fault Tolerant Data Aggregation (EERFTDA) algorithm is proposed. The key aspects of the proposed algorithm are reliable data aggregation and transmission by eliminating outlier and redundant data using locality sensitive hashing. Another advantage of the proposed algorithm is the bottleneck problem near sink nodes is overcome by the election of relay nodes based on residual energy. The performance of proposed algorithm is analyzed and compared with Data Routing for In-Network Aggregation (DRINA) algorithm for QoS parameters like delay, packet delivery ratio, energy efficiency and aggregation accuracy. The results indicate that EERFTDA provides improved aggregation accuracy and energy efficiency.

Keywords: Routing, data aggregation, locality sensitive hashing, outliers, fault tolerance, energy efficiency

DOI: 10.3233/JHS-170554

Journal: Journal of High Speed Networks, vol. 23, no. 1, pp. 15-32, 2017