Long CHEN

Dr. Long CHEN

orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
11 November 2020 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
LCLong CHEN
Long CHEN
JWJigang Wu
Jigang Wu
JZJun Zhang
Jun Zhang
Hong-Ning DaiHong-Ning Dai
Hong-Ning Dai
XLXin Long
Xin Long
MYMianyang Yao
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.

25 March 2021 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
JLJiaxing Li
Jiaxing Li
JWJigang Wu
Jigang Wu
LCLong CHEN
Long CHEN
JLJin Li
Jin Li
SLSiew Kei Lam
Siew Kei Lam
Mobile edge computing (MEC) is a promising edge technology to provide high bandwidth and low latency shared services and resources to mobile users. However, the MEC infrastructure raises major security concerns when the shared resources involve sensitive and private data of users. This paper proposes a novel blockchain-based key management scheme for MEC that is essential for ensuring secure group communication among the mobile devices as they dynamically move from one subnetwork to another. In the proposed scheme, when a mobile device joins a subnetwork, it first generates lightweight key pairs for digital signature and communication, and broadcasts its public key to neighbouring peer users in the subnetwork blockchain. The blockchain miner in the subnetwork packs all the public key of mobile devices into a block that will be sent to other users in the subnetwork. This enables the mobile device to communicate with its peers in the subnetwork by encrypting the data with the public key stored in the blockchain. When the mobile device moves to another subnetwork in the tree network, all the mobile devices of the new subnetwork can quickly verify its identity by checking its record in the local or higher hierarchy subnetwork blockchain. Furthermore, when the mobile device leaves the subnetwork, it does not need to do anything and its records will remain in the blockchain which is an append-only database. Theoretical security analysis shows that the proposed scheme can defend against the 51 percent attack and malicious entities in the blockchain network utilizing Proof-of-Work consensus mechanism. Moreover, the backward and forward secrecy is also preserved. Experimental results demonstrate that the proposed scheme outperforms two baselines in terms of computation, communication and storage.

8 September 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
YWYalan Wu
Yalan Wu
JWJigang Wu
Jigang Wu
LCLong CHEN
Long CHEN
JYJiaquan Yan
Jiaquan Yan
YHYinhe Han
Yinhe Han
Load balance in vehicular ad hoc networks (VANETs) is a challenge in vehicle-to-vehicle computation offloading, due to stochastic requests of users, heterogeneous service capabilities and high mobility of vehicles, etc. This paper aims to fill this gap by formulating a problem for load balance in a VANET, with the objective of minimizing the maximum load under transmit power, storage capacity, per task completion time and energy consumption constraints. The formulated problem is proved to be NP-hard, then it is investigated by decomposing it into two subproblems, i.e., how to offload tasks for the case of fixed transmit power and how to adjust transmit power for the given offloading decision. For the first subproblem, an approximation algorithm is proposed by offloading the tasks in the vehicle with the maximum load to the vehicle with minimum load. Meanwhile, a deep reinforcement learning algorithm is proposed, in order to focus on the network dynamics. A coalition based algorithm, a distributed coalition based algorithm, as well as an incentive algorithm based on deep reinforcement learning, are proposed to maximize the total payoff for the selfishness of vehicles. For the second subproblem, an adjustment strategy for transmit power is customized to further reduce the computing load. The algorithms are evaluated on an integrated simulation platform with open street map, SUMO, NS-3 and dataset of Google cluster-usage traces. Simulation results show that, the proposed algorithms outperform three state-of-the-art works for most cases, in terms of the maximum load. The proposed distributed algorithm can significantly accelerate the proposed centralized algorithm with acceptable increase in maximum load. Besides, the load can be further reduced by the proposed adjustment strategy.

16 May 2018 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
LCLong CHEN
Long CHEN
JWJigang Wu
Jigang Wu
GZGangqiang Zhou
Gangqiang Zhou
LMLongjie Ma
Longjie Ma

1 May 2017
Verified
Conference Paper
Closed access
LMLongjie Ma
Longjie Ma
JWJigang Wu
Jigang Wu
LCLong CHEN
Long CHEN
In the large-scale Wireless Metropolitan Area Network (WMAN) consisting of many wireless Access Points (APs),choosing the appropriate position to place cloudlet is very important for reducing the user's access delay. For service provider, it isalways very costly to deployment cloudlets. How many cloudletsshould be placed in a WMAN and how much resource eachcloudlet should have is very important for the service provider. In this paper, we study the cloudlet placement and resourceallocation problem in a large-scale Wireless WMAN, we formulatethe problem as an novel cloudlet placement problem that givenan average access delay between mobile users and the cloudlets, place K cloudlets to some strategic locations in the WMAN withthe objective to minimize the number of use cloudlet K. Wethen propose an exact solution to the problem by formulatingit as an Integer Linear Programming (ILP). Due to the poorscalability of the ILP, we devise a clustering algorithm K-Medoids(KM) for the problem. For a special case of the problem whereall cloudlets computing capabilities have been given, we proposean efficient heuristic for it. We finally evaluate the performanceof the proposed algorithms through experimental simulations. Simulation result demonstrates that the proposed algorithms areeffective.

11 January 2018 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
LCLong CHEN
Long CHEN
JWJigang Wu
Jigang Wu
XZXin-Xiang Zhang
Xin-Xiang Zhang
GZGangqiang Zhou
Gangqiang Zhou
In heterogeneous cellular network, task scheduling for computation offloading is one of the biggest challenges. Most works focus on alleviating heavy burden of macro base stations by moving the computation tasks on macro cell user equipment (MUE) to remote cloud or small cell base stations. But the selfishness of network users is seldom considered. Motivated by the cloud edge computing, this paper provides incentive for task transfer from macro cell users to small cell base stations. The proposed incentive scheme utilizes small cell user equipment to provide relay service. The problem of computation offloading is modeled as a two-stage auction, in which the remote MUEs with common social character can form a group and then buy the computation resource of small-cell base stations with the relay of small cell user equipment. A two-stage auction scheme named TARCO is contributed to maximize utilities for both sellers and buyers in the network. The truthful, individual rationality and budget balance of the TARCO are also proved in this paper. In addition, two algorithms are proposed to further refine TARCO on the social welfare of the network. One can achieve higher utility of MUEs and the other can obtain higher total social welfare. Extensive simulation results demonstrate that, TARCO is better than random algorithm by 104.90% in terms of average utility of MUEs, while the performance of TARCO is further improved up to 28.75% and 17.06% by the proposed two algorithms, respectively.