Hierarchical Resource Management Framework and Multi-hop Task Scheduling Decision for Resource-Constrained VEC Networks

• Xi Hu,
• Yicheng Zhao,
• Yang Huang,
• Chen Zhu,
• Jun Yao,
• Nana Fang,

Vol. 16, No. 11, November 30, 2022
10.3837/tiis.2022.11.010, Download Paper (Free):

• vehicular edge computing (VEC)
• Multi-hop task scheduling
• Resource management framework
• Auction
• Greedy matching

Abstract

In urban vehicular edge computing (VEC) environments, one edge server always serves many task requests in its coverage which results in the resource-constrained problem. To resolve the problem and improve system utilization, we first design a general hierarchical resource management framework based on typical VEC network structures. Following the framework, a specific interacting protocol is also designed for our decision algorithm. Secondly, a greedy bidding-based multi-hop task scheduling decision algorithm is proposed to realize effective task scheduling in resource-constrained VEC environments. In this algorithm, the goal of maximizing system utility is modeled as an optimization problem with the constraints of task deadlines and available computing resources. Then, an auction mechanism named greedy bidding is used to match task requests to edge servers in the case of multiple hops to maximize the system utility. Simulation results show that our proposal can maximize the number of tasks served in resource constrained VEC networks and improve the system utility.

Statistics

Cite this article