检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:邹虹[1,2,3] 卓赛 张鸿 张明兴[1,2,3] 吴大鹏 ZOU Hong;ZHUO Sai;ZHANG Hong;ZHANG Mingxing;WU Dapeng(School of Communications and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China;Advanced Network and Intelligent Connection Technology Key Laboratory of Chongqing Education Commission of China,Chongqing 400065,China;Chongqing Key Laboratory of Ubiquitous Sensing and Networking,Chongqing 400065,China)
机构地区:[1]重庆邮电大学通信与信息工程学院,重庆400065 [2]先进网络与智能互联技术重庆市高校重点实验室,重庆400065 [3]泛在感知与互联重庆市重点实验室,重庆400065
出 处:《电信科学》2024年第3期29-38,共10页Telecommunications Science
基 金:国家自然科学基金资助项目(No.62271096,No.U20A20157);重庆市教委科学技术研究项目(No.KJQN202000626);重庆市高校创新研究群体项目(No.CXQT20017);重邮信通青创团队支持计划项目(No.SCIE-QN-2022-04);重庆市博士后研究项目特别资助项目(No.2021XM3058);重庆市自然科学基金创新发展联合基金资助项目(No.CSTB2023NSCQ-LZX0134)。
摘 要:工业物联网中任务的生成通常具有连续性和周期性,并且任务对时延要求很高,这给系统成本带来了挑战。为应对这一挑战,提出了一种基于任务紧急程度的成本最小化资源分配算法。通过遗传算法优化任务的卸载策略和系统的资源分配策略,对于卸载的任务,根据任务的紧急程度进行调度,并在满足时延要求的前提下计算任务的最优发射功率。仿真结果表明,所提算法有效改善了系统总能耗成本。In the industrial Internet of things,the generation of tasks is observed to exhibit both continuity and period‐icity,along with stringent latency requirements.These characteristics posed challenges to system’s cost-efficiency.To address these challenges,a cost minimization resource allocation algorithm based on the urgency of tasks was pro‐posed.By employing a genetic algorithm,the task offloading strategy and the system’s resource allocation strategy were optimized.For offloaded tasks,they were scheduled according to their level of urgency.Additionally,the opti‐mal transmission power for each task was calculated to meet latency constraints.Simulation results indicate that the proposed algorithm effectively reduces the overall energy cost of the system.
分 类 号:TN929[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.6.159