Please use this identifier to cite or link to this item:
https://idr.l1.nitk.ac.in/jspui/handle/123456789/8384Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | A, R. | - |
| dc.contributor.author | Shet, K.C. | - |
| dc.date.accessioned | 2020-03-30T10:18:33Z | - |
| dc.date.available | 2020-03-30T10:18:33Z | - |
| dc.date.issued | 2008 | - |
| dc.identifier.citation | Proceedings of the 2008 16th International Conference on Advanced Computing and Communications, ADCOM 2008, 2008, Vol., , pp.52-57 | en_US |
| dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/8384 | - |
| 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. | en_US |
| dc.title | Key management using k-dimensional trees | en_US |
| dc.type | Book chapter | en_US |
| Appears in Collections: | 2. Conference Papers | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.