• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

¿µ¹® ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ¿µ¹® ³í¹®Áö > TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) Hierarchical Resource Management Framework and Multi-hop Task Scheduling Decision for ResourceConstrained VEC Networks
¿µ¹®Á¦¸ñ(English Title) Hierarchical Resource Management Framework and Multi-hop Task Scheduling Decision for ResourceConstrained VEC Networks
ÀúÀÚ(Author) Xi Hu   Yicheng Zhao   Yang Huang   Chen Zhu   Jun Yao   Nana Fang  
¿ø¹®¼ö·Ïó(Citation) VOL 16 NO. 11 PP. 3638 ~ 3657 (2022. 11)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English 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.
Å°¿öµå(Keyword) Vehicular Edge Computing (VEC)   Multi-hop task scheduling   Resource management framework   Auction   Greedy matching  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå