Key management using k-dimensional trees

Renuka A, K. C. Shet

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationProceedings of the 2008 16th International Conference on Advanced Computing and Communications, ADCOM 2008
Pages52-57
Number of pages6
DOIs
Publication statusPublished - 01-12-2008
Event2008 16th International Conference on Advanced Computing and Communications, ADCOM 2008 - Chennai, India
Duration: 14-12-200817-12-2008

Conference

Conference2008 16th International Conference on Advanced Computing and Communications, ADCOM 2008
CountryIndia
CityChennai
Period14-12-0817-12-08

Fingerprint

Binary trees
Mobile ad hoc networks
Data structures
Data storage equipment
management
Group

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Communication

Cite this

A, R., & Shet, K. C. (2008). Key management using k-dimensional trees. In Proceedings of the 2008 16th International Conference on Advanced Computing and Communications, ADCOM 2008 (pp. 52-57). [4760427] https://doi.org/10.1109/ADCOM.2008.4760427
A, Renuka ; Shet, K. C. / Key management using k-dimensional trees. Proceedings of the 2008 16th International Conference on Advanced Computing and Communications, ADCOM 2008. 2008. pp. 52-57
@inproceedings{9ca4633d55bd4df091ae92a43b81cafc,
title = "Key management using k-dimensional trees",
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.",
author = "Renuka A and Shet, {K. C.}",
year = "2008",
month = "12",
day = "1",
doi = "10.1109/ADCOM.2008.4760427",
language = "English",
isbn = "9781424429639",
pages = "52--57",
booktitle = "Proceedings of the 2008 16th International Conference on Advanced Computing and Communications, ADCOM 2008",

}

A, R & Shet, KC 2008, Key management using k-dimensional trees. in Proceedings of the 2008 16th International Conference on Advanced Computing and Communications, ADCOM 2008., 4760427, pp. 52-57, 2008 16th International Conference on Advanced Computing and Communications, ADCOM 2008, Chennai, India, 14-12-08. https://doi.org/10.1109/ADCOM.2008.4760427

Key management using k-dimensional trees. / A, Renuka; Shet, K. C.

Proceedings of the 2008 16th International Conference on Advanced Computing and Communications, ADCOM 2008. 2008. p. 52-57 4760427.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Key management using k-dimensional trees

AU - A, Renuka

AU - Shet, K. C.

PY - 2008/12/1

Y1 - 2008/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=63449115820&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=63449115820&partnerID=8YFLogxK

U2 - 10.1109/ADCOM.2008.4760427

DO - 10.1109/ADCOM.2008.4760427

M3 - Conference contribution

SN - 9781424429639

SP - 52

EP - 57

BT - Proceedings of the 2008 16th International Conference on Advanced Computing and Communications, ADCOM 2008

ER -

A R, Shet KC. Key management using k-dimensional trees. In Proceedings of the 2008 16th International Conference on Advanced Computing and Communications, ADCOM 2008. 2008. p. 52-57. 4760427 https://doi.org/10.1109/ADCOM.2008.4760427