Game Theory for Wireless Sensor Networks: A Survey <s> Communication, Spectrum Allocation and Routing <s> An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. We present Ad-hoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad-hoc networks. Each mobile host operates as a specialized router, and routes are obtained as needed (i.e., on-demand) with little or no reliance on periodic advertisements. Our new routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad-hoc networks. AODV provides loop-free routes even while repairing broken links. Because the protocol does not require global periodic routing advertisements, the demand on the overall bandwidth available to the mobile nodes is substantially less than in those protocols that do necessitate such advertisements. Nevertheless we can still maintain most of the advantages of basic distance vector routing mechanisms. We show that our algorithm scales to large populations of mobile nodes wishing to form ad-hoc networks. We also include an evaluation methodology and simulation results to verify the operation of our algorithm. <s> BIB001 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Communication, Spectrum Allocation and Routing <s> Interest in robust detection and estimation in the presence of lying nodes has assumed importance in a number of applications. In this paper we motivate the robust detection and estimation problem using recent results for cooperative sensing in Cognitive Radios and multi-object tracking in sensor networks. As a first step, we formulate an abstract version of the problem that is solved under different assumptions. We use Expectation Maximization (EM) framework to successfully weed out the lying nodes. We consider different types of lying behavior. In the simplistic case of liars behaving the same over all observations. In the more complex cases, the lying behavior of the users changes over time. The solution to the problem of detection in the presence of lying nodes has been developed from two view points. In the first case we consider the binary variable being detected as a latent variable, and in the second case we consider the binary variable as a parameter. The results under the two schemes are presented and compared. In all of the cases considered in this paper, we show that the factors that maximally impact the estimation/decision process are the mean of the liars, the variance of the channel, and the number of observations. <s> BIB002 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Communication, Spectrum Allocation and Routing <s> In this paper, we propose a coalitional game theoretic approach to the power control problem in resourceconstrained wireless sensor networks, where the objective is to enhance power efficiency of individual sensors while providing the QoS requirements. We model this problem as two-sided one-to-one matching game and deploy deferred acceptance procedure that produces a single matching in the core, which is the set of actions aN of all sensors such that no coalition of sensors has an action that all its members prefer to aN. Furthermore, we show that, by applying the procedure repeatedly, a certain stable state is achieved where no sensor can anticipate improvements in their power efficiency as far as all of them are subject to their own QoS constraints. We evaluate our proposal by comparing them with cluster-based coalescing and the local optimal solution obtained by maximizing the total system energy efficiency, where the objective function is non-convex. <s> BIB003 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Communication, Spectrum Allocation and Routing <s> Future wireless systems are characterized by the pouring of diversified services supported by heterogeneous radio access technologies (RATs). In parallel with this, the tremendous demand for spectrum has brought the requirement of dynamic spectrum allocation (DSA) into our sight. This article aims at designing a centralized DSA scheme to enhance the spectrum utilization and maximize the profit of operators for cooperative wireless networks. In this scheme, the economic factor of the spectrum of wireless systems is considered in order to guarantee the fairness for the spectrum allocation. RATs are considered as cooperative players participating in cooperative games for spectrum allocation. As an attractive solution for n-person cooperative game with transferable utility, the Shapley value is adopted to handle the profit allocation among RATs. Particularly, we focus on the interference mitigation method, which is a fundamental issue for applying DSA to real wireless systems. The simulation results reveal that the proposed DSA scheme not only improves the spectrum utilization and the profit of operators, but also effectively restrains the inter-system interference between wireless networks under an acceptable level. <s> BIB004 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Communication, Spectrum Allocation and Routing <s> This paper proposes a cooperative strategy for multi-user symmetrical cooperative communication networks. The cooperative strategy for two users is not suitable for the multi-user networks, where only part of the users participate in cooperation. To solve this problem, first, a multi-user cooperative framework executed in turn is presented and the cooperative condition is established. Second, the users' maximum feasible cooperative subset is obtained via the admission control algorithm. Then, an optimal bandwidth allocation framework is proposed utilizing NBS (Nash bargaining solution) from cooperative game theory. Simulation results demonstrate that the proposed strategy could find the users' cooperative subset effectively, and obtain better transmission rates than the non-cooperative strategy. <s> BIB005 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Communication, Spectrum Allocation and Routing <s> Wireless sensor networks are typically ad-hoc networks of resource-constrained nodes; in particular, the nodes are limited in power resources. It can be difficult and costly to replace sensor nodes, for instance when implanted in the human body. Data transmission is the major consumer of power, so it is important to have power-efficient protocols. In order to reduce the total power consumption in the network, we consider nodes which cooperate to transmit data. Nodes which cooperate, form a group. A mobile node may at some point be without a group, in which case it is desirable for the node to be able to join a group. In this paper we propose a modification of the AODV protocol to decide whether a node should join a given group, 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. <s> BIB006 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Communication, Spectrum Allocation and Routing <s> As to the collaborative technique in sensor network,an integrated multi-target collaborative tracking model was constructed based on mobile dynamic coalition under the background of multi-satellite tracking.Then as to the mobile dynamic coalition formation,a coalition formation method was proposed based on game theory.Using mobile dynamic coalition,this collaborative model exchanged and coordinated the information of nodes to accord their action.So it is distributive and self-organizing.Simulation results validate the effectiveness of collaborative model in sensor network tracking multi-target. <s> BIB007 </s> Game Theory for Wireless Sensor Networks: A Survey <s> Communication, Spectrum Allocation and Routing <s> In this paper, the problem of node management in the presence of randomized cooperation is tackled. First, game theory is exploited to model the problem of setting up a cluster of cooperative nodes in a wireless network as a multiplayer noncooperative game. In this game the set of players is made of all the nodes belonging to a potential relay cluster an d the set of actions for each player consists of two options only (characterized by different payoffs), namely transmitting a data packet or remaining silent. Then, a novel strategy for the management of node participation to a distributed cooperative link is derived. The proposed solution is fully distributed, is characterized by autonomous choices made by each potential relay and is of significant practical interest since it guarantees the participation of a proper number of nodes to a virtual antenna array (so avoiding an energy waste associated with an excessive number of cooperating nodes) without requiring any overhead for node management. <s> BIB008
For instance, Ma et al. BIB005 proposed a cooperative strategy for multi-user symmetrical cooperative communication networks. An optimal bandwidth allocation framework is suggested that utilizes NBS from cooperative game theory. Roosta et al. BIB002 examined the robust detection and estimation problem using recent results for cooperative sensing in cognitive radios and multi-object tracking in sensor networks. The authors of literature BIB002 considered different types of lying behavior: (1) The liar's behaviors remain constant in the simplistic cases. (2) The lying behaviors of the users change over time in more complex cases. Sang-Seon and Balasingham BIB003 proposed a coalitional game theoretic approach to the power control problem in resource constrained WSNs and model the problem as two-sided one-to-one matching game and deploy deferred acceptance procedure that produces a single matching in the core. Moreover, as the procedure iterates repeatedly, a certain stable state is achieved where no sensor can anticipate improvements in their power efficiency as far as all of them are subject to their own QoS constraints. Vanbien et al. BIB004 had designed a centralized dynamic spectrum allocation scheme to enhance the spectrum utilization and maximize the profit of operators for cooperative wireless networks. In this scheme, the economic factor of the spectrum of wireless systems is considered in order to guarantee the fairness for the spectrum allocation. Radio access technologies (RATs) are considered as cooperative players participating in cooperative games for spectrum allocation. As an attractive solution for n-person cooperative game with transferable utility, the Shapley value is adopted to handle the profit allocation among RATs. Kazemeyni et al. BIB006 modified the Ad-Hoc On-demand Distance Vector (AODV) routing protocol BIB001 using coalitional game theory. AODV is a reactive protocol where the route is created when needed. As to the collaborative technique employed in sensor networks, an integrated multi-target collaborative tracking model was constructed based on mobile dynamic coalition under the background of multi-satellite tracking BIB007 . Sergi and Vitetta BIB008 used game theory to set up a cluster of cooperative nodes in WSN. A source node gives his sampling data to a destination node needing other nodes' relay. There are two scenarios for the behavior of relay nodes. In the first scenario all the nodes are all prone to cooperation, while in the second case they are all selfish. In the first scenario a node will make its choices without expecting his personal reward if he can bring benefit to the network by his actions. In the second scenario proper polices are needed for cooperation enforcement. A node acquires some credits which represented by virtual money or a reputation level when it cooperates with other nodes. Moreover, we can use non-cooperative game theory in the second scenario for the selfish nodes.