Novel constrained QoS routing approach of energy-aware optimization based on learning automata for mobile edge computing (MEC)

Existing multi-path routing protocols can meet the service requirements of end-to-end delay and reliability between nodes in the Internet of Things, but they consume more energy. Constrained QoS routing is a new research method for routing protocols, which keeps up with the current trend. By considering the three QoS constraints of end-to-end delay, reliability, and energy consumption, we innovatively use the related techniques of mobile edge computing with machine learning automata to construct a sensor network as a multi-constrained optimal path model in this paper. At the same time, introducing the energy-aware node wake-up mechanism and the reward and punishment mechanism of learning automata, we propose an oriented mobile edge computing node energy-aware optimized QoS constrained routing algorithm. The algorithm can optimize the network energy consumption, extend the network life cycle, and accelerate the convergence by using learning automata. By experimental testing and comparison, the novel constrained Multi-QoS routing approach of energy-aware optimization based on learning automata for mobile edge computing (MQEN) proposed in this paper can reduce end-to-end delay, improve reliability, and decrease energy consumption.

Authors

Institutions

Publication Details

Journal
Journal of High Speed Networks
Published
2026-02-18
DOI
https://doi.org/10.1177/09266801251412547
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Novel constrained QoS routing approach of energy-aware optimization based on learning automata for mobile edge computing (MEC)

De-Gan ZHANG, Lu Chen, Tao Liu, Ting Zhang et al.
Journal of High Speed Networks
IoT and Edge/Fog Computing
article

Novel constrained QoS routing approach of energy-aware optimization based on learning automata for mobile edge computing (MEC)

De-Gan ZHANG, Lu Chen, Tao Liu, Ting Zhang, Jie Zhang, Meng Qiao
article en

Abstract

Existing multi-path routing protocols can meet the service requirements of end-to-end delay and reliability between nodes in the Internet of Things, but they consume more energy. Constrained QoS routing is a new research method for routing protocols, which keeps up with the current trend. By considering the three QoS constraints of end-to-end delay, reliability, and energy consumption, we innovatively use the related techniques of mobile edge computing with machine learning automata to construct a sensor network as a multi-constrained optimal path model in this paper. At the same time, introducing the energy-aware node wake-up mechanism and the reward and punishment mechanism of learning automata, we propose an oriented mobile edge computing node energy-aware optimized QoS constrained routing algorithm. The algorithm can optimize the network energy consumption, extend the network life cycle, and accelerate the convergence by using learning automata. By experimental testing and comparison, the novel constrained Multi-QoS routing approach of energy-aware optimization based on learning automata for mobile edge computing (MQEN) proposed in this paper can reduce end-to-end delay, improve reliability, and decrease energy consumption.

Journal of High Speed Networks
Tianjin University of Technology (CN), Tianjin University of Sport (CN), University of Macau (MO), City University of Macau (MO)
Affordable and clean energy
Openalex Percentile: Top 59%
IoT and Edge/Fog Computing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.