Skip to main content

A Cluster-Based Group Rekeying Algorithm in Mobile Ad Hoc Networks

  • Conference paper
Networking and Mobile Computing (ICCNMC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3619))

Included in the following conference series:

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.

This work is supported in part by National 973 Program(Grant No. 2003CB314802) and National 863 Program(Grant No. 2003AA142080).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Haas, Z.J., Deng, J., Liang, B.: Wireless Ad Hoc Networks. In: Proakis, J. (ed.) Encyclopedia of Telecommunications. John Wiley, Chichester (2002)

    Google Scholar 

  2. Kuang, X., Hu, H., Lu, X.: A New Group Key Management Framework for Mobile Ad-Hoc Networks. Journal of Computer Research and Development China 41(4), 704–710 (2004)

    Google Scholar 

  3. Chatterjee, M., Das, S.K., Turgut, D.: WCA: A Weighted Clustering Algorithm for Mobile Ad hoc Networks. Journal of Clustering Computing IEEE 5(2), 193–204 (2002)

    Article  Google Scholar 

  4. Harney, H., Muckenhirm, C.: Group key management protocol (GKMP) architecture. RFC 2093 IETF (July 1997)

    Google Scholar 

  5. Amir, Y., Ateniese, G., Hasse, D., Kim, Y., Nita-Rotaru, C., Schlossnagle, T., Schultz, J., Stanton, J., Tsudik, G.: Secure Group Communication in Asynchronous Networks with Failures: Integration and Experiments. In: IEEE ICDCS 2000, pp. 330–343 (2000)

    Google Scholar 

  6. Kim, Y., Perrig, A., Tsudik, G.: Simple and fault-tolerant key agreement for dynamic collaborative groups. In: Proceedings of 7th ACM Conference on Computer and Communications Security, November 2000, pp. 235–244. ACM Press, New York (2000)

    Chapter  Google Scholar 

  7. Griffin, S., De Cleene, B., Dondeti, L., Flynn, R., Ki-wior, D., Olbert, A.: Hierarchical Key Management for Mobile Multicast Members. Submitted to NDSS 2002 (2002)

    Google Scholar 

  8. Zhang, C., DeCleene, B., Kurose, J., Towsley, D.: Comparison of Inter-Area Rekeying Algorithms for Secure Wireless Group Communications. Submitted to ACM Symmetric (2002)

    Google Scholar 

  9. Carman: Constraints and Approaches for Distributed Sensor Network Security. September 1, 2000, NAI Labs Technical Report #00-010 (2000)

    Google Scholar 

  10. Basagni, S., Herrin, K., Bruschi, D., Rosti, E.: Secure pebblenets. In: Proceedings of the 2001 ACM Int. Symp. on Mobile Ad Hoc Networking and Computing, October 2001, pp. 156–163. ACM Press, New York (2001)

    Chapter  Google Scholar 

  11. Pickholtz, R.L., Schilling, D.L., Miltein, L.B.: Theory of Spread Spectrum Communication – A Tutorial. IEEE Transactions on Communications 30(5), 855–884 (1982)

    Article  Google Scholar 

  12. Kong, J., Zerfos, P., Luo, H., Lu, S., Zhang, L.: Providing robust and ubiquitous security support for mobile ad-hoc networks. In: Ninth International Conference on Network Protocols (ICNP 2001), pp. 251–260 (2001)

    Google Scholar 

  13. Guangming, H., Zunguo, H., Huaping, H., ZhengHu, G.: SLID: A Secure Lowest- ID Clustering Algorithm. Wuhan University Journal of Natural Sciences 10(1) (2005)

    Google Scholar 

  14. Wireless and Mobility Extensions to ns-2, http://www.monarch.cs.cmu.edu/

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hu, G., Kuang, X., Gong, Z. (2005). A Cluster-Based Group Rekeying Algorithm in Mobile Ad Hoc Networks. In: Lu, X., Zhao, W. (eds) Networking and Mobile Computing. ICCNMC 2005. Lecture Notes in Computer Science, vol 3619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11534310_38

Download citation

  • DOI: https://doi.org/10.1007/11534310_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28102-3

  • Online ISBN: 978-3-540-31868-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics