增强计算和通信能力的超图匹配 D2D 卸载方案

IF 4.4 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Pan Zhao , Liuyuan Chen , Zhiliang Jiang , Datong Xu , Jianli Yang , Mingyang Cui , Tianfei Chen
{"title":"增强计算和通信能力的超图匹配 D2D 卸载方案","authors":"Pan Zhao ,&nbsp;Liuyuan Chen ,&nbsp;Zhiliang Jiang ,&nbsp;Datong Xu ,&nbsp;Jianli Yang ,&nbsp;Mingyang Cui ,&nbsp;Tianfei Chen","doi":"10.1016/j.adhoc.2024.103526","DOIUrl":null,"url":null,"abstract":"<div><p>As the Internet of Things(IoT) and its intelligent applications continue to proliferate, forthcoming 6G networks will confront the dual challenge of heightened communication and computing capacity demands. To address this, D2D collaborative computing is being explored. However, the current D2D collaborative computing ignores the integrity of computing and communication. For a single-task device, offloading operations intertwine computing and communication, internal coupling causes due to parallel executed between local and D2D offloading. In addition, external coupling arises among devices competing for limited radio and computing resources. Worse, internal coupling and external coupling interact, exacerbating the situation. To address these challenges, a novel D2D offloading framework is proposed based on hyper-graph matching in this paper. Our goal is to minimize both delay and energy costs while ensuring service quality for all users by jointly optimizing task scheduling, offload policies and resource allocation. The original problem is formulated as a nonlinear integer programming problem. Then, by three-stage strategy optimization decomposition, it is separated into several sub-problems. In the first stage, a polynomial-time algorithm has been developed to optimize the task offloading ratio, taking into account both its upper and lower bounds. In the second stage, a geometric programming algorithm has been created to address power allocation. In the third stage, a three-dimensional hyper-graph matching model is employed to derive the optimal offloading and channel allocation policies. This is based on analyzing the conflict graph and applying the claw theorem. Simulation results demonstrate that the proposed scheme outperforms other algorithms by approximately 12%, 20%, 28%, 40%, respectively. Moreover, it enhances both spectral efficiency and computational efficiency.</p></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4000,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1570870524001379/pdfft?md5=14b146ffd1942df62525be5b45777af4&pid=1-s2.0-S1570870524001379-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Hyper-graph matching D2D offloading scheme for enhanced computation and communication capacity\",\"authors\":\"Pan Zhao ,&nbsp;Liuyuan Chen ,&nbsp;Zhiliang Jiang ,&nbsp;Datong Xu ,&nbsp;Jianli Yang ,&nbsp;Mingyang Cui ,&nbsp;Tianfei Chen\",\"doi\":\"10.1016/j.adhoc.2024.103526\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>As the Internet of Things(IoT) and its intelligent applications continue to proliferate, forthcoming 6G networks will confront the dual challenge of heightened communication and computing capacity demands. To address this, D2D collaborative computing is being explored. However, the current D2D collaborative computing ignores the integrity of computing and communication. For a single-task device, offloading operations intertwine computing and communication, internal coupling causes due to parallel executed between local and D2D offloading. In addition, external coupling arises among devices competing for limited radio and computing resources. Worse, internal coupling and external coupling interact, exacerbating the situation. To address these challenges, a novel D2D offloading framework is proposed based on hyper-graph matching in this paper. Our goal is to minimize both delay and energy costs while ensuring service quality for all users by jointly optimizing task scheduling, offload policies and resource allocation. The original problem is formulated as a nonlinear integer programming problem. Then, by three-stage strategy optimization decomposition, it is separated into several sub-problems. In the first stage, a polynomial-time algorithm has been developed to optimize the task offloading ratio, taking into account both its upper and lower bounds. In the second stage, a geometric programming algorithm has been created to address power allocation. In the third stage, a three-dimensional hyper-graph matching model is employed to derive the optimal offloading and channel allocation policies. This is based on analyzing the conflict graph and applying the claw theorem. Simulation results demonstrate that the proposed scheme outperforms other algorithms by approximately 12%, 20%, 28%, 40%, respectively. Moreover, it enhances both spectral efficiency and computational efficiency.</p></div>\",\"PeriodicalId\":55555,\"journal\":{\"name\":\"Ad Hoc Networks\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2024-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S1570870524001379/pdfft?md5=14b146ffd1942df62525be5b45777af4&pid=1-s2.0-S1570870524001379-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ad Hoc Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1570870524001379\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ad Hoc Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1570870524001379","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

随着物联网(IoT)及其智能应用的不断普及,即将到来的 6G 网络将面临通信和计算能力需求增加的双重挑战。为此,人们正在探索 D2D 协同计算。然而,目前的 D2D 协同计算忽略了计算和通信的完整性。对于单任务设备而言,卸载操作将计算和通信交织在一起,本地卸载和 D2D 卸载之间的并行执行会导致内部耦合。此外,外部耦合会在争夺有限无线电和计算资源的设备之间产生。更糟糕的是,内部耦合和外部耦合相互影响,加剧了这种情况。为了应对这些挑战,本文提出了一种基于超图匹配的新型 D2D 卸载框架。我们的目标是通过联合优化任务调度、卸载策略和资源分配,最大限度地降低延迟和能源成本,同时确保所有用户的服务质量。最初的问题被表述为一个非线性整数编程问题。然后,通过三阶段策略优化分解,将其分为几个子问题。在第一阶段,考虑到任务卸载率的上下限,开发了一种多项式时间算法来优化任务卸载率。在第二阶段,创建了一种几何编程算法来解决功率分配问题。在第三阶段,采用三维超图匹配模型得出最佳卸载和信道分配策略。这是基于对冲突图的分析和爪式定理的应用。仿真结果表明,所提出的方案分别比其他算法优胜约 12%、20%、28% 和 40%。此外,它还提高了频谱效率和计算效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hyper-graph matching D2D offloading scheme for enhanced computation and communication capacity

As the Internet of Things(IoT) and its intelligent applications continue to proliferate, forthcoming 6G networks will confront the dual challenge of heightened communication and computing capacity demands. To address this, D2D collaborative computing is being explored. However, the current D2D collaborative computing ignores the integrity of computing and communication. For a single-task device, offloading operations intertwine computing and communication, internal coupling causes due to parallel executed between local and D2D offloading. In addition, external coupling arises among devices competing for limited radio and computing resources. Worse, internal coupling and external coupling interact, exacerbating the situation. To address these challenges, a novel D2D offloading framework is proposed based on hyper-graph matching in this paper. Our goal is to minimize both delay and energy costs while ensuring service quality for all users by jointly optimizing task scheduling, offload policies and resource allocation. The original problem is formulated as a nonlinear integer programming problem. Then, by three-stage strategy optimization decomposition, it is separated into several sub-problems. In the first stage, a polynomial-time algorithm has been developed to optimize the task offloading ratio, taking into account both its upper and lower bounds. In the second stage, a geometric programming algorithm has been created to address power allocation. In the third stage, a three-dimensional hyper-graph matching model is employed to derive the optimal offloading and channel allocation policies. This is based on analyzing the conflict graph and applying the claw theorem. Simulation results demonstrate that the proposed scheme outperforms other algorithms by approximately 12%, 20%, 28%, 40%, respectively. Moreover, it enhances both spectral efficiency and computational efficiency.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Ad Hoc Networks
Ad Hoc Networks 工程技术-电信学
CiteScore
10.20
自引率
4.20%
发文量
131
审稿时长
4.8 months
期刊介绍: The Ad Hoc Networks is an international and archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in ad hoc and sensor networking areas. The Ad Hoc Networks considers original, high quality and unpublished contributions addressing all aspects of ad hoc and sensor networks. Specific areas of interest include, but are not limited to: Mobile and Wireless Ad Hoc Networks Sensor Networks Wireless Local and Personal Area Networks Home Networks Ad Hoc Networks of Autonomous Intelligent Systems Novel Architectures for Ad Hoc and Sensor Networks Self-organizing Network Architectures and Protocols Transport Layer Protocols Routing protocols (unicast, multicast, geocast, etc.) Media Access Control Techniques Error Control Schemes Power-Aware, Low-Power and Energy-Efficient Designs Synchronization and Scheduling Issues Mobility Management Mobility-Tolerant Communication Protocols Location Tracking and Location-based Services Resource and Information Management Security and Fault-Tolerance Issues Hardware and Software Platforms, Systems, and Testbeds Experimental and Prototype Results Quality-of-Service Issues Cross-Layer Interactions Scalability Issues Performance Analysis and Simulation of Protocols.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信