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.
Original language | English |
---|---|
Title of host publication | Proceedings of the 2008 16th International Conference on Advanced Computing and Communications, ADCOM 2008 |
Pages | 52-57 |
Number of pages | 6 |
DOIs | |
Publication status | Published - 01-12-2008 |
Event | 2008 16th International Conference on Advanced Computing and Communications, ADCOM 2008 - Chennai, India Duration: 14-12-2008 → 17-12-2008 |
Conference
Conference | 2008 16th International Conference on Advanced Computing and Communications, ADCOM 2008 |
---|---|
Country/Territory | India |
City | Chennai |
Period | 14-12-08 → 17-12-08 |
All Science Journal Classification (ASJC) codes
- Computational Theory and Mathematics
- Computer Networks and Communications
- Communication