Potential Game for Energy-Efficient RSS-Based Positioning in Wireless Sensor Networks

Abstract

Positioning is a key aspect for many applications in wireless sensor networks. In order to design practical positioning algorithms, employment of efficient algorithms that maximize the battery lifetime while achieving a high degree of accuracy is crucial. The number of participating anchor nodes and their transmit power have an important impact on the energy consumption of positoning a node. This paper proposes a game theoretical algorithm to optimize resource usage in obtaining location information in a wireless sensor network. The proposed method provides positioning and tracking of nodes using RSS measurements. We use the Geometric Dilution of Precision as an optimization metric for our algorithm, with the aim of minimizing the number and power of anchor nodes that collaborate in positioning, thus saving energy. The algorithm is shown to be a potential game, therefore convergence is guaranteed. A distributed low complexity solution for the implementation is presented. The game is applied to WSN and results show the trade-off between power saving and positioning error.

Utility function design for strategic radio resource management games: An overview, taxonomy, and research challenges

“…With these equilibrium solution concepts and frameworks, researchers have addressed existence and uniqueness of equilibrium solutions. Meanwhile, there are supermodular game [41][42][43] and the potential game, [44][45][46][47] which have properties of naturally guaranteeing the existence and uniqueness. In addition, it is known that the unique equilibrium can be also guaranteed by using the specific utility function design.…”

Localization of WSN using Distributed Particle Swarm Optimization algorithm with precise references

“…So selecting the anchor nodes to determine position of a node is a big task. The Cramer Rao bound (CRB) has been proposed as a criterion to censor vain links [8], [10], rather than depend on proximity as a criterion, [10] proposed to use a preset number of links that give lowest CRB. In [16] the authors proposed to use the CRB to select those anchors that would give the best positioning accuracy.…”

“…The parameters used are R Tx = 0.08 (conservative approach) and the R Tx =0.05(aggressive approach). To test our proposed method, the cooperative Distributed PSO algorithm is used [1], [15]. The Distributed PSO algorithm with censoring techniques minimize the localization error, complexity with respect to other measurements.…”

“…Location awareness is rapidly becoming an essential feature for many commercial, public service, and military applications in WSN [1], [2]. Information collected or communicated by wireless node is often meaningful only in conjunction with knowledge of the nodes location.…”

Vector Games with Potential Function

“…In [7,8] potential games were applied to allocation in wireless data network. In [9] the author considers generalized potential games which is an important class of generalized Nash equilibrium problems.…”