Shuaifei Duanmu

Shuaifei Duanmu

Auto-generated profile, based on publicly available information

Shuaifei Duanmu

School of Software Engineering in Faculty of Information Technology, Beijing University of Technology, Beijing, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 September 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
BJBi Jing
Bi Jing
HYHaitao Yuan
Haitao Yuan
SDShuaifei Duanmu
Shuaifei Duanmu
Mengchu ZhouMengchu Zhou
Mengchu Zhou
AAAbdullah Abusorrah
Abdullah Abusorrah
Smart mobile devices (SMDs) can meet users’ high expectations by executing computational intensive applications but they only have limited resources including CPU, memory, battery power and wireless medium. To tackle this limitation, partial computation offloading can be used as a promising method to schedule some tasks of applications from resource-limited SMDs to high-performance edge servers. However, it brings communication overhead issues caused by limited bandwidth, and inevitably increases latency of tasks offloaded to edge servers. Therefore, it is highly challenging to achieve the balance between high-resource consumption in SMDs and high communication cost for providing energy-efficient and latency-low services to users. This work proposes a partial computation offloading method to minimize the total energy consumed by SMDs and edge servers by jointly optimizing offloading ratio of tasks, CPU speeds of SMDs, allocated bandwidth of available channels and transmission power of each SMD in each time slot. It jointly considers execution time of tasks performed in SMDs and edge servers, and transmission time of data. It also jointly considers latency limits, CPU speeds, transmission power limits, available energy of SMDs, and maximum number of CPU cycles and memories in edge servers. Considering these factors, a nonlinear constrained optimization problem is formulated and solved by a novel hybrid meta-heuristic algorithm named Genetic Simulated-annealing-based Particle swarm optimization (GSP) to produce a close-to-optimal solution. GSP achieves joint optimization of computation offloading between a cloud data center and the edge, and resource allocation in the data center. Real-life data-based experimental results prove that it achieves lower energy consumption in less convergence time than its three typical peers.