Ecole d'ingénieur et centre de recherche en Sciences du numérique

Making greed work in mobile ad hoc networks

Michiardi, Pietro;Molva, Refik

Research report RR-02-069

Countermeasures against node misbehavior and selfishness are mandatory requirements in mobile ad hoc networks. Selfishness that causes lack of node activity cannot be solved by classical security means that aim at verifying the correctness and integrity of an operation. In this paper we outline an original security mechanism (CORE) based on reputation that is used to enforce cooperation among the nodes of a MANET. We then investigate on its robustness using an original approach: we use game theory to model the interactions between the nodes of the ad hoc network and we focus on the strategy that a node can adopt during the network operation. As a first result, we obtained the guidelines that should be adopted when designing a cooperative security mechanism that enforces mobile nodes cooperation. Furthermore, we were able to show that when no countermeasures are taken against misbehaving nodes, network operation can be heavily jeopardized. We then showed that the CORE mechanism is compliant with guidelines provided by the game theoretic model and that, under certain conditions, it assures the cooperation of at least half of the nodes of a MANET

Document Bibtex

Titre:Making greed work in mobile ad hoc networks
Mots Clés:Security;Denial of service attacks;Simulation;Game theory
Type:Rapport
Langue:English
Date:
Département:Sécurité numérique
Eurecom ref:980
Copyright: © EURECOM. Personal use of this material is permitted. The definitive version of this paper was published in Research report RR-02-069 and is available at :
Bibtex: @techreport{EURECOM+980, year = {2002}, title = {{M}aking greed work in mobile ad hoc networks}, author = {{M}ichiardi, {P}ietro and {M}olva, {R}efik}, number = {EURECOM+980}, month = {03}, institution = {Eurecom}, url = {http://www.eurecom.fr/publication/980},, }
Voir aussi: