Enhancement of Security for Intragroup and Intergroup Wireless Sensor Network

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 (<tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{I}^{2} \text{KP}$</tex>) has recently been proposed to establish secure communication in MWSN. Previous <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{I}^{\mathbf{2}} \mathbf{K P}$</tex> 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 <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{I}^{\mathbf{2}} \mathbf{K P}$</tex> using bidirectional hash chain (<tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{I}^{\mathbf{2}} \mathbf{K P B H}$</tex>) to solve ANA problem. Theoretical analysis and numerical simulations prove that our <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{I}^{\mathbf{2}} \mathbf{K P B H}$</tex> is indeed effective.

Authors

Institutions

Publication Details

Published
2025-04-18
DOI
https://doi.org/10.1109/icccs65393.2025.11069573
Citations
1
Primary Topic
Security in Wireless Sensor Networks
Type
article
Field-Weighted Citation Impact
1.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enhancement of Security for Intragroup and Intergroup Wireless Sensor Network

Ching‐Nung Yang, Philip S. Yu, Jane You
1 citations
Security in Wireless Sensor Networks
1.49
article

Enhancement of Security for Intragroup and Intergroup Wireless Sensor Network

Ching‐Nung Yang, Philip S. Yu, Jane You
article en
1 citations

Abstract

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 (<tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{I}^{2} \text{KP}$</tex>) has recently been proposed to establish secure communication in MWSN. Previous <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{I}^{\mathbf{2}} \mathbf{K P}$</tex> 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 <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{I}^{\mathbf{2}} \mathbf{K P}$</tex> using bidirectional hash chain (<tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{I}^{\mathbf{2}} \mathbf{K P B H}$</tex>) to solve ANA problem. Theoretical analysis and numerical simulations prove that our <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathbf{I}^{\mathbf{2}} \mathbf{K P B H}$</tex> is indeed effective.

National Dong Hwa University (TW)
Openalex Percentile: Top 15%
Security in Wireless Sensor Networks
1.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.