The sibling nodes of a member in a logical tree of KEKs are the direct underlying nodes from every node in its path to the root that are not actually in this path. The set of sibling nodes is denoted as the sibling path. Thus, the sibling trees of a member are the trees hanging from the nodes of its sibling path.
Published in Chapter:
Distributed Group Security for Wireless Sensor Networks
Juan Hernández-Serrano (Universitat Politècnica de Catalunya, Spain), Juan Vera-del-Campo (Universitat Politècnica de Catalunya, Spain), Josep Pegueroles (Universitat Politècnica de Catalunya, Spain), and Miguel Soriano (Technical University of Catalonia, Spain)
Copyright: © 2010
|Pages: 24
DOI: 10.4018/978-1-61520-701-5.ch014
Abstract
Wireless sensor networks (WSNs) are made up of large groups of sensor nodes that usually perform distributed monitoring services. These services are often cooperative and interchange sensitive data, so communications within the group of sensor nodes must be secured. Group key management (GKM) protocols appeared, and were broadly studied, in order to ensure the privacy and authentication throughout the group life. However, GKM for WSNs is already challenging due to the exposed nature of wireless media, the constrained resources of sensor nodes, and the need of ad-hoc self-organization in many scenarios. In this chapter we present the basis of GKM and its state-of-the art for WSNs. We analyze the current non-resolved topics and we present a GKM proposal that solves some of these topics: it minimizes both the rekeying costs when the group membership changes and the routing cost within the group.