Evolution of cooperation in ad hoc networks under game theoretic model

Authors:
Marcin Seredynski;Pascal Bouvry;Mieczyslaw A. Klopotek
Affiliations:
University of Luxembourg, Luxembourg, Luxembourg;University of Luxembourg, Luxembourg, Luxembourg;Polish Academy of Sciences, Warsaw, Poland
Venue:
Proceedings of the 4th ACM international workshop on Mobility management and wireless access
Year:
2006

Citing 5
Cited 2

Mitigating routing misbehavior in mobile ad hoc networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Ad hoc networking: an introduction

Ad hoc networking
Performance analysis of the CONFIDANT protocol

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks

Proceedings of the IFIP TC6/TC11 Sixth Joint Working Conference on Communications and Multimedia Security: Advanced Communications and Multimedia Security
Self-policing mobile ad hoc networks by reputation systems

IEEE Communications Magazine

Performance analysis of trust-based node evaluation schemes in wireless and mobile ad hoc networks

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Self-Optimization and Self-Stabilization in Autonomic Clouds

Concurrency and Computation: Practice & Experience

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a new approach to evolve a cooperative behavior in ad hoc networks. We propose an environment composed of four elements: a game theory based model of the network, trust evaluation mechanism, strategy that defines the behavior of each node and a genetic algorithm. Interaction between nodes is represented as in the Iterated Prisoner's Dilemma under the Random Pairing game. In such a game randomly chosen players receive payoffs that depend on the way they behave. Each node is using a strategy that defines when to drop or to forward packets coming from other nodes. Such strategy is based on the past behavior of the network and on the trust level in the source node of the packet. Using the genetic algorithm we show how such strategies evolve ensuring high level of cooperation in the network.