High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

Maximizing Lifetime, Security and Data Aggregation Using HEF Algorithm


Shilpa R , National Institute Of Engineering; Arpitha M, National Institute Of Engineering; Soumya Bhusanur, National Institute Of Engineering; Syeda Tameem, National Institute Of Engineering


Wireless Sensor Networks, Clustering, Cluster Head, Encryption, Decryption


Wireless Sensor Networks have gained wide popularity in the recent years for its high-ranking applications such as remote environment monitoring, target tracking, safety-critical monitoring etc. However Wireless Sensor Networks face many constraints like low computational power, small storage, and limited energy resources. Two of the chief issues associated with Wireless Sensor Networks are network lifetime and data security which we aim to address here. In our proposed system we aim to maximize the network lifetime of Wireless Sensor Networks by choosing High Energy First (HEF) clustering algorithm as a design reference model for cluster head selection, which is to the best of our knowledge proved to be an optimal clustering policy under certain ideal conditions, together with a sleep/active algorithm to avoid any unnecessary energy dissipation by the sensor nodes. We also aim to address the issue of sensor data security by opting for Paillier homomorphism encryption, which is an end to end data security plan that can guarantee end-to-end data confidentiality with less transmission latency and computation cost contrasting with the hop by hop data security which involves more consumption of battery power due to several decryptions at every hop. In this paper we trying to maximize the lifetime of the data aggregation and security and we are trying to fix the benchmark for this[1].

Other Details

Paper ID: IJSRDV4I40376
Published in: Volume : 4, Issue : 4
Publication Date: 01/07/2016
Page(s): 228-232

Article Preview

Download Article