检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:白朦梦 朱锐 郭建新 BAI Mengmeng;ZHU Rui;GUO Jianxin(School of Electronic Information,Xijing University,Xi’an 710123,China)
出 处:《无线电工程》2023年第8期1853-1861,共9页Radio Engineering
基 金:陕西省重点研究计划(2022GY-118);西安市创新能力与基础学科建设项目(2021 JH-06-0069)。
摘 要:近年来随着互联网技术与应用的快速发展,互联网用户、无线终端设备急剧增多,对于能源的消耗也在不断增加。如何在保证通信业务质量的前提下,降低能量消耗成为了亟待解决的问题。对此,研究了能源效率(Energy-Efficiency,EE)与延迟容忍(Delay Tolerable,DT)服务时延之间的关系。针对离散信道运用了动态统计规划(Statistical Dynamic Programming,SDP)的方法。针对连续信道引入了近似动态统计规划(Approximate Statistical Dynamic Programming,ASDP)的方法。针对没有任何先验信息的情况引入了Q-Learning算法。仿真结果显示,在离散信道中,DT服务可以有效降低传输信息的能耗;但是在连续信道中,DT服务在信道状态较好的条件下并不会明显提升EE。通过仿真结果发现,对于连续信道状态采用Q-Learning算法可以很好地实现传输功率的调整,实现EE的提高。In recent years,with the rapid development of Internet technology and application,Internet users and wireless terminal equipment are increasing rapidly and energy consumption is also increasing.How to reduce energy consumption on the premise of ensuring communication service quality has become an urgent problem to be solved.The relationship between Energy-Efficiency(EE)and Delay Tolerance(DT)services is studied.Firstly,Statistical Dynamic Programming(SDP)is used for discrete channels.Secondly,Approximate Statistical Dynamic Programming(ASDP)is introduced for continuous channel.Thirdly,the Q-Learning algorithm is introduced in the case of no prior information.The simulation results show that DT service can effectively reduce the energy consumption of information transmission in discrete channels.But in continuous channel,DT service does not significantly improve EE under the condition of good channel status.The simulation results show that Q-Learning algorithm can be used to adjust the transmission power and improve EE.
关 键 词:功率分配 无线通信节能策略 延迟容忍服务 动态统计规划 近似动态统计规划 Q-LEARNING
分 类 号:TP273.1[自动化与计算机技术—检测技术与自动化装置]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.161