A Double Auction Mechanism for Resource Allocation in Coded Vehicular Edge Computing
Lists
Only you see this
Abstract
The development of smart vehicles and rich cloud services have led to the emergence of vehicular edge computing. To perform the distributed computation tasks efficiently, Coded Distributed Computing (CDC) was proposed to reduce communication costs and mitigate the straggler effects through the use of coding techniques. In this paper, we propose a double auction mechanism to allocate the resources of the edge servers to the vehicles in order to complete the CDC tasks. Specifically, the vehicles use the PolyDot codes to manage the tradeoff between communication costs and recovery threshold. Given the requirements of various vehicles, the double auction mechanism matches the edge servers with the required resources to the vehicles. Besides, the double auction mechanism also determines the prices that the vehicles need to pay for the resources of the edge servers. The analyses show that the double auction mechanism satisfies the properties of individual rationality, incentive compatibility and budget-balance. From the simulation, the utility of auctioneer increases when the number of vehicles and edge servers increases.
BibTeX
@article{ng2022double,
author = {Jer Shyuan Ng and Wei Yang Bryan Lim and Zehui Xiong and Dusit Niyato and Cyril Leung and Chunyan Miao},
title = {{A Double Auction Mechanism for Resource Allocation in Coded Vehicular Edge Computing}},
journal = {IEEE Trans. Vehicular Technology},
year = {2022},
doi = {10.1109/tvt.2021.3131395},
}Loading related content...