Enhancement of Security for Intragroup and Intergroup Wireless Sensor Network
Ching‐Nung Yang, Jhou-Cian You, Po-Cheng Yu · 2025
The most common approach to implementing largescale wireless sensor network (WSN) is to use multiple-sink WSN (MWSN), which can support a large number of sensor nodes. In MWSN, there are different clusters (groups). In order to ensure that the collected data is sent securely to the backend database, intragroup and intergroup key predistribution ($\mathrm{I}^{2} \text{KP}$) has recently been proposed to establish secure communication in MWSN. Previous$\mathbf{I}^{\mathbf{2}} \mathbf{K P}$was resistant to two types of attack: node capture attack (NA) and location-based NA (LNA). NA is an attack in which an attacker captures and compromises nodes to collect keys to eavesdrop on communications between other uncompromised nodes. The LNA attack is that the attacker knows the geometric location of the sensor node and can deliberately capture the nodes in intersecting groups in the MWSN to aggravate attack. However, if an attacker has the ability to intercept more sensitive information (such as identifiers) from the broadcast information of sensor nodes, he can compromise nodes with smaller IDs using advanced NA (ANA). Therefore, there is a higher chance of obtaining the keys through this type of ANA attack. In this paper, we propose$\mathbf{I}^{\mathbf{2}} \mathbf{K P}$using bidirectional hash chain ($\mathbf{I}^{\mathbf{2}} \mathbf{K P B H}$) to solve ANA problem. Theoretical analysis and numerical simulations prove that our$\mathbf{I}^{\mathbf{2}} \mathbf{K P B H}$is indeed effective.