Please use this identifier to cite or link to this item:
|Title:||Key management using k-dimensional trees|
|Citation:||Proceedings of the 2008 16th International Conference on Advanced Computing and Communications, ADCOM 2008, 2008, Vol., , pp.52-57|
|Abstract:||In 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.|
|Appears in Collections:||2. Conference Papers|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.