Modelling the evolution of cooperative behavior in ad hoc networks using a game based model

Abstract—In this paper we address the problem of cooper-ation and selfish behavior in ad hoc networks. We present a new game theory based model to study cooperation between nodes. This model has some similarities with the Iterated Prisoner’s Dilemma under the Random Pairing game. In such game randomly chosen players receive payoffs that depend on the way they behave. The network gaming model includes a simple reputation collection and trust evaluation mechanisms. In our proposition a decision whether to forward or discard a packet is determined by a strategy based on the trust level in the source node of the packet and some general information about behavior of the network. A genetic algorithm (GA) is applied to evolve strategies for the participating nodes. These strategies are targeted to maximize the throughput of the network by enforcing cooperation. Experimental results show that proposed strategy based approach successfully enforces cooperation maximizing the network throughput