苏州科技学院学报（自然科学版）
囌州科技學院學報（自然科學版）
소주과기학원학보（자연과학판）
JOURNAL OF UNIVERSITY OF SCIENCE AND TECHNOLOGY OF SUZHOU(NATURAL SCIENCE EDITION)
2014年
3期
36-42
,共7页
无线传感器网络%组密钥管理%协作%自愈%安全性
無線傳感器網絡%組密鑰管理%協作%自愈%安全性
무선전감기망락%조밀약관리%협작%자유%안전성
wireless sensor network%group key management%collaboration%self-healing%security
当节点资源受限且处于敌对环境中时，无线传感器网络极易受到攻击且易被俘获。对基于簇协作的密钥管理方案进行了改进，提出一种适用于大规模无线传感器网络的分布式组密钥管理方案。利用距离最近的邻居头节点间的相互协作来实时更新组密钥，降低敌手利用妥协节点对网络进行的攻击的几率。当妥协节点个数低于门限值时，由本组头节点发起组密钥更新；当妥协节点个数高于门限值时，由邻居组头节点协作告知基站和其他邻居头节点：该组已妥协，切断与其通信，要求重新布置该组节点；当妥协节点为头节点时，由最近的邻居头节点协作其他邻居节点在该组内选取新的头节点。网络中为每个组分配不同的多项式，与整个网络使用同一个多项式相比，抗共谋攻击能力增强；网络中增加了自愈机制，通过设置相关参数，可以改变网络的自愈性。实验结果表明：每组成员节点的数量增加到一定值时，头节点的通信开销趋于平稳。因此，该方案适用于具有多个不同自愈性需求等级的大规模网络。
噹節點資源受限且處于敵對環境中時，無線傳感器網絡極易受到攻擊且易被俘穫。對基于簇協作的密鑰管理方案進行瞭改進，提齣一種適用于大規模無線傳感器網絡的分佈式組密鑰管理方案。利用距離最近的鄰居頭節點間的相互協作來實時更新組密鑰，降低敵手利用妥協節點對網絡進行的攻擊的幾率。噹妥協節點箇數低于門限值時，由本組頭節點髮起組密鑰更新；噹妥協節點箇數高于門限值時，由鄰居組頭節點協作告知基站和其他鄰居頭節點：該組已妥協，切斷與其通信，要求重新佈置該組節點；噹妥協節點為頭節點時，由最近的鄰居頭節點協作其他鄰居節點在該組內選取新的頭節點。網絡中為每箇組分配不同的多項式，與整箇網絡使用同一箇多項式相比，抗共謀攻擊能力增彊；網絡中增加瞭自愈機製，通過設置相關參數，可以改變網絡的自愈性。實驗結果錶明：每組成員節點的數量增加到一定值時，頭節點的通信開銷趨于平穩。因此，該方案適用于具有多箇不同自愈性需求等級的大規模網絡。
당절점자원수한차처우활대배경중시，무선전감기망락겁역수도공격차역피부획。대기우족협작적밀약관리방안진행료개진，제출일충괄용우대규모무선전감기망락적분포식조밀약관리방안。이용거리최근적린거두절점간적상호협작래실시경신조밀약，강저활수이용타협절점대망락진행적공격적궤솔。당타협절점개수저우문한치시，유본조두절점발기조밀약경신；당타협절점개수고우문한치시，유린거조두절점협작고지기참화기타린거두절점：해조이타협，절단여기통신，요구중신포치해조절점；당타협절점위두절점시，유최근적린거두절점협작기타린거절점재해조내선취신적두절점。망락중위매개조분배불동적다항식，여정개망락사용동일개다항식상비，항공모공격능력증강；망락중증가료자유궤제，통과설치상관삼수，가이개변망락적자유성。실험결과표명：매조성원절점적수량증가도일정치시，두절점적통신개소추우평은。인차，해방안괄용우구유다개불동자유성수구등급적대규모망락。
When the node resources are limited and placed in a hostile environment, wireless sensor networks are highly vulnerable to attacks and easily captured. Based on the cluster collaboration scheme, we put a group key management scheme for large-scale distributed wireless sensor networks. Mutual collaboration between the neighboring head nodes of the nearest group could update the group key in real time to reduce the attacks from the compromised nodes. The head node updates its group key when the number of compromised nodes in its own is below a threshold, and the neighboring head instead of the group head updates it when above a threshold. The neighboring heads will inform the base station and entire network in the latter situation that the group has failed, cut their communication with it, and redeployed it. When the head node compromises, its nearest head nodes will collaborate with other neighboring heads to select a new node in the group as their head. Compared with that the whole network has one common polynomial, that every group has a distinct polynomial greatly decreases the at-tacks of collusion. The network has increased its self-healing property by setting related parameters. The experi-mental results show that the communication overhead of the head node comes to a certain value with the increase of the member in each group. Therefore, this scheme is suitable for large-scale networks having multiple different levels of self-healing demands.
