Article
Version 1
Preserved in Portico This version is not peer-reviewed
A Secure Data Aggregation Algorithm Based on Trust Mechanism
Version 1
: Received: 4 June 2024 / Approved: 5 June 2024 / Online: 6 June 2024 (07:28:27 CEST)
A peer-reviewed article of this Preprint also exists.
Liu, C.; Ye, J. A Secure Data Aggregation Algorithm Based on a Trust Mechanism. Sensors 2024, 24, 4352. Liu, C.; Ye, J. A Secure Data Aggregation Algorithm Based on a Trust Mechanism. Sensors 2024, 24, 4352.
Abstract
Due to the uniqueness of the underwater environment, traditional data aggregation schemes face many challenges. Most existing data aggregation solutions do not fully consider node trustworthiness, which may result in the inclusion of falsified data sent by malicious nodes during the aggregation process, thereby affecting the accuracy of the aggregated results. Additionally, because of the dynamically changing nature of the underwater environment, current solutions often lack sufficient flexibility to handle situations such as node movement and network topology changes, significantly impacting the stability and reliability of data transmission. To address the aforementioned issues, this paper proposes a secure data aggregation algorithm based on a trust mechanism. By dynamically adjusting the number and size of node slices based on node trust values and transmission distances, the proposed algorithm effectively reduces network communication overhead and improves the accuracy of data aggregation. Due to the variability in the number of node slices, even if attackers intercept some slices, it is difficult for them to reconstruct the complete data, thereby ensuring data security.
Keywords
underwater wireless sensor networks; trust mechanism; dynamic slicing; data aggregation
Subject
Engineering, Other
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment