Distributed coverage games for energy-aware mobile sensor networks

Minghui Zhu, Sonia Martínez

Research output: Contribution to journalArticle

78 Citations (Scopus)

Abstract

Inspired by current challenges in data-intensive and energy-limited sensor networks, we formulate a coverage optimization problem for mobile sensors as a (constrained) repeated multiplayer game. Each sensor tries to optimize its own coverage while minimizing the processing/energy cost. The sensors are subject to the informational restriction that the environmental distribution function is unknown a priori. We present two distributed learning algorithms where each sensor only remembers its own utility values and actions played during the last plays. These algorithms are proven to be convergent in probability to the set of (constrained) Nash equilibria and global optima of a certain coverage performance metric, respectively. Numerical examples are provided to verify the performance of our proposed algorithms.

Original languageEnglish (US)
Pages (from-to)1-27
Number of pages27
JournalSIAM Journal on Control and Optimization
Volume51
Issue number1
DOIs
StatePublished - Apr 17 2013

Fingerprint

Mobile Sensor Networks
Sensor networks
Wireless networks
Coverage
Game
Sensor
Sensors
Energy
Repeated Games
Global Optimum
Performance Metrics
Distributed Algorithms
Parallel algorithms
Nash Equilibrium
Learning algorithms
Sensor Networks
Distribution functions
Learning Algorithm
Distribution Function
Optimise

All Science Journal Classification (ASJC) codes

  • Control and Optimization
  • Applied Mathematics

Cite this

@article{e5056a5a9dc94d5eaf9fac0e4f50c155,
title = "Distributed coverage games for energy-aware mobile sensor networks",
abstract = "Inspired by current challenges in data-intensive and energy-limited sensor networks, we formulate a coverage optimization problem for mobile sensors as a (constrained) repeated multiplayer game. Each sensor tries to optimize its own coverage while minimizing the processing/energy cost. The sensors are subject to the informational restriction that the environmental distribution function is unknown a priori. We present two distributed learning algorithms where each sensor only remembers its own utility values and actions played during the last plays. These algorithms are proven to be convergent in probability to the set of (constrained) Nash equilibria and global optima of a certain coverage performance metric, respectively. Numerical examples are provided to verify the performance of our proposed algorithms.",
author = "Minghui Zhu and Sonia Mart{\'i}nez",
year = "2013",
month = "4",
day = "17",
doi = "10.1137/100784163",
language = "English (US)",
volume = "51",
pages = "1--27",
journal = "SIAM Journal on Control and Optimization",
issn = "0363-0129",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "1",

}

Distributed coverage games for energy-aware mobile sensor networks. / Zhu, Minghui; Martínez, Sonia.

In: SIAM Journal on Control and Optimization, Vol. 51, No. 1, 17.04.2013, p. 1-27.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Distributed coverage games for energy-aware mobile sensor networks

AU - Zhu, Minghui

AU - Martínez, Sonia

PY - 2013/4/17

Y1 - 2013/4/17

N2 - Inspired by current challenges in data-intensive and energy-limited sensor networks, we formulate a coverage optimization problem for mobile sensors as a (constrained) repeated multiplayer game. Each sensor tries to optimize its own coverage while minimizing the processing/energy cost. The sensors are subject to the informational restriction that the environmental distribution function is unknown a priori. We present two distributed learning algorithms where each sensor only remembers its own utility values and actions played during the last plays. These algorithms are proven to be convergent in probability to the set of (constrained) Nash equilibria and global optima of a certain coverage performance metric, respectively. Numerical examples are provided to verify the performance of our proposed algorithms.

AB - Inspired by current challenges in data-intensive and energy-limited sensor networks, we formulate a coverage optimization problem for mobile sensors as a (constrained) repeated multiplayer game. Each sensor tries to optimize its own coverage while minimizing the processing/energy cost. The sensors are subject to the informational restriction that the environmental distribution function is unknown a priori. We present two distributed learning algorithms where each sensor only remembers its own utility values and actions played during the last plays. These algorithms are proven to be convergent in probability to the set of (constrained) Nash equilibria and global optima of a certain coverage performance metric, respectively. Numerical examples are provided to verify the performance of our proposed algorithms.

UR - http://www.scopus.com/inward/record.url?scp=84876120053&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84876120053&partnerID=8YFLogxK

U2 - 10.1137/100784163

DO - 10.1137/100784163

M3 - Article

AN - SCOPUS:84876120053

VL - 51

SP - 1

EP - 27

JO - SIAM Journal on Control and Optimization

JF - SIAM Journal on Control and Optimization

SN - 0363-0129

IS - 1

ER -