Ran Zhang

Ran Zhang

Auto-generated profile, based on publicly available information

Ran Zhang

Department of Electrical and Computer Engineering, University of North Carolina at Charlotte, Charlotte, NC, USA

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
11 January 2022 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
TYTingting Yang
Tingting Yang
SGShan Gao
Shan Gao
JLJiabo Li
Jiabo Li
MQMeng Qin
Meng Qin
XSXin Sun
Xin Sun
XLXianbin Li
Xianbin Li
In the context of complex and dynamic marine environment, the offloading of computing tasks for ships of Internet of Things (IoT) users is a very challenging problem considering the different quality of service (QoS) requirements of maritime applications. Mobile edge computing driven by powerful computing capability and edge intelligence is taken as a promising solution, especially for the resource-constrained and delay-sensitive maritime IoT users. In this paper, we study the optimal edge server selection problem for ship IoT users to jointly minimize the latency and energy consumption for task offloading. Specifically, we first propose a novel space-air-ground-edge (SAGE) integrated maritime network architecture to offload computation-intensive IoT services at sea. Then, the latency and energy consumption of data transmission and processing during offloading are modelled. Based on the models, the edge server selection problem is formulated into a Multi-Armed Bandits learning problem, with considering the task latency requirement and energy budget. To achieve the optimal solution, a novel algorithm, referred to as UCB1-ESSS, is developed, which links the latency, energy consumption, and network constraints by introducing both reward and cost. The simulation results show that the proposed algorithm can achieve considerably lower offloading latency and weighted latency-energy cost compared with the traditional algorithms under different QoS requirements, which proves the efficacy of theproposed algorithm.

19 February 2021 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
RZRan Zhang
Ran Zhang
MWMiao Wang
Miao Wang
LCLin X. Cai
Lin X. Cai
XSXuemin Shen
Xuemin Shen
Multi-Unmanned Aerial Vehicle (UAV) control is one of the major research interests in UAV-based networks. Yet few existing works focus on how the network should optimally react when the UAV lineup and user distribution change. In this work, proactive self-regulation (PSR) of UAV-based networks is investigated when one or more UAVs are about to quit or join the network, with considering dynamic user distribution. We target at an optimal UAV trajectory control policy which proactively relocates the UAVs whenever the UAV lineup is about to change, rather than passively dispatches the UAVs after the change. Specifically, a deep reinforcement learning (DRL)-based self-regulation approach is developed to maximize the accumulated user satisfaction (US) score for a certain period within which at least one UAV will quit or join the network. To handle the changed dimension of the state-action space before and after the lineup changes, the state transition is deliberately designed. To accommodate continuous state and action space, an actor-critic based DRL, i.e., deep deterministic policy gradient (DDPG), is applied with better convergence stability. To effectively promote learning exploration around the timing of lineup change, an asynchronous parallel computing (APC) learning structure is proposed. Referred to as PSR-APC, the developed approach is then extended to the case of dynamic user distribution by incorporating time as one of the agent states. Finally, numerical results are presented to demonstrate the convergence and superiority of PSR-APC over a passive reaction method, and its capability in jointly handling the dynamics of both UAV lineup and user distribution.

1 August 2020 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
MHMengqi Han
Mengqi Han
SKSami Khairy
Sami Khairy
LCLin X. Cai
Lin X. Cai
YCYu Cheng
Yu Cheng
RZRan Zhang
Ran Zhang
Long-Term Evolution (LTE) over unlicensed spectrum extends LTE technology to the spacious unlicensed spectrum with readily available bandwidth. The provided capacity surge makes it one of the most high-profile technologies to meet the explosive growth of mobile traffic demand. Among its different variants, Licensed Assisted Access (LAA) is considered as a promising global solution attributed to its mandatory listen-before-talk (LBT) procedure. Nevertheless, although LBT effectively maintains transmission fairness between LTE and other unlicensed systems (e.g., Wi-Fi), the current LAA protocol specified in 3GPP Release 13 is far from perfect to achieve harmony coexistence. To this end, in this paper, we first develop an analytical model to evaluate the throughput performance of Category 4 (Cat 4) algorithm agreed in 3GPP release 13. Subject to the system fairness constraint, the aggregate throughput of LTE-LAA and Wi-Fi networks is maximized based on a semi branch and bound algorithm. To make the complex optimization tractable, reinforcement learning techniques are introduced to intelligently tune the contention window size for both LTE-LAA and Wi-Fi nodes. Specifically, a cooperative learning algorithm is developed assuming that the information between different systems is exchangeable. A non-cooperative version is subsequently developed to remove the previous assumption for better practicability. Extensive simulations are conducted to demonstrate the performance of the proposed learning algorithms in contrast to the analytical upper bound under various conditions. It is shown that both proposed learning algorithms can significantly improve the total throughput performance while satisfying the fairness constraints. Particularly, the proposed cooperative learning algorithm can closely approach the analytical bound.

