Location-Based Key Management Structure for Secure Group Communication in Wireless Sensor Networks

Jin Myoung KIM  Tae Ho CHO  

IEICE TRANSACTIONS on Communications   Vol.E96-B   No.9   pp.2183-2189
Publication Date: 2013/09/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E96.B.2183
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Fundamental Theories for Communications
wireless sensor networks,  key management,  genetic algorithm,  group communications,  graph partitioning,  

Full Text: PDF(2.9MB)>>
Buy this Article

 | Errata[Uploaded on January 1,2014]

Many applications of wireless sensor networks (WSNs) require secure communication. The tree-based key management scheme, which is a symmetric key scheme, provides backward and forward secrecy. The sensor nodes in the communication group share a secret key for encrypting messages. When the sensor nodes are added to or evicted from the group, the group key has to be updated by sending rekeying messages. In this paper, we propose a method of key tree structure (KTS) generation by considering the addition and eviction ratio of sensor nodes to reduce the number of rekeying messages, which is influenced by the structure of the tree. For this, we define an extension of an existing tree structure such as a binary or ternary tree and generate KTS using an A* algorithm. To reduce the energy consumed by the message transmission, we also exploit genetic algorithm (GA) to build a secure communication group by considering the KTS. In the paper, we show the effectiveness of the proposed method compared with the existing structure via the simulation in terms of memory usage, the number of rekeying messages and energy consumption.