Shaolei Ren

Shaolei Ren

Auto-generated profile, based on publicly available information

Shaolei Ren

University of California, Riverside, Riverside, USA

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
11 July 2017 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Open access
JXJie Xu
Jie Xu
LCLixing Chen
Lixing Chen
SRShaolei Ren
Shaolei Ren
Mobile edge computing (also known as fog computing) has recently emerged to enable in-situ processing of delay-sensitive applications at the edge of mobile networks. Providing grid power supply in support of mobile edge computing, however, is costly and even infeasible (in certain rugged or under-developed areas), thus mandating on-site renewable energy as a major or even sole power supply in increasingly many scenarios. Nonetheless, the high intermittency and unpredictability of renewable energy make it very challenging to deliver a high quality of service to users in energy harvesting mobile edge computing systems. In this paper, we address the challenge of incorporating renewables into mobile edge computing and propose an efficient reinforcement learning-based resource management algorithm, which learns on-the-fly the optimal policy of dynamic workload offloading (to the centralized cloud) and edge server provisioning to minimize the long-term system cost (including both service delay and operational cost). Our online learning algorithm uses a decomposition of the (offline) value iteration and (online) reinforcement learning, thus achieving a significant improvement of learning rate and run-time performance when compared to standard reinforcement learning algorithms such as ${Q}$ -learning. We prove the convergence of the proposed algorithm and analytically show that the learned policy has a simple monotone structure amenable to practical implementation. Our simulation results validate the efficacy of our algorithm, which significantly improves the edge computing performance compared to fixed or myopic optimization schemes and conventional reinforcement learning algorithms.

10 May 2017 in ACM Computing Surveys
Verified
Journal Article
Open access
CDCuong T. Do
Cuong T. Do
NTNguyen H. Tran
Nguyen H. Tran
CHChoongseon Hong
Choongseon Hong
CKCharles A. Kamhoua
Charles A. Kamhoua
KKKevin A. Kwiat
Kevin A. Kwiat
SISundaraja Sitharama Iyengar
Sundaraja Sitharama Iyengar
In this survey, we review the existing game-theoretic approaches for cyber security and privacy issues, categorizing their application into two classes, security and privacy. To show how game theory is utilized in cyberspace security and privacy, we select research regarding three main applications: cyber-physical security, communication security, and privacy. We present game models, features, and solutions of the selected works and describe their advantages and limitations from design to implementation of the defense mechanisms. We also identify some emerging trends and topics for future research. This survey not only demonstrates how to employ game-theoretic approaches to security and privacy but also encourages researchers to employ game theory to establish a comprehensive understanding of emerging security and privacy problems in cyberspace and potential solutions.

20 February 2017 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
CPChuan Pham
Chuan Pham
NTNguyen H. Tran
Nguyen H. Tran
SRShaolei Ren
Shaolei Ren
Walid SaadWalid Saad
Walid Saad
Choong Seon HongChoong Seon Hong
Choong Seon Hong
Although network function virtualization (NFV) is a promising approach for providing elastic network functions, it faces several challenges in terms of adaptation to diverse network appliances and reduction of the capital and operational expenses of the service providers. In particular, to deploy service chains, providers must consider different objectives, such as minimizing the network latency or the operational cost, which are coupled objectives that have traditionally been addressed separately. In this paper, the problem of virtual network function (vNF) placement for service chains is studied for the purpose of energy and traffic-aware cost minimization. This problem is formulated as an optimization problem named the joint operational and network traffic cost (OPNET) problem. First, a sampling-based Markov approximation (MA) approach is proposed to solve the combinatorial NP-hard problem, OPNET. Even though the MA approach can yield a near-optimal solution, it requires a long convergence time that can hinder its practical deployment. To overcome this issue, a novel approach that combines the MA with matching theory, named as SAMA, is proposed to find an efficient solution for the original problem OPNET. Simulation results show that the proposed framework can reduce the total incurred cost by up to 19 percent compared to the existing non-coordinated approach.

27 June 2025 in Communications of the ACM
Verified
Journal Article
Open access
PLPengfei Li
Pengfei Li
JYJianyi Yang
Jianyi Yang
MIMohammad A. Islam
Mohammad A. Islam
SRShaolei Ren
Shaolei Ren
Uncovering and addressing the secret water footprint of AI models

26 June 2013 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
BKByung-Gook Kim
Byung-Gook Kim
SRShaolei Ren
Shaolei Ren
MSMihaela van der Schaar
Mihaela van der Schaar
JLJang-Won Lee
Jang-Won Lee
Electric vehicles (EVs) will play an important role in the future smart grid because of their capabilities of storing electrical energy in their batteries during off-peak hours and supplying the stored energy to the power grid during peak hours. In this paper, we consider a power system with an aggregator and multiple customers with EVs and propose novel electricity load scheduling algorithms which, unlike previous works, jointly consider the load scheduling for appliances and the energy trading using EVs. Specifically, we allow customers to determine how much energy to purchase from or to sell to the aggregator while taking into consideration the load demands of their residential appliances and the associated electricity bill. We propose two different approaches: a collaborative and a non-collaborative approach. In the collaborative approach, we develop an optimal distributed load scheduling algorithm that maximizes the social welfare of the power system. In the non-collaborative approach, we model the energy scheduling problem as a non-cooperative game among self-interested customers, where each customer determines its own load scheduling and energy trading to maximize its own profit. In order to resolve the unfairness between heavy and light customers in the non-collaborative approach, we propose a tiered billing scheme that can control the electricity rates for customers according to their different energy consumption levels. In both approaches, we also consider the uncertainty in the load demands, with which customers' actual energy consumption may vary from the scheduled energy consumption. To study the impact of the uncertainty, we use the worst-case-uncertainty approach and develop distributed load scheduling algorithms that provide the guaranteed minimum performances in uncertain environments. Subsequently, we show when energy trading leads to an increase in the social welfare and we determine what are the customers' incentives to participate in the energy trading in various usage scenarios including practical environments with uncertain load demands.

16 February 2015 in IEEE Transactions on Smart Grid
Verified
Journal Article
Closed access
PFPingyi Fan
Pingyi Fan
BSBilguun Sainbayar
Bilguun Sainbayar
SRShaolei Ren
Shaolei Ren
For dc fast charging stations (FCS), short charging time duration is its main advantage over other ac charging stations. However, due to the characteristics of internal resistance of electric vehicle (EV) batteries, if charging request of an EV is near the full state of charge (SoC), its charging time increases significantly. In this paper, considering the impact of requested SoC on charging time, we propose an operation analysis of FCS, where operators of FCS can set a limit on the EVs' requested SoC to obtain maximized revenue. We model the FCS operation as an M/G/S/K queue and incorporate the dc fast charging model into the queuing analysis, as well as the revenue model of FCS. Simulation results indicate that limiting the requested SoC in an overloaded condition at FCS can increase total charged energy and revenue of FCS, as well as decrease the probability of blocking arriving EVs.