DocumentCode
2461420
Title
Key Management Using K-Dimensional Trees
Author
Renuka, A. ; Shet, K.C.
Author_Institution
Dept. of Comput. Sci. & Eng., MIT, Manipal
fYear
2008
fDate
14-17 Dec. 2008
Firstpage
52
Lastpage
57
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 2D tree for a 2D space. The 2D 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.
Keywords
ad hoc networks; cryptographic protocols; mobile communication; tree data structures; trees (mathematics); 2D tree; K-dimensional trees; binary tree; group key management; memory requirement; mobile ad hoc network; protocol; space partitioning data structure; Ad hoc networks; Computer network management; Computer networks; Computer science; Costs; Cryptography; Mobile ad hoc networks; Power system management; Protocols; Tree data structures;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Computing and Communications, 2008. ADCOM 2008. 16th International Conference on
Conference_Location
Chennai
Print_ISBN
978-1-4244-2962-2
Electronic_ISBN
978-1-4244-2963-9
Type
conf
DOI
10.1109/ADCOM.2008.4760427
Filename
4760427
Link To Document