Supermodular Game for Power Control in TOA-Based Positioning

Moragrega, Ana; Closas, Pau; Ibars, Christian

doi:10.1109/tsp.2013.2259160

Cited by 32 publications

(25 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Spurred and motivated by the well-established application to the fields above, GT is also pervading many other branches of SP, and has very recently been used for modeling and analyzing the following "classical" SP problems: distributed estimation in sensor networks [12]; adaptive filtering [13]; waveform design for multipleinput multiple-output (MIMO) radar estimation [14]; jamming of wireless communications [15] and MIMO radar applications [16]; and finding the position of network nodes [17]. In addition to the examples above, we must eventually point out the important connection that is building up between GT and SP through the fields of machine learning algorithms [18] and distributed optimization [19].…”

Section: S Lasaulce Is Withmentioning

confidence: 99%

See 1 more Smart Citation

Game Theory for Networks: A tutorial on game-theoretic tools for emerging signal processing applications

Bacci

Lasaulce

Saad

et al. 2016

IEEE Signal Process. Mag.

118

View full text Add to dashboard Cite

The aim of this tutorial is to provide an overview, although necessarily incomplete, of game theory (GT) for signal processing (SP) in networks. One of the main features of this contribution is to gather in a single article some fundamental game-theoretic notions and tools that, over the past few years, have become widespread in the SP literature. In particular, both strategic-form and coalition-form games are described in detail, and the key connections and differences between them are outlined. Moreover, particular attention is also devoted to clarifying the connections between strategic-form games and distributed optimization and learning algorithms. Beyond an introduction to the basic concepts and main solution approaches, several carefully designed examples are provided to allow a better understanding of how to apply the described tools

show abstract

Section: S Lasaulce Is Withmentioning

confidence: 99%

“…Other examples of super-modular games can be found in the literature of SP. For instance, in [17] the problem of time of arrival-based positioning is formulated as a super-modular game.…”

Section: Special Classes Of Strategic-form Gamesmentioning

confidence: 99%

Game Theory for Networks: A tutorial on game-theoretic tools for emerging signal processing applications

Bacci

Lasaulce

Saad

et al. 2016

IEEE Signal Process. Mag.

118

View full text Add to dashboard Cite

show abstract

“…Not only can the localization process [ 19 ], sleep time allocation [ 20 ], dynamic range measurement allocation [ 21 ], node selection [ 22 ] and link selection [ 23 ] be formulated as game problems, but also, the power allocation issues can be addressed as a resource management game in WSNs. In [ 24 ], the author derived a solution based on modeling the positioning problem as a supermodular game to trade-off the power level and desired positioning quality. In [ 25 ], the author proposed a power management game to obtain optimization power allocation for cooperative localization in asynchronous networks.…”

Section: Introductionmentioning

confidence: 99%

Distributed Power Allocation for Wireless Sensor Network Localization: A Potential Game Approach

Tian

et al. 2018

Sensors

View full text Add to dashboard Cite

The problem of distributed power allocation in wireless sensor network (WSN) localization systems is investigated in this paper, using the game theoretic approach. Existing research focuses on the minimization of the localization errors of individual agent nodes over all anchor nodes subject to power budgets. When the service area and the distribution of target nodes are considered, finding the optimal trade-off between localization accuracy and power consumption is a new critical task. To cope with this issue, we propose a power allocation game where each anchor node minimizes the square position error bound (SPEB) of the service area penalized by its individual power. Meanwhile, it is proven that the power allocation game is an exact potential game which has one pure Nash equilibrium (NE) at least. In addition, we also prove the existence of an ϵ-equilibrium point, which is a refinement of NE and the better response dynamic approach can reach the end solution. Analytical and simulation results demonstrate that: (i) when prior distribution information is available, the proposed strategies have better localization accuracy than the uniform strategies; (ii) when prior distribution information is unknown, the performance of the proposed strategies outperforms power management strategies based on the second-order cone program (SOCP) for particular agent nodes after obtaining the estimated distribution of agent nodes. In addition, proposed strategies also provide an instructional trade-off between power consumption and localization accuracy.

show abstract

“…In [15], a network with TOA-based positioning capabilities is considered, which allows to pose the power control problem as a supermodular game. In contrast to TOA-based ranging, the case of RSS-based ranging has the particularity that increasing the power level does not impact on obtaining better range estimates.…”

mentioning

confidence: 99%

“…The effect of the received power level is that above a certain threshold (where anchor and target are in range) ranging is feasible and below it is not. This prevents the use of the supermodular game developed in [15] as the assumptions made there do not hold anymore. In [16], the performance of a potential game for RSS-based ranging was presented in a static scenario.…”

mentioning

confidence: 99%

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

Moragrega

Closas

Ibars

2015

IEEE J. Select. Areas Commun.

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Supermodular Game for Power Control in TOA-Based Positioning

Cited by 32 publications

References 22 publications

Game Theory for Networks: A tutorial on game-theoretic tools for emerging signal processing applications

Game Theory for Networks: A tutorial on game-theoretic tools for emerging signal processing applications

Distributed Power Allocation for Wireless Sensor Network Localization: A Potential Game Approach

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

Contact Info

Product

Resources

About