## 3 Applications of Game Theory in WSN
### Game Theory for Wireless Communication in WSN
#### 3.2.4 Routing Protocol Designs  
Routing protocol design is concerned with the efficiency that data, acquired by a sensor node, can be channeled through other nodes and either directly or indirectly reach the base station for analyze. Protocols used in WSN, on the other hand, have an integrated effect on the power consumed in radio transmission as well as the economical use of radio spectrum. Game theory has been satisfactorily employed in the design of routing protocols that it is able to account for difficulties in node behavior, energy balance, dynamic route allocation and many others. Game theory can also be applied in the control of _ad-hoc_ network management, random access MAC and other communication architectures. [PERSON] and [PERSON] [107] had presented a review and comparison for typical representations of routing protocols applied game theory approaches for various wireless networks such as _ad-hoc_ networks, mobile _ad hoc_ networks and sensor networks that all of them lead to improve the network performance. [PERSON] and [PERSON] [146] designed a generic protocol called Selfishness Resilient Resource Reservation protocol which applies game theory to achieve collusive networking behavior in WSN environment. [PERSON] _et al_. [147] modeled the problem of energy-efficient MAC protocols as a game-theoretic constraint optimization by introducing incompletely cooperative game theory which is based on the estimated game state. [PERSON] _et al_. [148] presented a model of routing game for Wireless Multimedia Sensor Networks (WMSN). Authors discussed the equilibrium of the routing game, and gave a game routing algorithm for WMSN. [PERSON] [149] proposed a reliable routing model against selfish nodes and introduced this model into DSR routing as DSR-G, and the simulation result had shown that selfish nodes have less infections in DSR-G than DSR. In [68], a distributed energy balanced algorithm for data gathering and routing is proposed aiming to construct energy balanced routing trees in a network that contains heterogeneous nodes. [PERSON] _et al_. [150] proposed an enhanced access protocol which is basically based on modified version of Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. The scheme efficiency is proved resorting to game theoretic framework. The cooperative diversity protocols designed with the assumption that terminals always help each other in a socially efficient manner. However, the terminals may misbehave for selfish or for malicious intentions. [PERSON] _et al_. [151] proposed a game model to solve the MAC address assignment problem in sensor networks. [PERSON] [152] developed a routing scheme based on the game theoretic model. By using the dynamic online approach, each sensor node can make routing decisions while ensuring good global properties. In addition, the proposed routing paradigm is realized in a distributed way without a central controller, which is more practical for real network operations. [PERSON] [70] formulated BNE conditions which a simple threshold strategy that is competitively optimal for each sensor, and proposed a scheme for decentralized threshold computation. [PERSON] [153] also considered two methodologies for decentralized sensor activation in WSNs for energy-efficient monitoring. [PERSON] _et al_. [154] abstracted the motivation of joint optimization of path reliability, energy consumption and lifetime factors as the rational tendency of intelligent sensors, and modeled the routing problem using a game theoretic paradigm. [PERSON] _et al_. [155] proposed an efficient energy-management framework in WSNs and addressed the fundamental research challenge imposed by both the maintenance of the energy supply and the support of the quality-of-information (QoI) requirements. [PERSON] and [PERSON] [156] used the concept of incomplete cooperative game theory to model an energy efficient MAC protocol for WSNs.