Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorA, R.-
dc.contributor.authorShet, K.C.-
dc.identifier.citationProceedings of the 2008 16th International Conference on Advanced Computing and Communications, ADCOM 2008, 2008, Vol., , pp.52-57en_US
dc.description.abstractIn this paper we present a protocol for group key management in mobile ad hoc networks based on K-dimensional trees, a space partitioning data structure. We use a 2- dimensional tree for a 2 dimensional space. The 2 dimensional tree resembles a binary tree. The protocol reduces the memory requirements for storing the tree by nearly 50% compared to the existing methods and also reduces the number of key changes required whenever membership changes occur. � 2008 IEEE.en_US
dc.titleKey management using k-dimensional treesen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
File Description SizeFormat 
8384.pdf115.3 kBAdobe PDFThumbnail

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.