Strategy-proof mechanism based on dwarf mongoose optimization for task offloading in vehicle computing

IF 6.2 2区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS
Xi Liu , Jun Liu
{"title":"Strategy-proof mechanism based on dwarf mongoose optimization for task offloading in vehicle computing","authors":"Xi Liu ,&nbsp;Jun Liu","doi":"10.1016/j.future.2025.108027","DOIUrl":null,"url":null,"abstract":"<div><div>Along with intelligent vehicle (IV) development, IVCs can be used as mobile computing platforms to provide users with various services. The aim of this paper is to design an efficient task offloading mechanism to maximize group efficiency in vehicle computing. Considering that sensing data inherently support multi-user sharing, we introduce a resource-sharing model in which multiple users share sensing resources. To provide a scalable service, we propose auction-based dynamic pricing. To achieve a balance between quality and efficiency, the efficient task offloading mechanism proposed in this study is based on dwarf mongoose optimization. The initialization algorithm generates random, best-fit, and greedy allocations based on probability. Convergence characteristics are improved using a new scouting algorithm and a new babysitter algorithm, both of which also contribute to maintaining population diversity. We demonstrate that the proposed mechanism achieves strategy-proofness, group strategy-proofness, individual rationality, budget balance, and consumer sovereignty. The novelty consists in our showing how to design the strategy-proof mechanism based on swarm optimization. Furthermore, the approximate ratio of the proposed mechanism is analyzed. Experimental verifications are conducted to show the proposed mechanism shows good performance in different environments.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"174 ","pages":"Article 108027"},"PeriodicalIF":6.2000,"publicationDate":"2025-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Future Generation Computer Systems-The International Journal of Escience","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167739X2500322X","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Along with intelligent vehicle (IV) development, IVCs can be used as mobile computing platforms to provide users with various services. The aim of this paper is to design an efficient task offloading mechanism to maximize group efficiency in vehicle computing. Considering that sensing data inherently support multi-user sharing, we introduce a resource-sharing model in which multiple users share sensing resources. To provide a scalable service, we propose auction-based dynamic pricing. To achieve a balance between quality and efficiency, the efficient task offloading mechanism proposed in this study is based on dwarf mongoose optimization. The initialization algorithm generates random, best-fit, and greedy allocations based on probability. Convergence characteristics are improved using a new scouting algorithm and a new babysitter algorithm, both of which also contribute to maintaining population diversity. We demonstrate that the proposed mechanism achieves strategy-proofness, group strategy-proofness, individual rationality, budget balance, and consumer sovereignty. The novelty consists in our showing how to design the strategy-proof mechanism based on swarm optimization. Furthermore, the approximate ratio of the proposed mechanism is analyzed. Experimental verifications are conducted to show the proposed mechanism shows good performance in different environments.
基于矮猫鼬优化的车辆计算任务卸载防策略机制
随着智能汽车的发展,ivc可以作为移动计算平台,为用户提供各种服务。本文的目的是设计一种高效的任务卸载机制,以最大限度地提高车辆计算中的群体效率。考虑到传感数据本身支持多用户共享,提出了多用户共享传感资源的资源共享模型。为了提供可扩展的服务,我们提出了基于拍卖的动态定价。为实现质量与效率的平衡,本文提出的高效任务卸载机制基于矮猫鼬优化。初始化算法根据概率生成随机、最佳拟合和贪婪分配。采用一种新的侦察算法和一种新的保姆算法改进了收敛特性,这两种算法都有助于保持种群多样性。我们证明了所提出的机制实现了策略抗性、群体策略抗性、个人理性、预算平衡和消费者主权。新颖之处在于我们展示了如何设计基于群优化的防策略机制。进一步分析了所提机理的近似比值。实验验证了该机制在不同环境下的良好性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
19.90
自引率
2.70%
发文量
376
审稿时长
10.6 months
期刊介绍: Computing infrastructures and systems are constantly evolving, resulting in increasingly complex and collaborative scientific applications. To cope with these advancements, there is a growing need for collaborative tools that can effectively map, control, and execute these applications. Furthermore, with the explosion of Big Data, there is a requirement for innovative methods and infrastructures to collect, analyze, and derive meaningful insights from the vast amount of data generated. This necessitates the integration of computational and storage capabilities, databases, sensors, and human collaboration. Future Generation Computer Systems aims to pioneer advancements in distributed systems, collaborative environments, high-performance computing, and Big Data analytics. It strives to stay at the forefront of developments in grids, clouds, and the Internet of Things (IoT) to effectively address the challenges posed by these wide-area, fully distributed sensing and computing systems.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信