A cluster-based group rekeying algorithm in mobile ad hoc networks

Authors:
Guangming Hu;Xiaohui Kuang;Zhenghu Gong
Affiliations:
School of Computer Science, National University of Defense Technology, Changsha, Hunan, China;Beijing Institute of System Engineer, Beijing, China;School of Computer Science, National University of Defense Technology, Changsha, Hunan, China
Venue:
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Year:
2005

Citing 5
Cited 1

Simple and fault-tolerant key agreement for dynamic collaborative groups

Proceedings of the 7th ACM conference on Computer and communications security
Secure pebblenets

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks

Cluster Computing
Secure Group Communication in Asynchronous Networks with Failures: Integration and Experiments

ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Providing Robust and Ubiquitous Security Support for Mobile Ad Hoc Networks

ICNP '01 Proceedings of the Ninth International Conference on Network Protocols

A Secure Group Rekeying Scheme with Compromised Node Revocation in Wireless Sensor Networks

ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many emerging mobile wireless applications depend upon secure group communication, in which secure and efficient group rekeying algorithm is very important. In this paper, a novel rekeying algorithm is proposed, which is based on the Distributed Group Key Management Framework and secure clustering. This algorithm involves two phases: (a) Virtual Backbone Management phase: a dynamic virtual backbone is formed below the routing layer such that each node in the network is either a part of the backbone or one hop away from at least one of the backbone nodes. (b) Group Rekeying phase: backbone nodes form group rekeying forest, in which each group rekeying tree can generate a new and same group-key. Because this algorithm generates group key with local secrete information, it is very fit for mobile ad hoc networks. Simulation shows that the algorithm performs better than many existing group key management protocols in terms of the success ratio and average delay of group rekeying.