Game Theory for Wireless Sensor Networks: A Survey <s> Topology Optimization <s> Wireless Sensor Networks (WSN) are mainly characterized by dense deployment of sensor nodes which collectively transmit information about sensed events to the sink. Due to the spatial correlation between sensor nodes subject to observed events, it may not be necessary for every sensor node to transmit its data. This paper shows how the spatial correlation can be exploited on the Medium Access Control (MAC) layer. To the best of our knowledge, this is the first effort which exploits spatial correlation in WSN on the MAC layer. A theoretical framework is developed for transmission regulation of sensor nodes under a distortion constraint. It is shown that a sensor node can act as a representative node for several other sensor nodes observing the correlated data. Based on the theoretical framework, a distributed, spatial Correlation-based Collaborative Medium Access Control (CC-MAC) protocol is then designed which has two components: Event MAC (E-MAC) and Network MAC (N-MAC). E-MAC filters out the correlation in sensor records while N-MAC prioritizes the transmission of route-thru packets. Simulation results show that CC-MAC achieves high performance in terms energy, packet drop rate, and latency. <s> BIB001 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Topology Optimization <s> This paper proposes a topology control algorithm for wireless sensor networks which have a large scale structure and densely distributed nodes. One of the main problems in topology control is power efficiency with consideration of connectivity. The proposed algorithm is aimed to find a topology with near optimum power consumption within reasonable convergence time. While game theory is exploited to prove convergence property of proposed algorithm, clustering concept is employed to reduce convergence time with the aid of parallel processing. <s> BIB002 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Topology Optimization <s> The channel contention process is modeled as a dynamic game with incomplete information,and Nash Equilibrium(NE)of the game is obtained.Based on S-Medium Access Control(MAC)protocol for Wireless Sensor Networks(WSN),the IIDG-MAC protocol is proposed by using NE.Simulation results indicate that compared with S-MAC,using IIDG-MAC increases the successful transmission rate of packets,decreases energy consumption for retransmitting packets,delay and bit-drop-rate,and increases the system throughput. <s> BIB003 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Topology Optimization <s> In the traditional medium access control (MAC) protocols for wireless sensor networks (WSNs), energy consumption is traded for throughput and delay. However, in future WSNs, throughput and delay performance had better not be sacrificed for energy conservation. Here first, an incompletely cooperative game-theoretic heuristic-based constraint optimisation framework is introduced to achieve the goals of throughput, delay and energy conservation simultaneously. Then a simplified game-theoretic MAC (G-MAC) protocol is presented, which can be easily implemented in WSNs. Simulation results show that compared with two typical MAC protocols for WSNs, sensor MAC and timeout MAC, G-MAC can increase system throughput, and decrease delay and packet-loss-rate, while maintaining relatively low energy consumption. <s> BIB004 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Topology Optimization <s> We consider the problem of incentive compatible topology control for selfish all-to-one (reverse multicast) routing as modeled by a locally minimum cost forwarding game, with new focus in this work on efficient local implementability in the absence of complete global information for realistic scenarios. In this work we consider a new locally computable heuristic “recommendation algorithm”, which we refer to as LocalHeur for convenience. LocalHeur lies within the class of location based routing methods with particular similarity to the Nearest Forward Progress algorithm though from the perspective of game-theoretic reverse multicast routing. We find that LocalHeur actually outperforms DeltaHeur in terms of global optimality in random Euclidean power instances which model wireless networks, though at the expense of loosening the Nash equilibrium condition. Nonetheless, we find that the relaxation of the Nash condition is strongly bounded in multiple ways, with high probability: The vast majority of players are provably playing a best response, while simulation results demonstrate that the average deviation ratio from a best response is within a decimal point of 1. Furthermore, the player deviating most from his best response is provably still within O(log n) of the cost of his best response, while simulation results support a much smaller maximum deviation from the best response. <s> BIB005 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Topology Optimization <s> Wireless Heterogeneous Sensor Network (WHSN) facilitates ubiquitous information acquisition for Ambient Intelligence (AmI) systems. It is of great importance of power management and topology control for WHSN to achieve desirable network performances, such as clustering properties, connectivity and power efficiency. This paper proposes a game theoretic model of topology control to analyze the decentralized interactions among heterogeneous sensors. We study the utility function for nodes to achieve desirable frame success rate and node degree, while minimizing the power consumption. Specifically, we propose a static complete-information game formulation for power scheduling and then prove the existence of the Nash equilibrium with simultaneous move. Because the heterogeneous sensors typically react to neighboring environment based on local information and the states of sensors are evolving over time, the power-scheduling problem in WHSN is further formulated into a more realistic incomplete-information dynamic game model with sequential move. We then analyze the separating equilibrium, one of the perfect Bayesian equilibriums resulted from the dynamic game, with the sensors revealing their operational states from their actions. The sufficient and necessary conditions for the existence of separating equilibrium are derived for the dynamic Bayesian game, which provide theoretical basis to the proposed power scheduling algorithms, NEPow and BEPow. The primary contributions of this paper include applying game theory to analyze the distributed decision-making process of individual sensor nodes and to analyze the desirable utilities of heterogeneous sensor nodes. Simulations are presented to validate the proposed algorithms and the results show their ability of maintaining reliable connectivity, reducing power consumption, while achieving desirable network performances. <s> BIB006
WSN has been used in many areas such as military sensing, environmental health monitoring, and home area security surveillance. Routing algorithm and topology control are extremely important in WSN to maintain a balance between throughput, delay and energy. Game theory has played an active role in this aspect. Zhao et al. BIB003 BIB004 introduced an incompletely cooperative game-theoretic heuristic-based constraint optimization framework into WSN to acquire a balance. Varatharajan and Ercal-Ozkaya BIB005 considered a locally computable heuristic "recommendation algorithm" referring to as LocalHeur for convenience of incentive compatible topology control for selfish all-to-one routing which is modeled by a locally minimum cost forwarding game in the absence of complete global information for realistic scenarios. LocalHeur lies within the class of location based routing methods with particular similarity to the Nearest Forward Progress algorithm though from the perspective of game-theoretic reverse multicast routing. A game theoretic model presented in BIB006 yields decentralized optimization for joint topology control and power management. Global game equilibriums are iteratively reached by considering individual node degree, message delivery ratio and cost of increasing power. Researchers provide NEPow and BEPow schemes for implementations based on mathematical game analysis. Vuran and Akyildiz BIB001 designed a distributed, spatial Correlationbased Collaborative Medium Access Control (CC-MAC) protocol which based on the theoretical framework. The CC-MAC has two components: Event MAC (E-MAC) and Network MAC (N-MAC). As one of the most widely investigated topology control mechanisms of WSN, the clustering algorithm provides energy efficient communications by reducing transmission overhead and enhancing transmission reliability. Sarrafi et al. BIB002 developed a topology control algorithm for WSNs having a large scale structure and densely distributed nodes. The topology of the irrigation control sub-network is analyzed and a distributed two-tier routing (DTTR) protocol was proposed in literature  . The protocol includes intra-cluster and inter-cluster routing schemes. Game theory is introduced in the inter cluster multi-hop routing scheme. With the utilization of multistage finitely repeated games and the metric method based on link quality indication, the energy balance problem under multiple constraints is solved.