Xiliang Luo

Xiliang Luo

Auto-generated profile, based on publicly available information

Xiliang Luo

School of Information and Science Technology, ShanghaiTech University, Shanghai, China

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
12 June 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YYYang Yang
Yang Yang
KWKunlun Wang
Kunlun Wang
GZGuowei Zhang
Guowei Zhang
XCXu Chen
Xu Chen
XLXiliang Luo
Xiliang Luo
MZMing-Tuo Zhou
Ming-Tuo Zhou
A homogeneous fog network is defined as a group of peer nodes with sharable computing and storage resources, as well as spare spectrum for node-to-node/device-to-device (N2N/D2D) communications and task scheduling. It promotes more intelligent applications and services in different Internet of Things (IoT) scenarios, thanks to effective collaborations among neighboring fog nodes via cognitive spectrum access techniques. In this paper, a comprehensive analytical model that considers circuit, computation, offloading energy consumptions is developed for accurately evaluating the overall energy efficiency in homogeneous fog networks. With this model, the tradeoff relationship between performance gains and energy costs in collaborative task offloading is investigated, thus enabling us to formulate the energy efficiency optimization problem for future intelligent IoT applications with practical constraints in available computing resources at helper nodes and unused spectrum in neighboring environments. Based on rigorous mathematical analysis, a maximal energy-efficient task scheduling (MEETS) algorithm is proposed to derive the optimal scheduling decision for a task node and multiple neighboring helper nodes under feasible modulation schemes and time allocations. Extensive simulation results demonstrate the tradeoff relationship between energy efficiency (EE) and task scheduling performance in homogeneous fog networks. Compared with traditional task scheduling strategies, the proposed MEETS algorithm can achieve much better EE performance under different network parameters and service conditions.

4 April 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YYYang Yang
Yang Yang
SZShuang Zhao
Shuang Zhao
WZWuxiong Zhang
Wuxiong Zhang
YCYu Chen
Yu Chen
XLXiliang Luo
Xiliang Luo
JWJun Wang
Jun Wang
Vehicular ad hoc networks, wireless sensor networks, Internet of Things, and mobile device-to-device communications can be modeled as different homogeneous fog networks, wherein similar terminals/things/devices/nodes are sharing their computation, communication, and storage resources in the neighborhood for achieving better system performance through effective collaborations. It is very desirable, but quite challenging, to simultaneously reduce service delay and energy consumption in such networks for delay-sensitive and energyconstraint applications, e.g., virtual reality and online 3-D gaming on mobile devices. In this paper, a cross-layer analytical framework is developed to formulate and study the balance between service delay and energy consumption. An effective control parameter V is derived to characterize their tradeoff relationship during dynamic task scheduling processes in fog networks. Combining this analysis with Lyapunov optimization techniques, a novel delay energy balanced tasking scheduling (DEBTS) algorithm is proposed to minimize the overall energy consumption while reducing average service delay and delay jitter. It is proved that DEBTS can achieve the theoretical [O(1/V), O(V)] tradeoff between these two performance metrics. Further, extensive simulation results show that DEBTS can offer much better delay-energy performance in task scheduling challenges. Specifically, for a typical V value of 4 × 10 4 , DEBTS can save 26% and 29% more energy, and at the same time, reduce average service delay by 29% and 32%, than traditional random scheduling and least busy scheduling algorithms, respectively.

16 March 2020 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
KWKunlun Wang
Kunlun Wang
YZYong Zhou
Yong Zhou
ZLZening Liu
Zening Liu
ZSZiyu Shao
Ziyu Shao
XLXiliang Luo
Xiliang Luo
YYYang Yang
Yang Yang
Fog computing (FC) has the potential to process computation-intensive tasks in Industrial Internet of Things (IIoT) systems. In parallel with the development of FC, non-orthogonal multiple access (NOMA) has been recognized as a promising technique to significantly improve the spectrum efficiency. In this paper, a NOMA-based FC framework for IIoT systems is considered, where multiple task nodes offload their tasks via NOMA to multiple nearby helper nodes for execution. We formulate a joint task scheduling and subcarrier allocation problem, with an objective to minimize the total cost in terms of the delay and energy consumption, while taking into account the practical communication and computation constraints. Note that the task scheduling includes task, computation resource, and power allocations. Since the task and subcarrier allocations involve binary variables, it is challenging to obtain an optimal solution for such a combinatorial problem. To this end, we solve the task scheduling and subcarrier allocation problem in an online learning fashion. During the online learning process, we propose an iterative algorithm to jointly optimize the subcarrier allocation and task scheduling in each time episode. Simulation results show that the proposed scheme can significantly reduce the sum cost compared to the baseline schemes.

