The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
De nombreux nœuds de l’Internet des objets (IoT) dépendent de batteries pour leur alimentation. De plus, la demande d’exécution de tâches gourmandes en calcul et sensibles à la latence augmente pour les nœuds IoT. Dans certains scénarios pratiques, les tâches de calcul des WD ont la caractéristique non séparable, c'est-à-dire que des stratégies de déchargement binaire doivent être utilisées. Dans cet article, nous nous concentrons sur la conception d'un algorithme de déchargement binaire efficace qui minimise la consommation d'énergie du système (EC) pour les réseaux informatiques de pointe multi-accès sans fil basés sur TDMA, où les WD calculent les tâches localement ou les déchargent vers des points d'accès hybrides. (H-AP). Nous formulons le problème de minimisation EC qui est un problème non convexe et le décomposons en un problème principal optimisant la décision de déchargement binaire et un sous-problème optimisant la durée du WPT et les durées de transmission du déchargement des tâches. Pour le problème principal, une méthode basée sur le DRL est appliquée pour obtenir la décision de déchargement presque optimale. Pour le sous-problème, nous considérons d'abord le scénario où les nœuds n'ont pas de contraintes de temps de réalisation et obtenons la solution analytique optimale. Ensuite, nous considérons le scénario avec les contraintes. En utilisant conjointement la méthode du nombre d'or et la méthode de la bissection, la solution optimale peut être obtenue en raison de la convexité de la fonction de contrainte. Les résultats de la simulation montrent que l’algorithme de déchargement proposé basé sur le DRL peut atteindre une EC presque minimale.
Xi CHEN
Zhejiang University of Technology
Guodong JIANG
Zhejiang University of Technology
Kaikai CHI
Zhejiang University of Technology
Shubin ZHANG
Zhejiang University of Technology
Gang CHEN
Zhejiang Institute of Mechanical and Electrical Engineering
Jiang LIU
Waseda University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Xi CHEN, Guodong JIANG, Kaikai CHI, Shubin ZHANG, Gang CHEN, Jiang LIU, "Minimization of Energy Consumption in TDMA-Based Wireless-Powered Multi-Access Edge Computing Networks" in IEICE TRANSACTIONS on Fundamentals,
vol. E106-A, no. 12, pp. 1544-1554, December 2023, doi: 10.1587/transfun.2023EAP1035.
Abstract: Many nodes in Internet of Things (IoT) rely on batteries for power. Additionally, the demand for executing compute-intensive and latency-sensitive tasks is increasing for IoT nodes. In some practical scenarios, the computation tasks of WDs have the non-separable characteristic, that is, binary offloading strategies should be used. In this paper, we focus on the design of an efficient binary offloading algorithm that minimizes system energy consumption (EC) for TDMA-based wireless-powered multi-access edge computing networks, where WDs either compute tasks locally or offload them to hybrid access points (H-APs). We formulate the EC minimization problem which is a non-convex problem and decompose it into a master problem optimizing binary offloading decision and a subproblem optimizing WPT duration and task offloading transmission durations. For the master problem, a DRL based method is applied to obtain the near-optimal offloading decision. For the subproblem, we firstly consider the scenario where the nodes do not have completion time constraints and obtain the optimal analytical solution. Then we consider the scenario with the constraints. By jointly using the Golden Section Method and bisection method, the optimal solution can be obtained due to the convexity of the constraint function. Simulation results show that the proposed offloading algorithm based on DRL can achieve the near-minimal EC.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2023EAP1035/_p
Copier
@ARTICLE{e106-a_12_1544,
author={Xi CHEN, Guodong JIANG, Kaikai CHI, Shubin ZHANG, Gang CHEN, Jiang LIU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Minimization of Energy Consumption in TDMA-Based Wireless-Powered Multi-Access Edge Computing Networks},
year={2023},
volume={E106-A},
number={12},
pages={1544-1554},
abstract={Many nodes in Internet of Things (IoT) rely on batteries for power. Additionally, the demand for executing compute-intensive and latency-sensitive tasks is increasing for IoT nodes. In some practical scenarios, the computation tasks of WDs have the non-separable characteristic, that is, binary offloading strategies should be used. In this paper, we focus on the design of an efficient binary offloading algorithm that minimizes system energy consumption (EC) for TDMA-based wireless-powered multi-access edge computing networks, where WDs either compute tasks locally or offload them to hybrid access points (H-APs). We formulate the EC minimization problem which is a non-convex problem and decompose it into a master problem optimizing binary offloading decision and a subproblem optimizing WPT duration and task offloading transmission durations. For the master problem, a DRL based method is applied to obtain the near-optimal offloading decision. For the subproblem, we firstly consider the scenario where the nodes do not have completion time constraints and obtain the optimal analytical solution. Then we consider the scenario with the constraints. By jointly using the Golden Section Method and bisection method, the optimal solution can be obtained due to the convexity of the constraint function. Simulation results show that the proposed offloading algorithm based on DRL can achieve the near-minimal EC.},
keywords={},
doi={10.1587/transfun.2023EAP1035},
ISSN={1745-1337},
month={December},}
Copier
TY - JOUR
TI - Minimization of Energy Consumption in TDMA-Based Wireless-Powered Multi-Access Edge Computing Networks
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1544
EP - 1554
AU - Xi CHEN
AU - Guodong JIANG
AU - Kaikai CHI
AU - Shubin ZHANG
AU - Gang CHEN
AU - Jiang LIU
PY - 2023
DO - 10.1587/transfun.2023EAP1035
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E106-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2023
AB - Many nodes in Internet of Things (IoT) rely on batteries for power. Additionally, the demand for executing compute-intensive and latency-sensitive tasks is increasing for IoT nodes. In some practical scenarios, the computation tasks of WDs have the non-separable characteristic, that is, binary offloading strategies should be used. In this paper, we focus on the design of an efficient binary offloading algorithm that minimizes system energy consumption (EC) for TDMA-based wireless-powered multi-access edge computing networks, where WDs either compute tasks locally or offload them to hybrid access points (H-APs). We formulate the EC minimization problem which is a non-convex problem and decompose it into a master problem optimizing binary offloading decision and a subproblem optimizing WPT duration and task offloading transmission durations. For the master problem, a DRL based method is applied to obtain the near-optimal offloading decision. For the subproblem, we firstly consider the scenario where the nodes do not have completion time constraints and obtain the optimal analytical solution. Then we consider the scenario with the constraints. By jointly using the Golden Section Method and bisection method, the optimal solution can be obtained due to the convexity of the constraint function. Simulation results show that the proposed offloading algorithm based on DRL can achieve the near-minimal EC.
ER -