TY - GEN
T1 - Group-based key pre-distribution in wireless sensor networks
AU - Liu, Donggang
AU - Ning, Peng
AU - Du, Wenliang
N1 - Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2005
Y1 - 2005
N2 - Many key pre-distribution techniques have been developed recently to establish pairwise keys for wireless sensor networks. To further improve these schemes, researchers have proposed to take advantage of sensors' expected locations to help pre-distributing keying materials. However, it is usually very difficult, and sometimes impossible, to guarantee the knowledge of sensors' expected locations. In order to remove the dependency on expected locations, this paper proposes a practical deployment model, where sensor nodes are deployed in groups, and the nodes in the same group are close to each other after the deployment. Based on this model, the paper develops a novel group-based key pre-distribution framework, which can be combined with any of existing key predistribution techniques. A distinguishing property of this framework is that it does not require the knowledge of sensors' expected locations and greatly simplifies the deployment of sensor networks. The analysis also shows that the framework can substantially improve the security as well as the performance of existing key predistribution techniques.
AB - Many key pre-distribution techniques have been developed recently to establish pairwise keys for wireless sensor networks. To further improve these schemes, researchers have proposed to take advantage of sensors' expected locations to help pre-distributing keying materials. However, it is usually very difficult, and sometimes impossible, to guarantee the knowledge of sensors' expected locations. In order to remove the dependency on expected locations, this paper proposes a practical deployment model, where sensor nodes are deployed in groups, and the nodes in the same group are close to each other after the deployment. Based on this model, the paper develops a novel group-based key pre-distribution framework, which can be combined with any of existing key predistribution techniques. A distinguishing property of this framework is that it does not require the knowledge of sensors' expected locations and greatly simplifies the deployment of sensor networks. The analysis also shows that the framework can substantially improve the security as well as the performance of existing key predistribution techniques.
KW - Key Management
KW - Key Predistribution
KW - Pairwise Key
KW - Sensor Networks
UR - http://www.scopus.com/inward/record.url?scp=33749033368&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33749033368&partnerID=8YFLogxK
U2 - 10.1145/1080793.1080798
DO - 10.1145/1080793.1080798
M3 - Conference contribution
AN - SCOPUS:33749033368
SN - 1595931481
SN - 9781595931481
T3 - WiSe - Proceedings of the 2005 ACM Workshop on Wireless Security
SP - 11
EP - 20
BT - WiSe - Proceedings of the 2005 ACM Workshop on Wireless Security
PB - Association for Computing Machinery
T2 - WiSe - 2005 ACM Workshop on Wireless Security
Y2 - 2 September 2005 through 2 September 2005
ER -