15 July 2019 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
ZZZhaowei Zhu
Zhaowei Zhu
TLTing Liu
Ting Liu
YYYang Yang
Yang Yang
XLXiliang Luo
Xiliang Luo
Task offloading is a promising technology to exploit the available computational resources in spatially distributed fog nodes efficiently in the era of fog computing. In this paper, we look for an online task offloading strategy to minimize the long-term cost, which factors in the latency, the energy consumption, and the switching cost. To this end, we formulate a stochastic programming problem and the expectations of the system parameters are allowed to change abruptly at unknown time instants. Meanwhile, we consider the fact that the queried nodes can only feed back the processing results after finishing the tasks. Then we put forth an effective bandit learning algorithm, i.e. the BLOT, to solve this challenging stochastic programming under the non-stationary bandit model. We also demonstrate that our proposed BLOT algorithm is asymptotically optimal in a non-stationary fog-enabled network. Numerical experiments further verify the superb performance of BLOT.

13 December 2021 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
ZWZixin Wang
Zixin Wang
HZHanyu Zhu
Hanyu Zhu
MHMingcheng He
Mingcheng He
YZYong Zhou
Yong Zhou
XLXiliang Luo
Xiliang Luo
NZNing Zhang
Ning Zhang
Adaptive traffic light signal control (ATSC) is a promising paradigm for alleviating traffic congestion in intelligent transportation systems. Most of the existing methods require heavy traffic data exchange among neighboring intersections to achieve collaborative ATSC, which may not be supported by bandwidth-limited communication links in practice. In this article, we develop a communication-efficient decentralized ATSC framework for traffic networks with multiple intersections, where each intersection only exchanges traffic statistics with its neighboring intersections. In particular, the proposed framework consists of a generative adversarial network (GAN) based algorithm for traffic data recovery, and a multi-agent deep reinforcement learning (DRL) based decentralized ATSC algorithm for traffic efficiency enhancement. By adopting the value decomposition technique that establishes a nonlinear mapping from the local state-action values to the global reward, each intersection can independently determine its traffic light signal based on its local traffic data while achieving collaboration among neighboring intersections. Our proposed decentralized ATSC framework is scalable to large-scale traffic networks, and is also robust to traffic flow variations via interacting with the environment. Simulations show that our proposed algorithm can significantly reduce the vehicle travel time while maintaining high and stable traffic throughput.

8 January 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
PCPenghao Cai
Penghao Cai
FYFuqian Yang
Fuqian Yang
Jianjia WangJianjia Wang
Jianjia Wang
Xing WuXing Wu
Xing Wu
YYYang Yang
Yang Yang
XLXiliang Luo
Xiliang Luo
Fog computing is a promising solution to enable delay-sensitive applications in the Internet of Things (IoT). In this paper, based on the simultaneous wireless information and power transfer (SWIPT) technology, we investigate the joint offloading of tasks and energy in fog-enabled IoT networks. Specifically, the task node is allowed to offload energy and tasks to multiple neighboring helper nodes in a time division multiple access (TDMA) manner. When there are no task queues in the nodes, the offloading decision for each task is independent. We first find the offloading strategy to minimize the task execution delay as well as the energy consumption for a specific task and then analyze the condition under which the joint offloading of tasks and energy is beneficial. We show that it becomes more and more desirable to offload both the tasks and the energy from the task node as the number of helper nodes gets large. When there are task queues in the nodes, the offloading decision for each task becomes temporally correlated. We then characterize the optimal strategies to offload the tasks and energy jointly over multiple time slots. An online offloading policy based on the Lyapunov optimization is then proposed to minimize the time average expected delay while stabilizing the system operation. Comprehensive numerical results corroborate our theoretical results and demonstrate the superior performance of the proposed JOTE algorithms.