The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Dans les réseaux de capteurs modernes, la gestion des clés est essentielle pour transmettre en toute sécurité les données des capteurs au récepteur. Autrement dit, les capteurs sont susceptibles d'être compromis par des attaquants, et un système de gestion des clés doit renouveler les clés de communication aussi fréquemment que possible. Dans les réseaux de capteurs en cluster, les CH (Cluster Heads) ont tendance à devenir la cible d'attaques de compromission, car ils collectent les données des capteurs et transmettent les données agrégées au récepteur. Cependant, les programmes de renouvellement de clés existants ne modifient pas les nœuds de rôle des CH et sont donc vulnérables à la compromission des CH. Notre schéma est appelé DIRECT (DynamIc key REnewal using Cluster head elecTion) car il matérialise les renouvellements dynamiques de clés à travers des élections CH sécurisées. Dans ce schéma, le réseau est divisé en secteurs pour séparer les élections CH dans chaque secteur des autres secteurs. Ensuite, les capteurs établissent des clés par paires avec d'autres capteurs de leur secteur pour la communication intra-sectorielle. À chaque tour d'élection du CH, tous les capteurs élisent en toute sécurité un CH dans leur secteur en vainquant les actions malveillantes des attaquants. Par conséquent, la probabilité qu’un nœud compromis soit élu comme CH diminue considérablement. Les résultats de la simulation montrent que notre approche améliore considérablement l'intégrité des données, l'efficacité énergétique et la longévité du réseau.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Gicheol WANG, Kang-Suk SONG, Gihwan CHO, "DIRECT: Dynamic Key Renewal Using Secure Cluster Head Election in Wireless Sensor Networks" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 6, pp. 1560-1571, June 2010, doi: 10.1587/transinf.E93.D.1560.
Abstract: In modern sensor networks, key management is essential to transmit data from sensors to the sink securely. That is, sensors are likely to be compromised by attackers, and a key management scheme should renew the keys for communication as frequently as possible. In clustered sensor networks, CHs (Cluster Heads) tend to become targets of compromise attack because they collect data from sensors and deliver the aggregated data to the sink. However, existing key renewal schemes do not change the CH role nodes, and thus they are vulnerable to the compromise of CHs. Our scheme is called DIRECT (DynamIc key REnewal using Cluster head elecTion) because it materializes the dynamic key renewals through secure CH elections. In the scheme, the network is divided into sectors to separate CH elections in each sector from other sectors. Then, sensors establish pairwise keys with other sensors in their sector for intra-sector communication. Every CH election round, all sensors securely elect a CH in their sector by defeating the malicious actions of attackers. Therefore, the probability that a compromised node is elected as a CH decreases significantly. The simulation results show that our approach significantly improves the integrity of data, energy efficiency, and network longevity.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.1560/_p
Copier
@ARTICLE{e93-d_6_1560,
author={Gicheol WANG, Kang-Suk SONG, Gihwan CHO, },
journal={IEICE TRANSACTIONS on Information},
title={DIRECT: Dynamic Key Renewal Using Secure Cluster Head Election in Wireless Sensor Networks},
year={2010},
volume={E93-D},
number={6},
pages={1560-1571},
abstract={In modern sensor networks, key management is essential to transmit data from sensors to the sink securely. That is, sensors are likely to be compromised by attackers, and a key management scheme should renew the keys for communication as frequently as possible. In clustered sensor networks, CHs (Cluster Heads) tend to become targets of compromise attack because they collect data from sensors and deliver the aggregated data to the sink. However, existing key renewal schemes do not change the CH role nodes, and thus they are vulnerable to the compromise of CHs. Our scheme is called DIRECT (DynamIc key REnewal using Cluster head elecTion) because it materializes the dynamic key renewals through secure CH elections. In the scheme, the network is divided into sectors to separate CH elections in each sector from other sectors. Then, sensors establish pairwise keys with other sensors in their sector for intra-sector communication. Every CH election round, all sensors securely elect a CH in their sector by defeating the malicious actions of attackers. Therefore, the probability that a compromised node is elected as a CH decreases significantly. The simulation results show that our approach significantly improves the integrity of data, energy efficiency, and network longevity.},
keywords={},
doi={10.1587/transinf.E93.D.1560},
ISSN={1745-1361},
month={June},}
Copier
TY - JOUR
TI - DIRECT: Dynamic Key Renewal Using Secure Cluster Head Election in Wireless Sensor Networks
T2 - IEICE TRANSACTIONS on Information
SP - 1560
EP - 1571
AU - Gicheol WANG
AU - Kang-Suk SONG
AU - Gihwan CHO
PY - 2010
DO - 10.1587/transinf.E93.D.1560
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E93-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 2010
AB - In modern sensor networks, key management is essential to transmit data from sensors to the sink securely. That is, sensors are likely to be compromised by attackers, and a key management scheme should renew the keys for communication as frequently as possible. In clustered sensor networks, CHs (Cluster Heads) tend to become targets of compromise attack because they collect data from sensors and deliver the aggregated data to the sink. However, existing key renewal schemes do not change the CH role nodes, and thus they are vulnerable to the compromise of CHs. Our scheme is called DIRECT (DynamIc key REnewal using Cluster head elecTion) because it materializes the dynamic key renewals through secure CH elections. In the scheme, the network is divided into sectors to separate CH elections in each sector from other sectors. Then, sensors establish pairwise keys with other sensors in their sector for intra-sector communication. Every CH election round, all sensors securely elect a CH in their sector by defeating the malicious actions of attackers. Therefore, the probability that a compromised node is elected as a CH decreases significantly. The simulation results show that our approach significantly improves the integrity of data, energy efficiency, and network longevity.
ER -