An Efficient Group Key Management Using Clustering Algorithm for Mobile Ad Hoc Networks

  • Mansouri AliEmail author
  • Bouhlel Mohamed Salim
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 797)


The field of self-stability is a very interesting area in ad hoc networks. Indeed, the auto-stability allows a good operation and the stability of the network even with a mobile topology. We are interested on the conception a management algorithm of keys in MANETs. We propose a new topology which makes possible to divide the network in a groups based on trust between members of a group. Key management is a basic part of any secure communication. We show our management algorithm of keys as a series of steps. Group key management ensures confidential communications within a group. It is a matter of establishing a secret shared between the members of the group.


Self-stabilizing Management of keys Cluster Mobile ad hoc Algorithm Cluster-head 


  1. 1.
    Brunet S, Paine S (2001) Security’s official guide to cryptography. RSA Press, San FranciscoGoogle Scholar
  2. 2.
    Kim Y, Gene T (2000) Simple and fault tolerant key agreement for dynamic collaborative groups. In: Proceedings of the 7th ACM conference on computer and communications security: CCS 2000, pp 235–244, Athens, Greece, Nov 1–4 (2000)Google Scholar
  3. 3.
    Sherman A, McGrew D (2003) Key establishment in large dynamic groups using one-way function trees. IEEE Trans Softw Eng 29(5):444–458CrossRefGoogle Scholar
  4. 4.
    Bouassida M (2008) A group key management in MANETs. Int J Netw Secur 6(1):67–79, Jan (2008)Google Scholar
  5. 5.
    Mansouri A, Bouhlel S (2015) Self-stabilizing clustering algorithm in mobile ad hoc networks. In: SAI intelligent systems conference, pp 978–983. IEEE publisher, London, Nov 10–11, 2015Google Scholar
  6. 6.
    Mansouri A, Bouhlel S (2017) A new clustering protocol for mobile ad hoc networks: simulation and evaluation. Int J Comput Sci Inf Secur (IJCSIS) 15(5):259–266, May (2017)Google Scholar
  7. 7.
    Bicakci K, Tsudik G (2004) Tree-based group key agreement. ACM Trans Inf Syst Secur 7(1):60–96, Feb (2004)Google Scholar
  8. 8.
    Mittra S (1997) A framework for scalable secure multicasting. ACM SIGCOMM Comput Commun Rev 27(4):277–288, Oct (1997)Google Scholar
  9. 9.
    Augot D, Raghav B (2007) A three round authenticated group key agreement protocol for ad hoc networks. Pervasive Mobile Comput 3(1):36–52, Jan (2007)Google Scholar
  10. 10.
    Diffue W, Martine H (1976) New directions in cryptography. IEEE Trans Inf Theory 22(6):644–654MathSciNetCrossRefGoogle Scholar
  11. 11.
    Mansouri A, Bouhlel S (2016) An efficient self-stabilizing vertex coloring algorithm. SAI Computing Conference (SAI) 2016, pp 655–660. IEEE, 13–15 July (2016)Google Scholar
  12. 12.
    Keven F, Kannan V (2003) The ns manual (formerly ns Notes and Documentation, The VINT Project (2003), available at
  13. 13.
    Wu B, Don Y (2009) An efficient group key management scheme for mobile ad hoc networks. Int J Secur Netw 4(1/2):125–134CrossRefGoogle Scholar
  14. 14.
    Min P, Young P (2013) Key management for multiple multicast groups in wireless networks. IEEE Trans Mobile Comput 12(9):1712–1723, Sept (2013)Google Scholar
  15. 15.
    Christian B, Hannes H (2004) Stochastic properties of the random waypoint mobility model. ACM/Kluwer Wireless Netw 10(5):555–567, Sept (2004)Google Scholar
  16. 16.
    Unai A, Diego L (2012) A Parameter-based service discovery protocol for mobile ad-hoc networks. In: Proceedings of the 11th international conference, ADHOC-NOW 2012, Belgrade, Serbia, July 9–11(2012)Google Scholar
  17. 17.
    Backer D, Ephrmides A (1981) The architectural organization of a mobile radio network via a distributed algorithm. Commun IEEE Trans 29(11):1694–1701Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.SetitIsbsSfaxTunisia

Personalised recommendations