Distributed On-Demand Routing Algorithm With Graph Representation Learning for Industrial IoT

Emerging industrial Internet-of-Things (IoT) applications demand diverse and critical Quality of Service (QoS). Deep reinforcement learning (DRL)-based routing approaches offer promise but struggle with scalability and convergence, particularly when dealing with graph-based network information. To t...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on network science and engineering Vol. 12; no. 1; pp. 332 - 343
Main Authors: Dai, Bin, Li, Hetao, Huang, Wenrui
Format: Journal Article
Language:English
Published: Piscataway IEEE 01.01.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Deep learning
deep reinforcement learning
Delays
Graph representation learning
Graphical representations
Heuristic algorithms
Industrial applications
Industrial Internet of Things
Machine learning
Network topology
Quality of service
Quality of service architectures
Representation learning
Routing
routing optimization
Scalability
Topology
Vectors
ISSN:2327-4697, 2334-329X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Emerging industrial Internet-of-Things (IoT) applications demand diverse and critical Quality of Service (QoS). Deep reinforcement learning (DRL)-based routing approaches offer promise but struggle with scalability and convergence, particularly when dealing with graph-based network information. To tackle the challenge, we propose a distributed routing model that leverages graph representation learning (GRL) to learn the optimal routing decision in a distributed manner. We further present on-demand routing algorithms composed of graph representation learning (GRL)-based feature engineering and DRL-based routing decision-making to meet differential QoS requirements. Experimental results demonstrate our approach outperforms state-of-the-art DRL-based routing algorithms in a distributed manner, particularly in large-scale and heavy-load networks.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2327-4697
2334-329X
DOI:10.1109/TNSE.2024.3496438