Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> Wireless sensor networks (for short, WSNs) can be used in many aspects in the future. One obstacle is their limited supply of energy. Therefore, minimizing energy consumption and maximizing the system lifetime have been major design goals for WSNs. This paper presents an energy-efficient ACHGT (Adaptive Clustering Hierarchy based on Game-theoretic Techniques) routing algorithm for WSNs. Individual sensors of the algorithm are modeled as players to make decisions about whether electing to become cluster-head nodes by using node energy payoff functions to weigh their own costs and benefits. This strategy can keep sensor nodes of lower remainder energy out from being used up quickly. Besides, it can evenly distribute the energy load among the sensors in the network to prolong system lifetime. Detailed simulations of sensor network environments demonstrate that the ACHGT algorithm reduces energy consumption, and improves the evenness of dissipated network energy and the ability to postpone the network partitions. <s> BIB001 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> In a wireless sensor network, we deploy a number of energy constrained nodes in an area to fulfill some monitoring task for a period. There exists a trade-off between network lifetime and coverage performance. We investigate this trade-off by maximizing the average coverage performance during a given network lifetime. Our main idea is to divide all the nodes in the network into several disjoint groups, and at each time only one group are in the active mode. To maximize the average coverage, we want the overlapped sensing area in each group to be minimized. Furthermore, to achieve this objective distributively we formulate this group division and coverage maximizing problem into a game theory model and our desired solution in this model is a Nash Equilibrium strategy profile. Finally, we apply a hill-climbing Nash Equilibrium convergence idea into our coverage game and let each node converge to an approximate Nash Equilibrium in a coherent local way. Our simulation results show that from a random start point we can realize convergence in only 20 to 45 iterations when number of nodes in the network increases from 80 to 170. What's more, the coverage performance provided by Nash Equilibrium solution is 96.43% and 95.49% to a derived upper bound in the high density grid and random networks respectively. <s> BIB002 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> A game theoretic energy balance routing (GTEBR) algorithm was proposed to avoid unevenly energy consuming in wireless sensor networks. In GTEBR algorithm, arbitration mechanism and confidence probability are introduced to convert static game of incomplete information into static game of complete but imperfect information and the method of static game is imposed to solve this problem. Moreover, the calculation method for node is put forward and the existence of Nash equilibrium of the sensor networks is proofed in this paper. Simulation results show that the GTEBR algorithm has good astringency and performance. <s> BIB003 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> In resource constraint Wireless Sensor Networks(WSNs),path reliability,energy consumption and lifetime are three key factors considered in the design of routing algorithms.We abstract the motivation of joint optimization of these factors as the rational tendency of intelligent sensors,and model the routing problem using a game theoretic paradigm.We prove that there exists a pure strategic Nash Equilibrium of our routing game and the optimal path is the outcome of the Nash Equilibrium for the WSNs with limited sensors. <s> BIB004 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> Decentralized activation in wireless sensor networks is investigated for energy-efficient monitoring using the theory of global games. Given a large number of sensors which can operate in either an energy-efficient ldquolow-resolutionrdquo monitoring mode, or a more costly ldquohigh-resolutionrdquo mode, the problem of computing and executing a strategy for mode selection is formulated as a global game with diverse utilities and noise conditions. Each sensor measures its environmental conditions in noise, and determines whether to enter a ldquohigh-resolutionrdquo mode based on its expected contribution and energy cost, which relies on Bayesian estimates of others' observations and actions. We formulate Bayes-Nash equilibrium conditions for which a simple threshold strategy is competitively optimal for each sensor, and propose a scheme for decentralized threshold computation. The threshold level and its equilibrium properties depend on the prior probability distribution of environmental conditions and the observation noise, and we give conditions for equilibrium of the threshold strategy as a function of the prior and observation noise. We also illustrate an interesting phase transition property of the Nash equilibrium for high congestion or low noise variance. <s> BIB005 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> This contribution proposes and investigates a random access Medium Access Control (MAC) - Relay Selection Mechanism - for cluster-based geographic routing in Multi-hop Wireless Sensor Networks (WSNs). The intertwined MAC and network routing solution is derived in a cross-layer approach. The game-theoretical relay selection strategy (random multiple access) relies on well-known descending pricing auctions also known as "Dutch Auctions". In particular, successive rounds of Dutch auctions are employed to deal with contention avoidance and contention resolution stages of the non-cooperative games between source and relay nodes. If a non-empty auction round has no winner (due to collision), the source starts a new round with a signaling packet containing an indication of collision. Consequently, at each round relay candidates are able to infer on their location relative to other potential relays, based on which they can choose to drop out or continue their bidding. The strategy, which is fully distributed and eliminates the need for the source to know the number of potential relays a priori, proves very efficient, approaching the performance of an ideal scheduled-based Random Selection Algorithm (RSA). The performance of our previously proposed cluster-based geographic routing employing this RSA is investigated using an event-driven network simulation, in a scenario with a topological dead-end hole. The results indicate that the combined techniques can retain a substantial portion of the Packet Delivery Success Ratio (PDSR) associated with a system with perfect relay selection. <s> BIB006 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> In this paper, we propose an efficient routing solution for correlated data collection in wireless sensor networks. Our proposed routing metric considers both the interference distribution as well as the data correlation when establishing routes. An iterative, distributed solution based on local information is proposed using a game theoretic framework. Routes are chosen to minimize both the interference impact of nodes in their neighborhood and the joint entropy of multiple sources relayed through common nodes. <s> BIB007 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> In WSNs, energy conservation is the primary goal, while throughput and delay are less important. This results in a tradeoff between performance (e.g., throughput and delay) and energy consumption. In this paper, the problem of energy-efficient MAC protocols in WSNs is modeled as a game-theoretic constraint optimization problem. After introducing incompletely cooperative game theory, based on the estimated game state (e.g., the number of competing nodes), each node independently implements the optimal equilibrium strategy under the given constraints (e.g., the used energy). Moreover, a simplified game-theoretic constraint optimization scheme (G-ConOpt) is presented in this paper, which is easy to be implemented in current WSNs. Simulation results show that G-ConOpt can increase system performance while still maintaining reasonable energy consumption. <s> BIB008 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> Recently, game theory has become a useful and powerful tool in research on wireless mesh networks. In this article the authors present a novel concept of incompletely cooperative game theory and use it to improve the performance of MAC protocols in WMNs. In this game, first, each node estimates the current game state (e.g., the number of competing nodes). Second, the node adjusts its equilibrium strategy by tuning its local contention parameters (e.g., the minimum contention window) to the estimated game state. Finally, the game is repeated several times to get the optimal performance. To use the game effectively in WMNs, the authors present a hybrid CSMA/CA protocol by integrating a proposed virtual CSMA/CA and the standard CSMA/CA protocol. When a node has no packet to send, it contends for the channel in virtual CSMA/CA mode. In this way the node can estimate the game state and obtain the optimal strategy. When a node has packets to send, it contends for the channel in standard CSMA/CA mode with the optimal strategy obtained in virtual CSMA/CA mode, switching smoothly from virtual to standard CSMA/CA mode. At the same time, the node keeps adjusting its strategy to the variable game state. In addition, the authors propose a simplified game-theoretic MAC protocol (G-CSMA/CA) by designing an auto degressive backoff mechanism based on the incompletely cooperative game. G-CSMA/CA can easily be implemented in mesh nodes. Finally, simulation results show that the incompletely cooperative game can increase system throughput, decrease delay, jitter, and packet loss rate, and support the game effectively. <s> BIB009 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> As one of the most widely investigated topology control mechanisms of wireless sensor networks (WSNs), the clustering algorithm provides energy efficient communications by reducing transmission overhead and enhancing transmission reliability. Through the previous forms of noncooperative games, the behavior of each sensor node (SN) is individual in WSNs; accordingly, it engenders uneven distribution of residual energy across SNs and expedites network partition. To balance energy consumption of SNs and increase network lifetime and stability, a cooperative game theoretic model of clustering algorithms is provided for assigning feasible allocations of energy cost. Moreover, from the outcome of this model, we propose and analyze a cooperative clustering approach for global optimization with the capacity of sensing data transmission and energy efficiency. The key idea is that SNs should trade off individual cost with network-wide cost. In the algorithm, we develop conditions to form coalitions considering residual energy, transmission distance and number of SNs in a cluster adapting to various WSNs. Furthermore, we present performance evaluation and comparison of the existing clustering algorithms with our approach quantitatively with respect to network lifetime, data transmission capacity and energy efficiency. Comparing with other approaches through the simulation, our scheme can surely guarantee to prolong network life-time and improve data transmission capacity up to 5.8% and 35.9%, respectively. <s> BIB010 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> A trustworthy energy efficient routing algorithm (TEER) is proposed in this paper aims to distribute energy consumption across sensors evenly as well as increase path security in a hierarchical-cluster sensornet. In this paper, we model the cluster head selection using a game theoretic paradigm. The Nash equilibrium of our election game corresponds to the optimal healthier cluster heads having higher energy and trust level. A trust model is integrated in TEER to evaluate node's trust level and detect evil nodes. Simulation results testify to the effectiveness of the algorithm in producing a longer network lifetime and a safer network. <s> BIB011 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> In order to efficiently solve the problem of rooting,this paper introduced the thinking of game theory and presented UCEER algorithm for wireless sensor networks.Simulation results show that the routing algorithm efficiently balances the energy consumption of nodes in wireless sensor networks prolongs the network lifetime and guarantees the path reliability. <s> BIB012 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> Cluster-based LEACH routing protocol has the good adaptability for large-scale wireless sensor network, but the existing algorithms may improve the network lifetime through adjusting the threshold, which could make the number of cluster-heads in one certain area more or less, due to ignoring the number of cluster-heads in the process of cluster-heads decision. An optimal cluster-heads algorithm in this paper is proposed to improve the network performance. The simulation results show that our protocol improves the performance, and thus prolong the network lifetime. <s> BIB013 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> Traditional networks are built on the assumption that network entities cooperate based on a mandatory network communication semantic to achieve desirable qualities such as efficiency and scalability. Over the years, this assumption has been eroded by the emergence of users that alter network behavior in a way to benefit themselves at the expense of others. At one extreme, a malicious user/node may eavesdrop on sensitive data or deliberately inject packets into the network to disrupt network operations. The solution to this generally lies in encryption and authentication. In contrast, a rational node acts only to achieve an outcome that he desires most. In such a case, cooperation is still achievable if the outcome is to the best interest of the node. The node misbehavior problem would be more pronounced in multihop wireless networks like mobile ad hoc and sensor networks, which are typically made up of wireless battery-powered devices that must cooperate to forward packets for one another. However, cooperation may be hard to maintain as it consumes scarce resources such as bandwidth, computational power, and battery power. This paper applies game theory to achieve collusive networking behavior in such network environments. In this paper, pricing, promiscuous listening, and mass punishments are avoided altogether. Our model builds on recent work in the field of Economics on the theory of imperfect private monitoring for the dynamic Bertrand oligopoly, and adapts it to the wireless multihop network. The model derives conditions for collusive packet forwarding, truthful routing broadcasts, and packet acknowledgments under a lossy wireless multihop environment, thus capturing many important characteristics of the network layer and link layer in one integrated analysis that has not been achieved previously. We also provide a proof of the viability of the model under a theoretical wireless environment. Finally, we show how the model can be applied to design a generic protocol which we call the Selfishness Resilient Resource Reservation protocol, and validate the effectiveness of this protocol in ensuring cooperation using simulations. <s> BIB014 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> Due to the wide application fields, many people research Wireless Sensor Networks(WSNs). Currently, more and more researchers focus on the existence of selfish nodes which do not cooperate in routing and forwarding. Traditional methods need too much resource or do not adapt to menace from inner of network. In this paper, we propose a reliable routing model against selfish nodes. Game theory is used in our model to find the balance between the reliability and resource limitation. In simulation, we introduce our model into DSR routing as DSR-G. The simulation result shows the selfish nodes has less infections in DSR-G than DSR. <s> BIB015 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> In this paper, an enhanced access protocol minimizing message delivering latency is proposed. It is basically based on modified version of Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol in which one sensor at a time is allowed to deviate from standard rules behaving like a cheater and keeping the Contention Window (CW) fixed and equal to the minimum value. The proposed scheme efficiency is proved resorting to game theoretic framework, while its performance is analytically derived through a Markov model for a worst case conditions. Focusing on Wireless Body Area Networks (WBANs) application scenario, main system figures, in terms of delivering delay and dropping probability, are further pointed out by means of numerical simulations, highlighting optimal agreement with theoretical results as well as the protocol suitability for critical situation management. <s> BIB016 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> Game Theory provides a mathematical tool for the analysis of interactions between the agents with conflicting interests, hence it is well suitable tool to model some problems in communication systems, especially, to wireless sensor networks (WSNs) where the prime goal is tominimize energy consumption than high throughput and low delay. In this paper, we use the concept of incomplete cooperative game theory to model an energy efficient MAC protocol for WSNs. This allows us to introduce improved backoff algorithm for energy efficient MAC protocol in WSNs. Finally, our research results show that the improved back off algorithm can improve the overall performance as well as achieve all the goals simultaneously for MAC protocol in WSNs. <s> BIB017 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> An important and essential issue for wireless networks is routing protocol design that is a major technical challenge due to the function of the network. Game theory is a powerful mathematical tool that analyzes the strategic interactions among multiple decision makers and the results of researches show that applied game theory in routing protocol lead to improvement the network performance through reduce overhead and motivates selfish nodes to collaborate in the network. This paper presents a review and comparison for typical representatives of routing protocols designed that 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. <s> BIB018 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> Practical implementation of balanced data routing algorithms in WSNs is challenging because of the heterogeneity among nodes inherited from the physical world in forms of different amount of nodal traffic, residual energy, data transmission rate and bandwidth. As the main concern in sensor networks is preserving nodes' energy, such algorithms should balance energy depletion among nodes by carefully considering the impact of aforementioned heterogeneities to prolong the network lifetime. In this paper, a distributed energy balanced algorithm for data gathering and routing is proposed aiming to construct energy balanced routing trees in a network that contains heterogenous nodes. For this purpose, a game theoretical approach in which nodes can be selfish or cooperative players based on their roles in the network. Utility functions use local information of nodes and they are defined in a way that, while each node in selfish mode tries to achieve the most individual benefit, it implicitly helps to construct a balanced tree for the entire network. Evaluation and simulation results show noticeable improvement in generating more energy balanced routing trees, resulting longer network lifetimes compared to similar work in the literature. <s> BIB019 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> This paper considers two methodologies for decentralized sensor activation in wireless sensor networks for energy-efficient monitoring. First, decentralized activation in wireless sensor networks is investigated using the theory of global games. Given a large number of sensors which can operate in either an energy-efficient ''low-resolution'' monitoring mode, or a more costly ''high-resolution'' mode, the problem of computing and executing a strategy for mode selection is formulated as a global game with diverse utilities and noise conditions. We formulate Bayes-Nash equilibrium conditions for which a simple threshold strategy is competitively optimal for each sensor, and propose a scheme for decentralized threshold computation. The second class of results we consider is in a non-Bayesian context where sensors deploy simple adaptive filtering algorithms and the global behavior converges to the set of correlated equilibria. <s> BIB020 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> In this paper, we propose an efficient energy-management framework in wireless sensor networks (WSNs) to address the fundamental research challenge imposed by both the maintenance of the energy supply and the support of the quality-of-information (QoI) requirements. By quantifying the QoI benefit the tasks receive in relation to the level of QoI they request as the QoI satisfaction index), we propose a QoI-aware energy-management scheme to distributedly decide the participating state of each sensor. Specifically, by using the mathematical framework of the Gur Game, we propose a novel pay-off structure taking into account the QoI and the energy consumption. We finally evaluate the proposed scheme under an event occurrence detection scenario, where the proposed scheme successfully guarantees less than 7% QoI outage, saves 80% of the energy reserve if compared with the lower bound solution, and achieves the suboptimum with only 4% gap if compared with optimal solution. <s> BIB021 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> Power control in wireless sensor networks is vital to maintain reliable communication links and to maximize the battery life. Transmitting at high power not only reduces the lifetime of the nodes and that of the network, but it also introduces excessive interference. Hence it is essential for each node to transmit at minimal transmit power, thereby reducing interference and maintaining network connectivity. This paper analyses a game theoretic model taking into consideration the residual energy of the nodes in a homogenous wireless sensor network considering random and square topology. The utility function of nodes that minimizes power consumption is analysed and the existence of Nash Equilibrium is studied. Simulation results show that, power consumption is reduced and throughput is maintained when square topology is considered. <s> BIB022 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> A game theoretic method, called the first price sealed auction game, was introduced to control routing overhead in wireless sensor networks in this paper. The players of the game are the wireless nodes with set of strategies (forward or not). The game is played whenever an arbitrary node in the network forwards packets. In order for the game to function, a multi-stage pricing game model is established, this provides the probability that the wireless nodes forward the receiving packets, and the payoff of all nodes can be optimize through choosing the best neighbour node. The simulations in NS2 showed that the pricing routing game model improves performance, not only decreasing the energy consumption, but also prolonging network life time. Finally the numerical analysis about nodes' payoff is given through Matlab. <s> BIB023 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> Game theory has been used for decades in fields of science such as economics and biology, but recently it was used to model routing and packet forwarding in wireless ad-hoc and sensor networks. However, the clustering problem, related to self-organization of nodes into large groups, has not been studied under this framework. In this work our objective is to provide a game theoretical modeling of clustering for ad-hoc and sensor networks. The analysis is based on a non-cooperative game approach where each sensor behaves selfishly in order to conserve its energy and thus maximize its lifespan. We prove the Nash Equilibria of the game for pure and mixed strategies, the expected payoffs and the price of anarchy corresponding to these equilibria. Then, we use this analysis to formulate a clustering mechanism (which we called Clustered Routing for Selfish Sensors--CROSS), that can be applied to sensor networks in practice. Comparing this mechanism to a popular clustering technique, we show via simulations that CROSS achieves a performance similar to that of a very popular clustering algorithm. <s> BIB024 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Routing Protocol Designs <s> Solutions to Set K-Cover problem can prolong the life time of WSN by partitioning the nodes into K sets. In this paper, a novel pure distributed method for solving K-Cover problem is introduced based on game theory, in which we consider the Set K-Cover problem as a Non-Cooperate N-Person Card Game. The nodes in WSN are considered as the players, the cover sets chosen by N nodes as strategies, and the sensing area alone as the payoff function for each node. After the gaming process, the best strategies all the players have chosen constitute the Nash equilibrium. Finally, extensive simulations have been conducted to show the superiority in convergence and coverage of the proposed method over the random, K-cover and SNECA algorithms. <s> BIB025
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. Javidi and Aliahmadipour BIB018 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. See-Kee and Seah BIB014 designed a generic protocol called Selfishness Resilient Resource Reservation protocol which applies game theory to achieve collusive networking behavior in WSN environment. Zhao et al.  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. Ke et al.  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. Zheng BIB015 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 BIB019 , 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. Francesco et al. BIB016 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. Kim et al.  proposed a game model to solve the MAC address assignment problem in sensor networks. Kim  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. Krishnamurthy BIB005 formulated BNE conditions which a simple threshold strategy that is competitively optimal for each sensor, and proposed a scheme for decentralized threshold computation. Krishnamurthy BIB020 also considered two methodologies for decentralized sensor activation in WSNs for energy-efficient monitoring. Li et al. BIB004 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. Liu et al. BIB021 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. Mehta and Kwak BIB017 used the concept of incomplete cooperative game theory to model an energy efficient MAC protocol for WSNs. Valli and Dananjayan BIB022 analyzed a game theoretic model taking into consideration residual energy of nodes in a homogenous WSN considering random and square topology. A game theoretic method called the first price sealed auction game was introduced to control routing overhead in WSNs in literature BIB023 . The method divides all nodes in a WSN into several disjoint groups, and only one group is in the active mode at each time can save energy and prolong the lifetime of the whole WSN. Lima and de Abreu BIB006 proposed and investigated a random access Medium Access Control (MAC)-Relay Selection Mechanism for cluster-based geographic routing in Multi-hop WSNs. The game-theoretical relay selection strategy relies on descending pricing auctions which is known as "Dutch Auctions". Koltsidas and Pavlidou BIB024 provided a game theoretical modeling of clustering for ad-hoc and sensor networks. The analysis is based on a non-cooperative game approach where each sensor behaves selfishly in order to conserve its energy and maximize its lifespan. The authors formulate a clustering mechanism called Clustered Routing for Selfish Sensors (CROSS) which can be applied to sensor networks in practice. To balance energy consumption of sensor nodes and increase network lifetime and stability, a cooperative game theoretic model of clustering algorithms is provided for assigning feasible allocations of energy cost BIB010 . Wang et al. BIB011 proposed a trustworthy energy efficient routing algorithm (TEER) aiming to distribute energy consumption across sensors evenly as well as increase the path security in a hierarchical-cluster sensor network, and the cluster head is selected by using a game theoretic paradigm. Zhong and Cheng BIB012 introduced GT to routing algorithm and presented the Unequal Clustering Energy-Economical Routing (UCEER) algorithm for WSN which can balance nodes' energy consumption and prolong network lifetime. Yang et al. BIB013 proposed an optimal cluster-head algorithm to improve network performance. To maximize the average coverage, Xin et al. BIB002 desired that the overlapped sensing area in each group to be minimized. To achieve this objective, authors formulated this group division and coverage maximizing problem into a game theory model and the desired solution in this model is a NE strategy profile. Then, a hill-climbing NE convergence idea applied into the coverage game and let each node converge to an approximate NE in a coherent local way. Zeydan et al. BIB007 proposed an efficient routing solution using a game theoretic framework for correlated data collection in WSNs. The Game-theoretical Complete Coverage (GCC) algorithm is used to ensure whole network coverage mainly through adjusting the covering range of nodes and controlling the network redundancy in literature  . A simplified game-theoretic constraint optimization scheme (G-ConOpt) was presented in literature BIB008 , which is easy to be implemented in current WSNs. A simplified game-theoretic MAC protocol (G-MAC) was provided for WSNs in literature BIB009 , by using an auto digressive back-off mechanism which is easy to be implemented. Zheng et al. BIB001 presented an energy-efficient Adaptive Clustering Hierarchy based on Game-theoretic Techniques (ACHGT) routing algorithm for WSNs to balance the energy consumption. To balance energy consumption of sensor nodes and increase network lifetime and stability, a cooperative game theoretic model of clustering algorithms is provided for assigning feasible allocations of energy cost in literature BIB010 . Zeng et al. BIB003 proposed a Game Theoretic Energy Balance Routing (GTEBR) algorithm to avoid unevenly energy consuming in WSNs. Pandremmenou et al.  used the NBS in order to determine the transmission power and source and channel coding rate for each node to solve the problem of resource allocation for a Direct Sequence Code Division Multiple Access (DS-CDMA) wireless visual sensor network. The NBS assumes that the nodes using the help of a centralized control unit negotiate in order to jointly determine their transmission parameters. The transmission powers are allowed to take continuous values, whereas the source and channel coding rate combination can only assume discrete values. The resulting optimization problem is a mixed-integer optimization task and is solved using Particle Swarm Optimization (PSO). Zhu and Jian  proposed an efficient algorithm for computing the optimal strategies for jamming attack and network defense. Yan et al. BIB025 introduced a novel pure distributed method for solving K-Cover problem based on non-cooperative game theory.