Skip to main content
SpringerLink
Log in

Alliance-based clustering scheme for group key management in mobile ad hoc networks

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Several protocols have been proposed to deal with the group key management problem in mobile ad hoc networks (MANETs). Most of these protocols organize the network into clusters to reduce the cost of key refresh or rekeying. Rekeying constitutes a challenging issue in group key management because it must be launched whenever the constitution of the group is altered following a leave or a join operation. However, cluster maintenance may also generate significative communication overhead. So, the clustering algorithm is an important factor in the performance of any key management solution. A clustering algorithm that ensures stable clusters in spite of mobility is very appreciable in mobile ad hoc networks. In fact, all the overhead due to the traffic generated by cluster adjustments and the related rekeying procedures will be saved. As far as we know, no existing clustering algorithm takes into account self-stabilization while relying on the mobility resilience of graph alliances. In this paper, we propose a fully distributed and self-stabilizing clustering algorithm for key management in MANETs where each cluster is an alliance.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Augot D, Bhaskar R, Issarny V, Sacchetti D (2007) A three round authenticated group key agreement protocol for ad hoc networks. Pervasive Mob Comput 3(1):36–52

    Article  Google Scholar 

  2. Baker D, Ephremides A (1981) The architectural organization of a mobile radio network via a distributed algorithm. IEEE Trans Commun 29(11):1694–1701

    Article  Google Scholar 

  3. Baker D, Ephremides A (1981) A distributed algorithm for organizing mobile radio telecommunication networks. In: 2nd International conference on distributed computer systems, pp 476–483

    Google Scholar 

  4. Bhaskar R, Augot D, Issarny V, Sacchetti D (2005) An efficient group key agreement protocol for ad hoc networks. In: IEEE workshop on trust, security and privacy in ubiquitous computing, Taormina, Italy, 12–16 June

    Google Scholar 

  5. Bresson E, Chevassut O, Pointcheval D (2002) Dynamic group Diffie Hellman key exchange under standard assumptions. In: Advances in cryptology—EUROCRYPT ’02. LNCS, vol 2332. Springer, Berlin, pp 321–326

    Google Scholar 

  6. Cho JH, Chen IR, Wang DC (2008) Performance optimization of region-based group key management in mobile ad hoc networks. Perform Eval 65:319–344

    Article  Google Scholar 

  7. Desmedt YG (1994) Threshold cryptography. Eur Trans Telecommun 5(4):449–457

    Article  MathSciNet  Google Scholar 

  8. Diffie W, Hellman ME (1976) New directions in cryptography. IEEE Trans Inf Theory IT–22(6):644–654

    Article  MathSciNet  Google Scholar 

  9. Dijkstra EW (1974) Self-stabilizing systems in spite of distributed control. Commun ACM 17(11):643–644

    Article  MATH  Google Scholar 

  10. Dolev S (2000) Self-stabilization. MIT Press, Cambridge

    MATH  Google Scholar 

  11. Douceur JR (2002) The sybil attack. In: Intl workshop on peer-to-peer systems

    Google Scholar 

  12. Drira K, Seba H, Kheddouci H (2010) Ecgk: an efficient clustering scheme for group key management in MANETs. Comput Commun 33:1094–1107

    Article  Google Scholar 

  13. Hedetniemi SM, Hedetniemi ST, Kristiansen P (2004) Alliances in graphs. J Comb Math Comb Comput 48:157–177

    MathSciNet  MATH  Google Scholar 

  14. http://www.isi.edu/nsnam/ns/ (2011)

  15. Hu YC, Johnson DB, Perrig A (2002) Ariadne: a secure on-demand routing protocol for ad hoc networks. In: Mobicom’02

    Google Scholar 

  16. Hu YC, Johnson DB, Perrig A (2002) Sead: secure efficient distance vector routing for mobile wireless ad hoc networks. In: Fourth IEEE workshop on mobile computing systems and applications (WM-CSA’02), Jun

    Google Scholar 

  17. Karlof C, Wagner D (2003) Secure routing in wireless sensor networks:attacks and countermeasures. AdHoc Netw 1(2–3):293–315, Special Issue on Sensor Network Applications and Protocols

    Article  Google Scholar 

  18. Kim Y, Perrig A, Tsudik G (2000) Simple and fault-tolerant key agreement for dynamic collaborative groups. In: Seventh ACM conf computer and comm security, Nov, pp 235–244

    Chapter  Google Scholar 

  19. Kim Y, Perrig A, Tsudik G (2004) Group key agreement efficient in communication. IEEE Trans Comput 53(7):905–921

    Article  Google Scholar 

  20. Larson T, Hedman N (1998) Routing protocols in wireless ad-hoc networks: a simulation study. Master Thesis, Lulea University of Technology Stockholm

  21. Li JH, Bhattacharjee B, Yu M, Levy R (2008) A scalable key management and clustering scheme for wireless ad hoc and sensor networks. Future Gener Comput Syst 24:860–869

    Article  Google Scholar 

  22. Li JH, Yu M, Levy R, Teittinen A (2006) A mobility resistant efficient clustering approach for ad hoc and sensor networks. Mob Comput Commun Rev 10(2):1–12

    Article  MATH  Google Scholar 

  23. Li X, Slay J, Yu S (2005) Evaluating trust in mobile ad hoc networks. In: International conference on computational intelligence and security (CIS’2005) December

    Google Scholar 

  24. Liao L, Manulis M (2007) Tree-based group key agreement framework for mobile ad-hoc networks. Future Gener Comput Syst, 23(6):787–803

    Article  Google Scholar 

  25. Mahapatra RP, IACSIT S, Katyal M (2010) Taxonomy of routing security for ad-hoc network. Int J Comput Theory Eng 2(2):1793–8201

    Google Scholar 

  26. Manulis M (2005) Contributory group key agreement protocols, revisited for mobile ad-hoc groups. In: 2nd IEEE international conference on mobile sensor systems, pp 811–818

    Chapter  Google Scholar 

  27. Michiardi P, Molva R (2002) Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. In: Conference on communication and multimedia security (CMS)

    Google Scholar 

  28. Milanovic N, Malek M, Davidson A, Milutinovic V (2004) Routing and security in mobile ad hoc networks. IEEE Comput 37(2):61–65

    Article  Google Scholar 

  29. Mittra S (1997) Iolus: a framework for scalable secure multicasting. In: ACM SIGCOMM, pp 277–288

    Chapter  Google Scholar 

  30. Perrig A, Tygar JD, Song D, Canetti R (2000) Efficient authentication and signing of multicast streams over lossy channels. In: 2000 IEEE symposium on security and privacy

    Google Scholar 

  31. Piro C, Shields C, Levine BN (2006) Detecting the sybil attack in mobile ad hoc networks. In: Securecomm and workshops

    Google Scholar 

  32. Balachandran RK, Ramamurthy B, Xukai Z, Vinodchandran NV (2005) CRTDH: an efficient key agreement scheme for secure group communications in wireless ad hoc networks. In: IEEE international conference on communications (ICC 2005), pp 1123–1127

    Chapter  Google Scholar 

  33. Yi S, Moca RK (2003) Mobile certificate authority for wireless ad hoc networks. In: 2nd annual PKI research workshop (PKI 03)

    Google Scholar 

  34. Steiner M, Tsudik G, Waidner M (2000) Key agreement in dynamic peer groups. IEEE Trans Parallel Distrib Syst 11(8):769–779

    Article  Google Scholar 

  35. Theodorakopoulos G, Baras JS (2006) On trust models and trust evaluation metrics for ad-hoc networks. J Sel Areas Commun Security Wirel Ad-Hoc Netw 24(2):318–328

    Google Scholar 

  36. Tseng Y, Yang C, Liao D (2007) A Secure Group Communication Protocol for Ad Hoc Wireless Networks. Advances in Wireless Ad Hoc and Sensor Networks. Signals and Communication Technology. Springer, Berlin

    Google Scholar 

  37. Xiang-Yang L, Wang Y, Frieder O (2002) Efficient hybrid key agreement protocol for wireless ad hoc networks. In: Proceedings of the Eleventh International Conference on Computer Communications and Networks

    Google Scholar 

  38. Hu YC, Johnson DB (2003) AP Packet leashes: a defense against wormhole attacks in wireless networks. In: Twenty-second annual joint conference of the IEEE computer and communications societies. vol 3., pp 1976–1986

    Google Scholar 

  39. Younes O, Fahmy S (2004) HEED: a hybrid, energy-efficient distributed clustering approach for adhoc sensor networks. IEEE Trans Mob Comput 3(4):1–12

    Article  Google Scholar 

  40. Zhu S, Setia S, Xu S, Jajodia S (2004) GKMPAN, an efficient group rekeying scheme for secure multicast in ad-hoc networks. In: MobiQuitous. IEEE Computer Society, Los Alamitos, pp 42–51

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. G2ap, Université de Lyon, Université Lyon1, 71 rue Peter Fink, Bourg en Bresse, France

    H. Seba

  2. LIG, Université Joseph Fourier, Grenoble, France

    S. Lagraa

  3. GZap, Université deLyon, Université Lyon 1, Villeurbanne, France

    H. Kheddouci

Authors
  1. H. Seba
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Lagraa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. H. Kheddouci
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to H. Seba.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Seba, H., Lagraa, S. & Kheddouci, H. Alliance-based clustering scheme for group key management in mobile ad hoc networks. J Supercomput 61, 481–501 (2012). https://doi.org/10.1007/s11227-011-0607-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-011-0607-3

Keywords

Search

Navigation