计算机科学
强化学习
Lyapunov优化
GSM演进的增强数据速率
李雅普诺夫函数
分布式计算
计算机网络
数学优化
人工智能
李雅普诺夫方程
李雅普诺夫指数
物理
数学
非线性系统
量子力学
混乱的
作者
Ziyi Teng,Juan Fang,Yaqi Liu
标识
DOI:10.1109/tnsm.2024.3361796
摘要
The problem of shared node selection and cache placement in wireless networks is challenging due to the difficulty of finding low-complexity optimal solutions. This paper proposes a new approach combining Lyapunov optimization and reinforcement learning (LoRL) to address content sharing in heterogeneous mobile edge computing (MEC) networks with base station (BS) and device-to-device (D2D) communication. Device in this network can choose to establish D2D links with neighboring devices for content sharing or send requests directly to the base station for content. Content access and energy consumption of shared nodes are modeled as a queuing system. The goal is to assign content sharing nodes to stabilize all queues while maximizing D2D sharing gain and minimizing latency, even in the presence of unknown network state distribution and user sharing costs. The proposed approach enables edge device to independently select associated nodes and make caching decisions, thereby minimizing time-averaged network costs and stabilizing the queuing system. Experimental results show that the proposed algorithm converges to the optimal policy and outperforms other policies in terms of total queue backlog trade-off and network cost.
科研通智能强力驱动
Strongly Powered by AbleSci AI