Renuka, A and Shet, K C (2008) Key Management Using K-Dimensional Trees. In: International Conference on ADCOM 2008, 14-17 Dec. 2008 , Chennai.

PDF arn3.pdf - Published Version Restricted to Registered users only Download (116kB) | Request a copy

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.

Item Type:	Conference or Workshop Item (Paper)
Subjects:	Engineering > MIT Manipal > Computer Science and Engineering
Depositing User:	MIT Library
Date Deposited:	14 Jun 2011 10:35
Last Modified:	14 Jun 2011 10:35
URI:	http://eprints.manipal.edu/id/eprint/254

Actions (login required)

View Item