z-logo
open-access-imgOpen Access
Lifetime enhancement in wireless sensor networks using binary search tree based data aggregation
Author(s) -
S. Gopikrishnan,
P. Priakanth
Publication year - 2018
Publication title -
journal of applied research and technology
Language(s) - English
Resource type - Journals
ISSN - 2448-6736
DOI - 10.22201/icat.16656423.2018.16.6.749
Subject(s) - data aggregator , wireless sensor network , computer science , computer network , energy consumption , tree (set theory) , key distribution in wireless sensor networks , key (lock) , binary tree , distributed computing , wireless , wireless network , algorithm , engineering , mathematics , mathematical analysis , telecommunications , electrical engineering , computer security
Energy efficient data aggregation is a key solution to enhance the lifetime of wireless sensor networks since sensor nodes are battery-powered and deployed in remote environments. This article explore a two-hop data aggregation tree construction algorithm using binary search tree to reduce the total energy consumption of sensor nodes in wireless sensor networks. An adaptive and hybrid routing algorithm for simultaneous data aggregation and exploit the data correlation between nodes using the two-hop data aggregation tree framework is proposed. Routes are chosen based on the shortest response time for the broadcasting request to minimize the total energy expended by the network. This paper also proposes a high secure asymmetric key cryptography algorithm to provide the secure data communication among the network. The data aggregation function that is used in the proposed routing algorithm enhances the lifetime of sensor network by resolving the delay, collision and security issues. Simulations results show that the binary tree based data aggregation can appreciably reduces the total energy consumption and resolves the maximum data aggregation issues in wireless sensor network.  

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here