论文成果

Optimal Task Assignment With Delay Constraint for Parked Vehicle Assisted Edge Computing: A Stackelberg Game Approach

发布时间:2021-06-24 点击次数:

DOI码:10.1109/LCOMM.2019.2961663

发表刊物:IEEE Communications Letters

摘要:Parked vehicle assisted edge computing is a paradigm to employ parked vehicles for processing workloads in vehicular networks. They collaborate with edge servers for joint task execution within task deadline and parking durations. We study task assignment problem with Stackelberg game, where the overall cost of a task publisher in terms of monetary cost and subjective dissatisfaction caused by un-offloaded workloads is minimized. To reach Stackelberg equilibrium, a dedicated algorithm is performed among players in a distributed manner for privacy preservation. Numerical results indicate that the cost is decreased about 25% in our scheme compared to that in existing work.

第一作者:J. Zhang, X. Huang, R. Yu

论文类型:期刊论文

卷号:24

期号:3

ISSN号:1558-2558

是否译文:

发表时间:2019-12-23

上一条:Federated Learning in Vehicular Edge Computing: A Selective Model Aggregation Approach下一条:Preemptive and Non Preemptive Switching Protocols for 5G Wireless Dynamic Network Architecture

广东工业大学网络信息与现代教育技术中心电话:020-39323866 版权所有@ 2020-2021保留所有权利
粤ICP备05008833号

访问量: | 最后更新时间:-- | 开通时间:-- | 手机版
Baidu
map