Robust Coordinated Reinforcement Learning for MAC Design in Sensor Networks

In this paper, we propose a medium access control (MAC) design method for wireless sensor networks based on decentralized coordinated reinforcement learning. Our solution maps the MAC resource allocation problem first to a factor graph, and then, based on the dependencies between sensors, transforms...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE journal on selected areas in communications Jg. 37; H. 10; S. 2211 - 2224
Hauptverfasser: Nisioti, Eleni, Thomos, Nikolaos
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.10.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Access control
Algorithms
Complexity
Complexity theory
Computer simulation
Convergence
Coordination
coordination graphs
irregular repetition slotted ALOHA
Knapsack problem
Machine learning
max-sum algorithm
Media Access Protocol
Medium access control
Optimization
POMDP
Q-learning
Reinforcement learning
Remote sensors
Resource allocation
Resource management
Sensors
Throughput
Wireless sensor networks
ISSN:0733-8716, 1558-0008
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we propose a medium access control (MAC) design method for wireless sensor networks based on decentralized coordinated reinforcement learning. Our solution maps the MAC resource allocation problem first to a factor graph, and then, based on the dependencies between sensors, transforms it into a coordination graph, on which the max-sum algorithm is employed to find the optimal transmission actions for sensors. We have theoretically analyzed the system and determined the convergence guarantees for decentralized coordinated learning in sensor networks. As part of this analysis, we derive a novel sufficient condition for the convergence of max-sum on graphs with cycles and employ it to render the learning process robust. In addition, we reduce the complexity of applying max-sum to our optimization problem by expressing coordination as a multiple knapsack problem (MKP). The complexity of the proposed solution can be, thus, bounded by the capacities of the MKP. Our simulations reveal the benefits coming from adaptivity and sensors' coordination, both inherent in the proposed learning-based MAC.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0733-8716
1558-0008
DOI:10.1109/JSAC.2019.2933887