Skip to main navigation Skip to search Skip to main content

Stochastic Learning for the SET K-COVER Problem in Heterogeneous Wireless Sensor Networks

  • Changhao Sun
  • , Xiaochu Wang
  • , Huaxin Qiu
  • , Qingrui Zhou

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper addresses the SET K-COVER problem by proposing a memorial mixed-response algorithm (MMRA) from the perspective of learning in games, where each sensor node is viewed as a non-greedy game player with a limited memory and updates its action following a finite memory and a mixed response rule. We prove that our MMRA converges to a convention of Nash equilibria. Moreover, a tradeoff between solution efficiency and computation time could be achieved via the adjustment of the amount of randomness. Comparison results against typical distributed methods demonstrate the advantage of our methodology.

Original languageEnglish
Title of host publicationProceedings of the 39th Chinese Control Conference, CCC 2020
EditorsJun Fu, Jian Sun
PublisherIEEE Computer Society
Pages4521-4525
Number of pages5
ISBN (Electronic)9789881563903
DOIs
StatePublished - Jul 2020
Externally publishedYes
Event39th Chinese Control Conference, CCC 2020 - Shenyang, China
Duration: 27 Jul 202029 Jul 2020

Publication series

NameChinese Control Conference, CCC
Volume2020-July
ISSN (Print)1934-1768
ISSN (Electronic)2161-2927

Conference

Conference39th Chinese Control Conference, CCC 2020
Country/TerritoryChina
CityShenyang
Period27/07/2029/07/20

Keywords

  • Convention
  • Nash equilibrium refinement
  • Potential game
  • SET K-COVER
  • Wireless sensor network (WSN)

Fingerprint

Dive into the research topics of 'Stochastic Learning for the SET K-COVER Problem in Heterogeneous Wireless Sensor Networks'. Together they form a unique fingerprint.

Cite this