A Hierarchical Matrix Decomposition‐Based Signcryption without Key‐Recovery in Large‐Scale WSN

Abstract

The sensors in wireless sensor network (WSN) are vulnerable to malicious attacks due to the transmission nature of wireless media. Secure and authenticated message delivery with low energy consumption is one of the major aims in WSN. The identity-based key authentication scheme is more suitable for the WSN. In this paper, the Hierarchical Matrix Decomposition-based Signcryption (HMDS) algorithm was proposed, which is a kind of identity-based authentication scheme. In HMDS scheme, three-layer architecture, base station (BS), cluster head, and intracluster, is employed to adapt to the common structure of WSN. As the key generation center (KGC), the BS adopts matrix decomposition to generate the identification information and public key for cluster head, which not only reduces the cost of calculation and storage but also avoids the collusion attack. Experiments show that the HMDS algorithm has more advantages over other algorithms and is very suitable for the large-scale WSN.

Three-Dimensional DV-Hop Localization Algorithm Based on Hop Size Correction and Improved Sparrow Search

“…Wireless sensor networks (WSNs) is a multihop counts wireless network that incorporates nodes to sense, collect, and process target node information, enabling access to objective physical information, extending information acquisition capabilities, and providing the most direct and accurate information in next-generation wireless networks [1]. In next-generation technology, Non-orthogonal Multiple Access (NOMA) allocates different power to known nodes (a node whose own position is known) and target nodes which have different residual energy in WSNs, saving the known node energy consumption problem by using the Successive Interference Cancellation (SIC) technique.…”