A double auction mechanism for resource allocation in coded vehicular edge computing
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 o...
| Main Authors: | , , , , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/163785 |
| _version_ | 1811680870912753664 |
|---|---|
| author | Ng, Jer Shyuan Lim, Bryan Wei Yang Xiong, Zehui Niyato, Dusit Leung, Cyril Miao, Chunyan |
| author2 | School of Computer Science and Engineering |
| author_facet | School of Computer Science and Engineering Ng, Jer Shyuan Lim, Bryan Wei Yang Xiong, Zehui Niyato, Dusit Leung, Cyril Miao, Chunyan |
| author_sort | Ng, Jer Shyuan |
| collection | NTU |
| description | 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. |
| first_indexed | 2024-10-01T03:31:56Z |
| format | Journal Article |
| id | ntu-10356/163785 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T03:31:56Z |
| publishDate | 2022 |
| record_format | dspace |
| spelling | ntu-10356/1637852022-12-16T08:24:37Z A double auction mechanism for resource allocation in coded vehicular edge computing Ng, Jer Shyuan Lim, Bryan Wei Yang Xiong, Zehui Niyato, Dusit Leung, Cyril Miao, Chunyan School of Computer Science and Engineering Alibaba-NTU Joint Research Institute Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly (LILY) Engineering::Computer science and engineering Servers Task Analysis 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. Ministry of Education (MOE) National Research Foundation (NRF) This work was supported in part by the Programme DesCartes, in part by the National Research Foundation, Prime Minister’s Office, Singapore, under its Campus for Research Excellence and Technological Enterprise Programme, in part by Alibaba Group through Alibaba Innovative Research Program and Alibaba-NTU Singapore Joint Research Institute, in part by the National Research Foundation, Singapore, under the AI Singapore Programme under Grant AISG2-RP-2020-019, in part by WASP/NTU under Grant M4082187 (4080), in part by the Singapore Ministry of Education under Grant Tier 1 (RG16/20), in part by the SUTD SRG-ISTD-2021-165, and in part by the SUTD-ZJU IDEA under Grant (SUTD-ZJU (VP) 202102). 2022-12-16T08:24:37Z 2022-12-16T08:24:37Z 2021 Journal Article Ng, J. S., Lim, B. W. Y., Xiong, Z., Niyato, D., Leung, C. & Miao, C. (2021). A double auction mechanism for resource allocation in coded vehicular edge computing. IEEE Transactions On Vehicular Technology, 71(2), 1832-1845. https://dx.doi.org/10.1109/TVT.2021.3131395 0018-9545 https://hdl.handle.net/10356/163785 10.1109/TVT.2021.3131395 2-s2.0-85120577684 2 71 1832 1845 en AISG2-RP-2020-019 M4082187 (4080) RG16/20 SRG-ISTD-2021-165 SUTD-ZJU (VP) 202102 IEEE Transactions on Vehicular Technology © 2021 IEEE. All rights reserved. |
| spellingShingle | Engineering::Computer science and engineering Servers Task Analysis Ng, Jer Shyuan Lim, Bryan Wei Yang Xiong, Zehui Niyato, Dusit Leung, Cyril Miao, Chunyan A double auction mechanism for resource allocation in coded vehicular edge computing |
| title | A double auction mechanism for resource allocation in coded vehicular edge computing |
| title_full | A double auction mechanism for resource allocation in coded vehicular edge computing |
| title_fullStr | A double auction mechanism for resource allocation in coded vehicular edge computing |
| title_full_unstemmed | A double auction mechanism for resource allocation in coded vehicular edge computing |
| title_short | A double auction mechanism for resource allocation in coded vehicular edge computing |
| title_sort | double auction mechanism for resource allocation in coded vehicular edge computing |
| topic | Engineering::Computer science and engineering Servers Task Analysis |
| url | https://hdl.handle.net/10356/163785 |
| work_keys_str_mv | AT ngjershyuan adoubleauctionmechanismforresourceallocationincodedvehicularedgecomputing AT limbryanweiyang adoubleauctionmechanismforresourceallocationincodedvehicularedgecomputing AT xiongzehui adoubleauctionmechanismforresourceallocationincodedvehicularedgecomputing AT niyatodusit adoubleauctionmechanismforresourceallocationincodedvehicularedgecomputing AT leungcyril adoubleauctionmechanismforresourceallocationincodedvehicularedgecomputing AT miaochunyan adoubleauctionmechanismforresourceallocationincodedvehicularedgecomputing AT ngjershyuan doubleauctionmechanismforresourceallocationincodedvehicularedgecomputing AT limbryanweiyang doubleauctionmechanismforresourceallocationincodedvehicularedgecomputing AT xiongzehui doubleauctionmechanismforresourceallocationincodedvehicularedgecomputing AT niyatodusit doubleauctionmechanismforresourceallocationincodedvehicularedgecomputing AT leungcyril doubleauctionmechanismforresourceallocationincodedvehicularedgecomputing AT miaochunyan doubleauctionmechanismforresourceallocationincodedvehicularedgecomputing |