Flexible Deployment Models for Location-Aware Key Management in Wireless Sensor Networks

Yu, Bo; Cao, Xiaomei; Han, Peng; Mao, Dilin; Gao, Chuanshan

doi:10.1007/11610113_31

Cited by 1 publication

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…All the nodes in one group are distributed the key materials in the same way and are expected to be deployed in the corresponding cell of the group. According to the analysis of Bo Yu etc [13], most of the nodes in one group only communicate with its neighbors in the same group, especially when the cell's width or radius is relatively greater than the signal range of a node. So the nodes in the same group have the high probability of neighboring, and the two neighboring nodes have the high probability of establishing pair-wise key too.…”

Section: B Group-based Key Pre-distribution Schemementioning

confidence: 99%

A Hexagon-based Key Pre-distribution Scheme for Large Scale Static Wireless Sensor Networks

Yao¹,

Zheng²,

Wu³

2008

JCM

View full text Add to dashboard Cite

In order to improve the secure connectivity & expansibility of static wireless sensor networks, decrease the memory costs of sensor nodes, an efficient hexagon-based key pre-distribution scheme is put forward by employing the ideas of the grouping key management and secret binding. In this scheme, the process of establishing pair-wise keys for neighboring nodes in the network is limited in the beginning of the network deployment, and when adding new sensor nodes into the network, the process of establishing pair-wise keys for the new nodes and their neighbors needs to be verified by the base-station. For the neighboring nodes in the same group, the polynomial-based key predistribution scheme is used to generate pair-wise keys for them. And for the neighboring nodes in different groups, the binding secrets generated by a HMAC are used to establish the pair-wise key. In addition, by analyzing the relations among the radius of the cell, the probability of the secure connection, memory costs and other parameters, the most appropriate value of the cell’s radius is found, which can optimize the hexagon-based key pre-distribution schemes in the aspects of secure connectivity and memory costs.

show abstract

Section: B Group-based Key Pre-distribution Schemementioning

confidence: 99%