PhD Defence Notice - Jiayin ChenExport this event to calendar

Monday, May 17, 2021 — 10:00 AM EDT

Candidate: Jiayin Chen

Title: Multi-Dimensional Resource Orchestration in Vehicular Edge Networks

Date: May 17, 2021

Time: 10:00 AM


Supervisor(s): Shen, Sherman



In the era of autonomous vehicles, the advanced technologies of connected vehicle lead to the development of driving-related applications to meet the stringent safety requirements and the infotainment applications to improve passenger experience. Newly developed vehicular applications require high-volume data transmission, accurate sensing data collection, and reliable interaction, imposing substantial constrains on vehicular networks that solely rely on cellular networks to fetch data from the Internet and on-board processors to make driving decisions. To enhance multifarious vehicular applications, Heterogeneous Vehicular Networks (HVNets) have been proposed, in which edge nodes, including base stations and roadside units, can provide network connections, resulting in significantly reduced vehicular communication cost. In addition, caching servers are equipped at the edge nodes, to further alleviate the communication load for backhaul links and reduce data downloading delay. Hence, we aim to orchestrate the multi-dimensional resources, including communication, caching, and sensing resources, in the complex and dynamic vehicular environment to enhance vehicular edge network performance. The main technical issues are: 1) to accommodate the delivery services for both location-based and popular contents, the scheme of caching contents at edge servers should be devised, considering the cooperation of caching servers at different edge nodes, the mobility of vehicles, and the differential requirements of content downloading services; 2) to support the safety message exchange and collective perception services for vehicles, communication and sensing resources are jointly allocated, the decisions of which are coupled due to the resource sharing among different services and neighboring vehicles; and 3) for interaction-intensive service provisioning, e.g., trajectory design, the forwarding resources in core networks are allocated to achieve delay-sensitive packet transmissions between vehicles and management controllers, ensuring the high-quality interactivity. In this thesis, we design the multi-dimensional resource orchestration schemes in the edge assisted HVNets to address the three technical issues.


Firstly, we design a cooperative edge caching scheme to support various vehicular content downloading services, which allows vehicles to fetch one content from multiple caching servers cooperatively. In particular, we consider two types of vehicular content requests, i.e., location-based and popular contents, with different delay requirements. Both types of contents are encoded according to fountain code and cooperatively cached at multiple servers. The proposed scheme can be optimized by finding an optimal cooperative content placement that determines the placing locations and proportions for all contents. To this end, we analyze the upper bound proportion of content caching at a single server and provide the respective theoretical analysis of transmission delay and service cost (including content caching and transmission cost) for both types of contents. We then formulate an optimization problem of cooperative content placement to minimize the overall transmission delay and service cost. As the problem is a multi-objective multi-dimensional multi-choice knapsack one, which is proved to be NP-hard, we devise an ant colony optimization-based scheme to solve the problem and achieve a near-optimal solution. Simulation results are provided to validate the performance of the proposed scheme, including its convergence and optimality of caching, while guaranteeing low transmission delay and service cost.


Secondly, to support the vehicular safety message transmissions, we propose a joint resource slicing and scheduling (JRSS) framework. In particular, three types of safety messages are considered, i.e., the event-triggered message for urgent condition warning, the periodic message for vehicular status notification, and the message for environmental perception. Due to the packet relaying capability of edge nodes, messages can be transmitted through either vehicle-to-infrastructure (V2I) or vehicle-to-vehicle (V2V) connections. To satisfy the differential requirements of safety message transmissions, a JRSS framework is proposed, including an offline optimization stage and an online decision-making stage. In the offline optimization stage, based on the historical network information, a multi-dimensional resource allocation (MRA) scheme is devised to allocate sensing resources (i.e., choosing vehicles to provide perception data) and communication resources (i.e., determining the V2I/V2V transmission mode and allocating the required resource blocks for vehicles) simultaneously. For the online resource allocation stage, a learning-based resource slicing module is trained offline based on the results achieved by the MRA scheme. Then, the slicing module splits the resources for each message transmission service according to real-time requests, which facilitates the resource scheduling process that allocates resources to each vehicle. Extensive simulation results are provided to demonstrate the effectiveness of the proposed JRSS framework in terms of the high reliability and low latency for message transmission and the high quality of collective perception service.


Thirdly, we investigate forwarding resource sharing scheme to support interaction intensive services in HVNets, especially for the delay-sensitive packet transmission between vehicles and management controllers. A learning-based proactive resource sharing scheme is proposed for core communication networks, where the available forwarding resources at a switch are proactively allocated to the traffic flows in order to maximize the efficiency of resource utilization with delay satisfaction. The resource sharing scheme consists of two joint modules: estimation of resource demands and allocation of available resources. For service provisioning, resource demand of each traffic flow is estimated based on the predicted packet arrival rate. Considering the distinct features of each traffic flow, a linear regression scheme is developed for resource demand estimation, utilizing the mapping relation between traffic flow status and required resources, upon which a network switch makes decision on allocating available resources for delay satisfaction and efficient resource utilization. To learn the implicit relation between the allocated resources and delay, a multi-armed bandit learning-based resource sharing scheme is proposed, which enables fast resource sharing adjustment to traffic arrival dynamics. The proposed scheme is proved to be asymptotically approaching the optimal strategy, with polynomial time complexity. Extensive simulation results are presented to demonstrate the effectiveness of the proposed resource sharing scheme in terms of delay satisfaction, traffic adaptiveness, and resource sharing gain.


In summary, we have investigated the cooperative caching placement for content downloading services, joint communication and sensing resource allocation for safety message transmissions, and forwarding resource sharing scheme in core networks for interaction intensive services. The schemes developed in the thesis should provide practical and efficient solutions to manage the multi-dimensional resources in vehicular networks.



  1. 2021 (104)
    1. December (3)
    2. November (4)
    3. October (5)
    4. September (4)
    5. August (12)
    6. July (4)
    7. June (5)
    8. May (10)
    9. April (25)
    10. March (14)
    11. February (10)
    12. January (9)
  2. 2020 (248)
    1. December (20)
    2. November (20)
    3. October (16)
    4. September (15)
    5. August (16)
    6. July (32)
    7. June (29)
    8. May (32)
    9. April (27)
    10. March (13)
    11. February (20)
    12. January (16)
  3. 2019 (282)
  4. 2018 (150)
  5. 2017 (212)
  6. 2016 (242)
  7. 2015 (242)
  8. 2014 (268)
  9. 2013 (190)
  10. 2012 (31)