Advertisement

Mobile Networks and Applications

, Volume 15, Issue 2, pp 191–204 | Cite as

A Secure Mechanism Design-Based and Game Theoretical Model for MANETs

  • A. Rachedi
  • A. Benslimane
  • H. Otrok
  • N. Mohammed
  • M. Debbabi
Article

Abstract

To avoid the single point of failure for the certificate authority (CA) in MANET, a decentralized solution is proposed where nodes are grouped into different clusters. Each cluster should contain at least two confident nodes. One is known as CA and the another as register authority RA. The Dynamic Demilitarized Zone (DDMZ) is proposed as a solution for protecting the CA node against potential attacks. It is formed from one or more RA node. The problems of such a model are: (1) Clusters with one confident node, CA, cannot be created and thus clusters’ sizes are increased which negatively affect clusters’ services and stability. (2) Clusters with high density of RA can cause channel collision at the CA. (3) Clusters’ lifetime are reduced since RA monitors are always launched (i.e., resource consumption). In this paper, we propose a model based on mechanism design that will allow clusters with single trusted node (CA) to be created. Our mechanism will motivate nodes that do not belong to the confident community to participate by giving them incentives in the form of trust, which can be used for cluster’s services. To achieve this goal, a RA selection algorithm is proposed that selects nodes based on a predefined selection criteria function and location (i.e., using directional antenna). Such a model is known as moderate. Based on the security risk, more RA nodes must be added to formalize a robust DDMZ. Here, we consider the tradeoff between security and resource consumption by formulating the problem as a nonzero-sum noncooperative game between the CA and attacker. Finally, empirical results are provided to support our solutions.

Keywords

MANET security mechanism design certificate authority clustering 

References

  1. 1.
    Alpcan T, Basar T (2004) A game theoretic analysis of intrusion detection in access control systems. In: Proceedings of the 43rd IEEE conference on decision and control (CDC)Google Scholar
  2. 2.
    Anderegg L, Eidenbenz S (2003) Ad hoc-VCG: a truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents. In: Proceedings of the ACM MobiCom’03, San DiegoGoogle Scholar
  3. 3.
    Basu P, Khan N, Little T (2001) A mobility based metric for clustering in mobile ad hoc networks. In: Proceedings of distributed computing systems workshop, pp 43–51Google Scholar
  4. 4.
    Bechler M, Hof H-J, Kraft D, Pahlke F, Wolf L (2004) A cluster-based security architecture for ad hoc networks. In: Proceeding of IEEE INFOCOM’2004, pp 2393–2403Google Scholar
  5. 5.
    Budakoglu C, Gulliver TA (2004) Hierarchical key management for mobile ad-hoc networks. In: IEEE vehicular technology conference (VTC’2004), vol 4, pp 2735–2738Google Scholar
  6. 6.
    Capkun S, Buttyan L, Hubaux J (2003) Self-organized public-key management for mobile ad hoc networks. In: ACM international workshop on wireless security, WiSe, pp 52–64Google Scholar
  7. 7.
    Capkun S, Hubaux J (2006) Secure positioning in wireless networks. In: Proceedings of IEEE JSAC, special issue on security in ad-hoc networks, vol 24(2), pp 221–232Google Scholar
  8. 8.
    Chen K, Nahrstedt K (2004) iPass: an incentive compatible auction scheme to enable packet forwarding service in MANET. In: Proceedings of the IEEE ICDCS’04Google Scholar
  9. 9.
    Chokhani S, Ford W, Sabett R, Merill C (2003) Internet x.509 public key infrastructure certificate policy and certification practices framework. In: Internet request for comments (RFC3647)Google Scholar
  10. 10.
    Dong Y, Go H, Sui A, Li V, Hui L, Yiu S (2007) Providing distributed certificate authority service in mobile ad hoc networks. Comput Commun 30:2442–2452CrossRefGoogle Scholar
  11. 11.
    Feigenbaum J, Papadimitriou C, Sami R, Shenker S (2002) A BGP based mechanism for lowest-cost routing. In: Proceedings of the ACM annual symposium on principles of distributed computingGoogle Scholar
  12. 12.
    Hu L, Evans D (2004) Using directional antennas to prevent wormhole attacks. In: Network and distributed system security symposiumGoogle Scholar
  13. 13.
    Hurwicz L, Reiter S (2008) Designing economic mechanisms, 1st edn. Cambridge University Press, CambridgeGoogle Scholar
  14. 14.
    Liu Y, Comaniciu C, Man H (2006) A bayesian game approach for intrusion detection in wireless ad hoc networks. In: Proceedings of the GameNets’06, ACM, October 2006Google Scholar
  15. 15.
    Mas-Colell A, Whinston M, Green J (1995) Microeconomic theory. Oxford University Press, New YorkGoogle Scholar
  16. 16.
    The network simulator ns-2 (2009) T. VINT project. http://www.isi.edu/nsnam/ns
  17. 17.
    Mohammed N, Otrok H, Wang L, Debbabi M, Bhattacharya P (2008) A mechanism design-based multi-leader election scheme for intrusion detection in manet. In: The proceedings of IEEE WCNC 2008Google Scholar
  18. 18.
    Morris P (1994) Introduction to game theory, 1st edn. Springer, New YorkMATHGoogle Scholar
  19. 19.
    Nisan N, Ronen A (1999) Algorithmic mechanism design. In: Proceedings of STOCGoogle Scholar
  20. 20.
    Otrok H, Mehrandish M, Assi C, Debbabi M, Bhattacharya P (2007) Game theoretic models for detecting network intrusions. Comput Commun J 31(10):1934–1944CrossRefGoogle Scholar
  21. 21.
    Otrok H, Mohammed N, Wang L, Debbabi M, Bhattacharya P (2008) A game-theoretic intrusion detection model for mobile ad-hoc networks. J Comput Commun 31(4):708–721CrossRefGoogle Scholar
  22. 22.
    Rachedi A, Benslimane A (2006) A secure architecture for mobile ad hoc networks. In: Proceedings of international conference MSN’06. LNCS, vol 4325, China, pp 424–435Google Scholar
  23. 23.
    Satizabal C, Hernandez-Serrano J, Forné J, Pegueroles J (2007) Building a virtual hierarchy to simplify certification path discovery in mobile ad-hoc networks. Comput Commun 30:1498–1512CrossRefGoogle Scholar
  24. 24.
    Shamir A (1995) How to share a secret. Commun ACM 22:612–613CrossRefMathSciNetGoogle Scholar
  25. 25.
    Willem M (1996) Minimax theorem. Birkhauser, BostonGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • A. Rachedi
    • 1
  • A. Benslimane
    • 1
  • H. Otrok
    • 2
  • N. Mohammed
    • 2
  • M. Debbabi
    • 2
  1. 1.LIA/CERIUniversity of AvignonAvignonFrance
  2. 2.CIISEConcordia UniversityMontréalCanada

Personalised recommendations