Game Theory for Wireless Sensor Networks: A Survey <s> Data Collection <s> A mobile wireless ad hoc network (MANET) consists of a number of devices that form a temporary network operating without support of a fixed infrastructure. The correct operation of such a network requires its users to cooperate on the level of packet forwarding. However, a distributed nature of MANET, lack of a single authority, and limited battery resources of participating devices may lead to a noncooperative behavior of network users, resulting in a degradation of the network throughput. Thus, a cooperation enforcement system specifying certain packet forwarding strategies is a necessity is such networks. In this work we investigate general properties of such a system. We introduce a Prisoner's Dilemma-based model of packet forwarding and next using an evolutionary game-theoretical approach we demonstrate that cooperation very likely to be developed on the basis of conditionally cooperative strategies similar to the TIT-FOR-TAT strategy. <s> BIB001 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Data Collection <s> This paper focuses on the Participatory Sensing Network (PSN) that consists of selfish participants stimulated by certain reward programs. We propose a bargain-based mechanism to encourage cooperative message trading among the selfish nodes to maximize their rewards. We state the necessary condition for feasible message transactions in a theorem. We model message transaction as a two-person cooperative game, and we apply Nash Theorem to obtain optimal solution which is fair and Pareto optimal. We also present a greedy algorithm to reach the optimal solution. The effectiveness of the bargain-based stimulation mechanism is studied by extensive simulations based on real mobility traces. <s> BIB002 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Data Collection <s> In this paper we propose a game theoretic framework for a new approach for MAC design with prioritized event reporting in sensor networks. The MAC priority classes are adaptively assigned based on accuracy of location information for individual sensor nodes, and on data correlation structure. We show that for the proposed MAC solution, the event reporting results in more accurate and faster localization of the event. <s> BIB003 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Data Collection <s> Clustering is an effective approach for managing nodes in wireless sensor networks(WSN). In this paper, we consider selfish avoidance clustering in WSN. A differential game model is proposed to stimulate forwarding. Based on the payoff value of the differential game, called Forwarding Contribution(FC) in this paper, a centralized clustering algorithm is proposed. Mathematical proof shows that our algorithm can ensure connection between cluster heads(CHs), and also shows that FC value can reasonably reflect energy consumption in terms of competition while considering forwarding efficiency. Simulation on the lifetime of network is performed, and the results illustrate that our algorithm is selfish avoidance while the clustering approaches according to residual energy are seriously influenced by selfishness. <s> BIB004 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Data Collection <s> In mobile ad hoc networks such as wireless ad hoc networks and sensor networks, most of the functions (routing, mobility management and security) must rely on cooperation between nodes. Every node in these networks is both end host (it generates its own data and routing traffic) and infrastructure (it forwards traffic for others), but rational nodes have no incentive to cooperatively forward traffic for others, since this kind of forwarding is not costless. Thus, we are motivated to use game theory to analyse cooperative mechanisms, and derive incentive strategies enforcing cooperation in forwarding. Unlike traditional approaches, in this paper, we introduce a novel and interdisciplinary simulation-based analysis scheme to the networking community in game-theoretic settings. Moreover, we investigate noise models and show some counterintuitive simulation results in presence of noise. <s> BIB005 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Data Collection <s> A packet forwarding algorithm based on the dynamic Bayesian game named PFDBG is presented for wireless sensor networks.Packet forwarding is regarded as a multi-stage game with incomplete information and observable actions,the adjacent nodes take the Bayesian amendment method to reasonably calculate and predict the opponent's energy level(private type) based on evaluation of its historical actions,and use the predicted value to obtain the solution which maximizes the expected utility function.The solution is also the optimal forwarding strategy that the nodes will adopt in the next stage of the game;the existence of the Bayesian Nash Equilibrium in the game is proved.Theoretical analysis and experimental results show that the PFDBG algorithm not only ensures the higher throughput of nodes,but also adapts well to the network size,and that it has a small computational overhead,high transmission reliability and low energy consumption,with its performance superior to that of other existing algorithms. <s> BIB006
The collection of sensor data from a site is one of the most important issues in WSN. A good packet forwarding strategy has to be developed for balancing and selecting transmission packets. In data collection, it is important to ensure that all sources have equal access to the network bandwidth so that the sink receives a set of data with complete coverage in the site. Zhao and Shi BIB006 developed a Packet Forwarding algorithm based on the Dynamic Bayesian Game named PFDBG for WSN. The adjacent nodes in WSN use the Bayesian amendment method to reasonably calculate and predict the opponent's energy level based on an evaluation of its historical actions to maximize the expected utility function. Seredynski and Bouvry BIB001 introduced a Prisoner's Dilemma-based model of packet forwarding and next using an evolutionary game-theoretical approach. They demonstrated that cooperation is very likely to be developed on the basis of conditionally cooperative strategies similar to the TIT-FOR-TAT strategy. Xie et al. BIB002 proposed a bargain-based mechanism to encourage cooperative message trading among selfish nodes to maximize their rewards. Shi et al. BIB003 proposed an approach for MAC design with prioritized event reporting in WSNs based on a game theoretic framework. The MAC priority classes are adaptively assigned based on accuracy of location information for individual sensor nodes, and on data correlation structure. The MAC solution makes event reporting more accurate and event localizing faster. Lin et al. BIB004 proposed a differential game model to stimulate forwarding based on the payoff value of the differential game called forwarding contribution by which selfish avoidance clustering in WSNs was considered. Lu BIB005 used game theory to analyze cooperative mechanisms and derive incentive strategies enforcing cooperation in forwarding.