XLXin Long

Xin Long

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Xin Long has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Dependency-Aware Computation Offloading for Mobile Edge Computing With Edge-Cloud Cooperation

    by Long Chen, Jigang Wu, Jun Zhang, Hong-Ning Dai, Xin Long, Mianyang Yao

    Most of existing mobile edge computing (MEC) studies consider the remote cloud server as a special edge server, the opportunity of edge-cloud collaboration has not been well exploited. We propose a dependency-aware offloading scheme in MEC with edge-cloud cooperation under task dependency constraints. Each mobile device has a limited budget and has to determine which sub-task should be computed locally or should be sent to the edge or remote cloud. We formulate two NP-hard task finishing time minimization sub-problems. We then devise one greedy algorithm with approximation ratio of ${1+\epsilon}$ for the first mode with edge-cloud cooperation without edge-edge cooperation. Then we design an efficient greedy algorithm for the second mode, considering both edge-cloud and edge-edge cooperations. Extensive simulation results show that for the first mode, the proposed greedy algorithm achieves near optimal performance for typical task topologies. On average, it outperforms the modified Hermes benchmark algorithm by about 23%~43.6% in terms of application finishing time with given budgets. By further exploiting collaborations among edge servers in the second cooperation mode, the proposed algorithm helps to achieve over 20.3% average performance gain on the application finishing time over the first mode under various scenarios. Real-world experiments comply with simulation results.


  • Open Access

    Energy-Efficient Offloading in Mobile Edge Computing with Edge-Cloud Collaboration

    by Xin Long, Jigang Wu, Long Chen

    Multiple access mobile edge computing is an emerging technique to bring computation resources close to end mobile users. By deploying edge servers at WiFi access points or cellular base stations, the computation capabilities of mobile users can be extended. Existing works mostly assume the remote cloud server can be viewed as a special edge server or the edge servers are willing to cooperate, which is not practical. In this work, we propose an edge-cloud cooperative architecture where edge servers can rent for the remote cloud servers to expedite the computation of tasks from mobile users. With this architecture, the computation offloading problem is modeled as a mixed integer programming with delay constraints, which is NP-hard. The objective is to minimize the total energy consumption of mobile devices. We propose a greedy algorithm as well as a simulated annealing algorithm to effectively solve the problem. Extensive simulation results demonstrate that, the proposed greedy algorithm and simulated annealing algorithm can achieve the near optimal performance. On average, the proposed greedy algorithm can achieve the same application completing time budget performance of the Brute Force optional algorithm with only 31\% extra energy cost. The simulated annealing algorithm can achieve similar performance with the greedy algorithm.

  • Open Access

    ENGINE:Cost Effective Offloading in Mobile Edge Computing with Fog-Cloud Cooperation

    by Long Chen, Jigang Wu, Xin Long, Zikai Zhang

    Mobile Edge Computing (MEC) as an emerging paradigm utilizing cloudlet or fog nodes to extend remote cloud computing to the edge of the network, is foreseen as a key technology towards next generation wireless networks. By offloading computation intensive tasks from resource constrained mobile devices to fog nodes or the remote cloud, the energy of mobile devices can be saved and the computation capability can be enhanced. For fog nodes, they can rent the resource rich remote cloud to help them process incoming tasks from mobile devices. In this architecture, the benefit of short computation and computation delay of mobile devices can be fully exploited. However, existing studies mostly assume fog nodes possess unlimited computing capacity, which is not practical, especially when fog nodes are also energy constrained mobile devices. To provide incentive of fog nodes and reduce the computation cost of mobile devices, we provide a cost effective offloading scheme in mobile edge computing with the cooperation between fog nodes and the remote cloud with task dependency constraint. The mobile devices have limited budget and have to determine which task should be computed locally or sent to the fog. To address this issue, we first formulate the offloading problem as a task finish time inimization problem with given budgets of mobile devices, which is NP-hard. We then devise two more algorithms to study the network performance. Simulation results show that the proposed greedy algorithm can achieve the near optimal performance. On average, the Brute Force method and the greedy algorithm outperform the simulated annealing algorithm by about 28.13% on the application finish time.