21 October 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
Ruijin SunRuijin Sun
Ruijin Sun
NCNan Cheng
Nan Cheng
RZRan Zhang
Ran Zhang
YWYing Wang
Ying Wang
Changle LiChangle Li
Changle Li
The newly emerging intelligent reflecting surface (IRS) with large-scale passive reflecting elements has great potentials to enhance the performance of wireless-powered Internet of Things (IoT) networks, by manipulating the wireless channel. However, most of the existing works considered the ideal reflection of IRS elements with independent amplitude and phase shift. In this article, an IRS-assisted wireless-powered multiuser multi-input-multi-output network is considered, taking into account the practical coupling effect between the reflecting amplitude and the phase shift. Then, an uplink sum-rate maximization problem is investigated by jointly designing the active beamforming of multiple antennas, the passive beamforming of the IRS, and the time allocation ratio. Due to the tightly coupled optimization variables, the formulated problem is nonconvex. To effectively solve this problem, we decompose it into three subproblems, i.e., the active beamforming, the downlink passive beamforming, and the uplink passive beamforming. For the active beamforming design, access point’s optimal downlink energy beamforming matrix is proved to be rank-one, and IoT users’ optimal uplink information covariance matrices are derived in semi-closed forms. For the downlink passive beamforming design, a low-complexity algorithm based on the successive convex approximation and the penalty function method is proposed. For the uplink passive beamforming design, the multiuser problem is equivalently transformed into a virtual single-user problem, which is solved via an iterative algorithm. Numerical results show that, in comparison with algorithms without IRS, our proposed algorithm can significantly improve the uplink sum rate up to 50% when the number of passive elements is 100.

19 May 2020 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YLYONG LIU
YONG LIU
XCXuehan Chen
Xuehan Chen
LCLin X. Cai
Lin X. Cai
QCQingchun Chen
Qingchun Chen
RZRan Zhang
Ran Zhang
In this article, we exploit nonorthogonal multiple access (NOMA) for simultaneous energy and information transfer in a wireless-powered Internet-of-Things (IoT) network. As double near–far problem causes severe unfairness, we propose a fairness-aware NOMA-based scheduling scheme to enhance the max–min fairness. Specifically, according to the channel conditions, we divide IoT devices into the interference and noninterference groups with relatively good and poor channel qualities, respectively. Energy transfer is concurrently scheduled with data transmissions of devices with good channels. Thus, devices can harvest more energy to achieve higher rates at the cost of reduced rates of devices with good channels due to the interfering energy signals. We then apply order statistics to theoretically analyze the achievable rates of ordered devices. Based on the analysis, devices are optimally categorized into the interference and noninterference groups to achieve the max–min fairness, i.e., the minimum rate of devices in both groups is maximized. An adaptive power allocation algorithm is also proposed to further improve the network fairness when the transmission power of the energy transmitter is controllable. Throughput-aware NOMA-based scheduling is also presented and compared with the fairness-aware NOMA-based scheduling to illustrate the performance tradeoff between the throughput and fairness. The simulation results validate that the proposed NOMA-based scheduling schemes significantly improve the fairness and throughput performance of wireless-powered IoT networks, compared with the existing solutions.

24 August 2021 in IEEE Access
Verified
Journal Article
Open access
YMYunshou Mao
Yunshou Mao
JWJiekang Wu
Jiekang Wu
CZCai Zhihong
Cai Zhihong
WRWang Ruidong
Wang Ruidong
ZRZhang Ran
Zhang Ran
CLChen Lingmin
Chen Lingmin
A multi-energy system can supply both electric and thermal energy simultaneously to the end-users to achieve a high energy use-efficiency. However conventional operational strategies for multi-energy systems, in the existing works, do not consider renewable energy generation plants and CCHP plants as belonging to different interests. To cope with this problem, this article studies a cooperative operation framework model for a Wind-Solar-CCHP Multi-energy system. Instead of the conventional non-cooperative solution-based method, the optimal operation scheduling problem of a multi-energy system is described as an optimization problem of Nash Bargaining. Then the optimization problem of Nash Bargaining for the multi-energy system decomposed into two subproblems: social welfare maximization problem (P1) and energy trading payment problem (P2). The optimal energy transaction profiles can be obtained by solving the P1 problem and the problem of payment of energy trading between PV, WT plant agents and the CCHP plant agent can be obtained by solving the P2 problem. Both problems P1 and P2 can be formulated into mixed-integer linear programming problems and solved by the alternating directional multiplier method. Numerical studies demonstrate the correctness and effectiveness of the proposed cooperative operation framework and distributed algorithm for solving the two subproblems. Moreover, the bargaining-based cooperative operation method can further induce the multi-energy system to improve the operating profit with the reduced feed-in tariff of distributed generation.