Game Theory for Wireless Sensor Networks: A Survey <s> Packet Forwarding <s> This paper uses the viewpoints and methods in game theory to solve the packet forwarding problem in wireless sensor networks.A packet forwarding model is designed for wireless sensor networks,and the node's Pareto optimal utility participating in packet forwarding is analyzed.An algorithm named POUPF(Pareto Optimal Utility based Packet Forwarding) is proposed,which is proved to be able to set a Nash equilibrium and to obtain the Pareto optimal utility for each node.The simulation results verify that POUPF enables the nodes to achieve the Pareto optimal utility by spontaneous cooperation,and the deviation at any one node will decrease the utilities of all related nodes. <s> BIB001 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Packet Forwarding <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> BIB002 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Packet Forwarding <s> Optimal power allocation for distributed parameter estimation in a wireless sensor network with a fusion center under a total network power constraint is considered. For the simple star topology, an analysis of the effect of the measurement noise variance on the optimal power allocation policy is presented. The optimal solution evolves from sensor selection, to water- filling, to channel inversion as the measurement noise variance increases; in the last solution, the sensor with the weakest channel signal-to-noise ratio (SNR) is allocated the largest fraction of the total power. Relaying nodes are then introduced to form the more complex branch, tree, and linear topologies. The optimal power allocation strategies for these complex topologies are then considered for both amplify-and-forward and estimate-and-forward transmission protocols. Analytical solutions for these cases appear to be intractable, and thus asymptotically optimal (for increasing measurement noise variance) solutions are derived. The solutions to this asymptotic problem offer near-optimal performance even for modest measurement noise. The optimal limiting power policy for the leaf nodes in branch and tree topologies is channel inversion, whereas in linear networks, the optimal solution is a form of weighted channel inversion. The results are extended to a multipath channel model and to the estimation of a vector of random parameters. <s> BIB003 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Packet Forwarding <s> In self-organized wireless network, such as ad hoc network, sensor network or mesh network, nodes are independent individuals which have different benefit; Therefore, selfish nodes refuse to forward packets for other nodes in order to save energy which causes the network fault. At the same time, some nodes may be malicious, whose aim is to damage the network. In this paper, we analyze the cooperation stimulation and security in self-organized wireless networks under a game theoretic framework. We first analyze a four node wireless network in which nodes share the channel by relaying for others during its idle periods in order to help the other nodes, each node has to use a part of its available channel capacity. And then, the fault tolerance and security problem is modeled as a non-cooperative game in which each player maximizes its own utility function. The goal of the game is to maximize the utility function in the giving condition in order to get better network efficiency. At last, for characterizing the efficiency of Nash equilibria, we analyze the so called price of anarchy, as the ratio between the objective function at the worst Nash equilibrium and the optimal objective function. Our results show that the players can get the biggest payoff if they obey cooperation strategy. <s> BIB004 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Packet Forwarding <s> In this paper, we consider the reliable data fusion problem in a tactical environment in the presence of adversary. First, we characterize malicious behavior of compromised sensors assuming probabilistic models. Performance of the fusion process, in the presence of malicious sensors, is then quantified. The performance analysis shows that malicious sensors incur significant degradation on the fusion process. Our goal is to substantially improve reliability and robustness of data fusion in sensor networks. To this end, we introduce monitoring nodes (MN) that are distributed across a sensor network to detect,identify and isolate malicious sensors. We formulate the interaction between sensors and MN as a dynamic game with incomplete information, which provides a platform for designing reputation based data fusion. The reputation system ensures reliable data fusion by confining the fusion process to trustworthy sensors. We evaluate performance of the reputation system both by analysis and simulation. <s> BIB005 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Packet Forwarding <s> This paper studied the tradeoff between the data transmission delay and overall network energy efficiency,and developed a game-theoretic model of real-time reliable aggregation mechanism for wireless sensor networks.This mechanism defines a multitier data aggregation architecture which can reduce the total transmission overhead of WSN and balance the tradeoffs between the energy dissipation and the timeliness of data transmission.Simulation results show that the data aggregation architecture can improve the real-time reliability of sensor network. <s> BIB006 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Packet Forwarding <s> In this paper, we propose an efficient bottleneck throughput maximizing routing framework for correlated data gathering in wireless sensor networks. Our proposed routing metric exploits the the data correlation present in sensor networks. For throughput-maximizing correlation aware routing, a game theoretic framework is developed for a local solution of the NP-complete optimization problem. The proposed throughput maximization algorithm selects the best routes to increase the bottleneck throughput of each source in the network using best response dynamics. Numerical results corroborates predicted throughput gains. <s> BIB007 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Packet Forwarding <s> In this paper, we consider the measurement allocation problem in a spatially correlated sensor field. Our goal is to determine the probability of each sensor's being measured based on its contribution to the estimation reliability; it is desirable that a sensor improving the estimation reliability is measured more frequently. We consider a correlation model reflecting transmission power limit, noise in measurement process and channel, and channel attenuation. Then the estimation reliability is defined as the distortion error between the event source in the sensor field and its estimation at the sink. Motivated by the correlation nature, we model the measurement allocation problem into a cooperative game, and then express each sensor's contribution using Shapley value — a formal quantification of individual player's average marginal contribution. Against the intractability in the computation of exact Shapley value, we deploy randomized method that enables to compute approximate Shapley value within reasonable time. In numerical experiments, we evaluate approximate Shapley value by comparing it to the exact one, and illustrate that measurement allocation according to Shapley value turns to the balance between the estimation reliability and network lifetime. <s> BIB008 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Packet Forwarding <s> Data aggregation has been emerged as a basic approach in wireless sensor networks (WSNs) in order to reduce the number of transmissions of sensor nodes. Since multi-source data obtained from different nodes represent redundancy or complement property, as an effective tool to deal with the conflicts, the use of game theory for WSNs is provided. The authors propose a common aggregation model, which is independent of the specific application environments, based on the evolutionary game theory called evolutionary game-based data aggregation model (EGDAM) in WSNs. EGDAM made up of formal definition, functional model and general process is defined to map the competition and cooperation in aggregation procedure into games, and well-avoid perfect rationality. The authors then put the theoretic model into application. Guided by our model, an evolutionary game-based adaptive weighting algorithm named EGWDA is provided for the pixel-level data aggregation with homogeneous sensors. Reasonable weights distribution of sensors can be achieved during the aggregation in WSNs. The experiments on both the self-constructed data and the one from reference made satisfied performances. <s> BIB009 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Packet Forwarding <s> We propose a scheme to reach shorter multicast delay, better energy utilizing efficiency and higher efficiency of data transferring for Sensor Grid. Our scheme calculates the space, energy and data weight vectors in one cluster. Then it searches a new vector composed by the linear combination of the three individual ones. We build game balance equation, use the equal correlation coefficient between the new and old vectors to find the point of game balance, seek linear parameters, and generate a least weight path tree. Extended simulation results indicate that our scheme attains less average multicast delay, the number of links used and better system robusticity. <s> BIB010 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Packet Forwarding <s> Wireless sensor networks consist of resource constrained nodes, especially with respect to power resources. In many cases, the replacement of a dead node is difficult and costly, e.g. an implanted node in the human body. Our main goal in this paper is reducing the total power consumption of the network. For this purpose, we consider the cooperation of nodes in data transmission in terms of a group, since the major consumer of power is the data transmission process. A mobile node may move to a new location, in which it is desirable for the node to join a group. In this paper, we propose an algorithm for nodes to choose the best group in their signal range, using coalitional game theory to determine what is beneficial in terms of power consumption. The protocol is formalized in rewriting logic, implemented in the Maude tool, and validated by means of Maude's model exploration facilities. Simulation-based tools are in general not able to prove the protocol. However, by using Maude, we prove the correctness of our proposed protocol, by searching for failures of the protocol, through all possible behaviors of sensors. These searches prove that grouping nodes is done correctly in all reachable states from a set of initial states of the model. In addition, we simulate our model in order to quantitatively analyze the efficiency of the proposed protocol. The results show significant improvements in power efficiency. <s> BIB011
In WSNs, selfish nodes refuse to forward packets for other nodes in order to save energy which causes the network to enter into a faulty state. At the same time, some nodes may be malicious, whose aims are to damage the network. Chen and Du BIB004 analyzed the cooperation stimulation and security in self-organized wireless networks under a game theoretic framework. The fault tolerance and security problem is modeled as a non-cooperative game in which each player maximizes its own utility function. The results showed that players can obtain the biggest payoff if they tell the truth and obey the cooperation strategy. Dai et al. BIB001 adopted the viewpoints and methods in game theory to solve the packet forwarding problem in WSNs and proposed an algorithm named Pareto Optimal Utility based Packet Forwarding (POUPF) which is able to set a NE and to obtain the Pareto optimal utility for each node. Dehnie et al. BIB005 formulated the interaction between sensors and monitoring nodes as a dynamic game with incomplete information, which provides a platform for designing reputation based data fusion. Huang and Liu BIB006 studied the tradeoff between data transmission delay and overall network energy efficiency, and developed a game-theoretic model of real-time reliable aggregation mechanism for WSNs. Jia et al. BIB001 focused on the packet forwarding problem in WSNs and provided a solution with the method of game theory. A common aggregation model was proposed in BIB009 , which is independent of the specific application environments, but based on the evolutionary game theory called evolutionary game-based data aggregation model (EGDAM) in WSNs. EGDAM consists of formal definition, functional model and a general process is defined to map the competition and cooperation in aggregation procedure into games, and well-avoid perfect rationality. Guided by the model, an evolutionary game-based adaptive weighting algorithm named EGWDA was provided for the pixel-level data aggregation with homogeneous sensors. Reasonable sensors weight distribution can be achieved during the aggregation process in WSNs. Fan et al. BIB010 proposed a scheme to reach shorter multicast delay, better energy utilizing efficiency and higher efficiency of data transferring for Sensor Grid. Zeydan et al. BIB007 proposed an efficient bottleneck throughput maximizing routing framework for correlated data gathering in WSN. In BIB002 , BIB008 and BIB003 , the estimation reliability in the mean square error (MSE) criterion was defined, and it is between a source node in the sensor field and its estimation at a sink node. Kazemeyni et al. BIB011 considered the cooperation of nodes in data transmission in terms of a group, since the major consumer of power is the data transmission process. A mobile node may move to a location, in which it is desirable for the node to join a group. They proposed an algorithm for nodes to choose the best group in their signal range, using coalitional game theory to determine what is beneficial in terms of power consumption.