Energy-based Proportional Fairness for Task Offloading and Resource Allocation in Edge Computing
- Publisher:
- IEEE
- Publication Type:
- Conference Proceeding
- Citation:
- ICC 2022 - IEEE International Conference on Communications, 2022, 2022-May, pp. 1912-1917
- Issue Date:
- 2022-01-01
Embargoed
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| Energy-based Proportional Fairness for Task Offloading and Resource Allocation in Edge Computing.pdf | Accepted version | 574.24 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is currently unavailable due to the publisher's embargo.
By executing offloaded tasks from mobile users, edge computing augments mobile devices with computing/communications resources from edge nodes (ENs), enabling new services/applications (e.g., real-time gaming, virtual/augmented reality). However, despite being more resourceful than mobile devices, allocating ENs’ computing/communications resources to given favorable sets of users may block other devices from their service. This is often the case for most existing task offloading and resource allocation approaches that only aim to maximize the network social welfare (e.g., minimizing the total energy consumption) but not consider the computing/battery status of each mobile device. This work develops a proportional fair task offloading and resource allocation framework for a multi-layer cooperative edge computing network to serve all user equipment (UEs) while considering both their service requirements and individual energy/battery levels. The resulting optimization involves both binary (offloading decisions) and real variables (resource allocations), making it NP-hard. To tackle it, we leverage the fact that the relaxed problem is convex and propose a distributed algorithm, namely the dynamic branchand-bound Benders decomposition (DBBD). DBBD decomposes the original problem into a master problem (MP) for the offloading decision and subproblems (SPs) for resource allocation. The SPs can either find their closed-form solutions or be solved in parallel at ENs, thus help reduce the complexity. The numerical results show that the DBBD returns the optimal solution of the problem maximizing the fairness between UEs. The DBBD has higher fairness indexes, i.e., Jain’s index and min-max ratio, in comparing with the existing ones that minimize the total consumed energy.
Please use this identifier to cite or link to this item: