Key management using k-dimensional trees
| dc.contributor.author | Renuka, R. | |
| dc.contributor.author | Shet, K.C. | |
| dc.date.accessioned | 2026-02-06T06:40:56Z | |
| dc.date.issued | 2008 | |
| dc.description.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. | |
| dc.identifier.citation | Proceedings of the 2008 16th International Conference on Advanced Computing and Communications, ADCOM 2008, 2008, Vol., , p. 52-57 | |
| dc.identifier.uri | https://doi.org/10.1109/ADCOM.2008.4760427 | |
| dc.identifier.uri | https://idr.nitk.ac.in/handle/123456789/33260 | |
| dc.title | Key management using k-dimensional trees |