Efficient Data Aggregation Scheme in Secure Tree based Wireless Sensor Networks (EDAS)

Khalid Khan

Abstract

Wireless sensor networks (WSNs) have emerged as an important area of research from the last two decades. In WSNs, sensors have limited memory, computational capability and battery power. One of the solutions to these issues is to reduce the data transmission and today, various data aggregation protocols have been proposed to reduce network traffic. But they created security issues like authentication, data integrity and freshness. Hop-by-hop secure data aggregation protocols were proposed to provide security along with data aggregation function. But, data on the aggregators still need to be secured because aggregators are exposed to node compromises. End-to-end secure data aggregation protocols are proposed. They provide end-to-end security and privacy of data. One of these protocols is Secure End-to-End Data Aggregation (SEEDA), which ensured end-to-end privacy of data. However, the protocol has higher communication cost and computational overheads because it sends extra bits/data regarding non-responding nodes and performs unnecessary computations for non-responding nodes. I proposed new protocol, EDAS which reduces 12% to 25% communication and computational overheads as compared to SEEDA and it is also efficient in energy consumption.

Keywords    Wireless Sensor Networks, WSNs, Privacy, Secure Data Aggregation, Homomorphic Encryption

Journal   IOARP Journal of Communication and Networks
Volume   Volume 4
Issue   Issue 1, June 2024
Date Published   30 June 2024
Published in   IOARP Journal of Communication and Networks
Date Appeared in GDL   15 July 2024

Pages   17
Global Digital Library Number   GDL-IOARP-JCN04-002
Copyright © 2015-2024 IOARP

Journal Homepage on Global Digital Library

Download Paper

121 Downloads