## 4 Taxonomy of Cooperation in UASNs
### Game Theoretic-Based Cooperation
#### Dynamic Bayesian Game  
In [32; 76] the authors proposed an enhanced secured routing scheme using a concept of signaling game in dynamic Bayesian model in which they analyze the regular strategy profile of malicious nodes and how to protect the nodes from anonymous behavior. The authors in [77] proposed a Secure and Distributed Reprogramming Protocol (SDRP) which uses identity-based cryptography to reduce the storage requirement and communication of every node based on secure reprogramming. A convergence in terms of true cooperation for Bayesian game was designed in [48], which uses the concepts of reputation values to analyze the payoff for the game. They define two different types of participants, honest type and dishonest type. They illustrate the sustainability of true cooperation based on repeated game even on the dynamic application, and there is an increase in the average players' reputation over a given time in a certain coverage. A routing model based on the concepts of a dynamic Bayesian game was proposed by [78] where they analyzed routing concepts theoretically to fill the gap between decision making of non-simultaneous and information history which is also incorporated in the process of theoretically routing modeling in the approach of game theory. However, the problem with this approach is that it does not provide the practical test of different functions of utilities and the probability distribution in the game on different parameters of networks such as node mobility rate and selfish node in order to have fair comparison with existing works. A scheme for secure and robust routing is proposed in [79], where an interaction between sender node and receiver node was modeled on the basis of a game model. In this work, a dynamic Bayesian game were used based on node opinion about the opponent in which the destination node established the mechanism of acknowledgement for the reception of the packet from a participating node in the game. [PERSON] et al. [80] proposed a scheme based on the game theory of interaction, coding theory and establishment of trust for the restriction of attacks and colluding. In these schemes, the message availability is guaranteed whenever there exists a legitimate path. This scheme also shows that it achieves efficiency in terms of latency, energy consumption as well as availability of paths, but the scheme does not provide reliability of message delivery among nodes. In [81], [PERSON] et al. studied, analyzed and addressed a vast number of privacy and security problems for different applications in computer science such as mobile and network applications, where they organized their work into several modules that addressed a particular problem in the aspect of security. They also designed a mechanism for security and conducted an analysis under equilibrium, where they highlight the advantages and disadvantages of game theory. However, the work only covers the theoretical part, which is helpful in terms of developing solutions to the problem of security of the network using a game theory approach [34]. An access based on point pricing modeling for dynamic game is proposed in [82], where they modeled a two-person game between the access point owner and client, in which both have some set of symmetric information. However, the client has more information than the owner of the access provider. It is found that a client has a utility function which is the web browser and the Nash equilibrium which enables the provider to take advantage of the client and change the constant price charge for the client for a given unit of time. A majority of the security game classes define a two-person strategic game where one of the players would act as an attacker trying to hack and damage the system in order to degrade the performance. However, in this study the game is different due to the fact that the game is an n-person strategic game, where all the players are rational, and these players always prefer to take actions that would benefit them.