Boren Guo

Mr. Boren Guo

Beijing University of Posts and Telecommunications, Beijing 100876, China
orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
18 January 2022 in IEEE Access
Verified
Journal Article
Open access
LZLianqi Zang
Lianqi Zang
XZXin Zhang
Xin Zhang
Boren GuoBoren Guo
Boren Guo
Mobile edge computing (MEC) is considered a more effective technological solution for developing the Internet of Things (IoT) by providing cloud-like capabilities for mobile users. This article combines wireless powered communication (WPC) technology with an MEC network, where a base station (BS) can transfer wireless energy to edge users (EUs) and execute computation-intensive tasks through task offloading. Traditional numerical optimization methods are time-consuming approaches for solving this problem in time-varying wireless channels, and centralized deep reinforcement learning (DRL) is not stable in large-scale dynamic IoT networks. Therefore, we propose a federated DRL-based online task offloading and resource allocation (FDOR) algorithm. In this algorithm, DRL is executed in EUs, and federated learning (FL) uses the distributed architecture of MEC to aggregate and update the parameters. To further solve the problem of the non-IID data of mobile EUs, we devise an adaptive method that automatically adjusts the FDOR algorithm’s learning rate. Simulation results demonstrate that the proposed FDOR algorithm is superior to the traditional numerical optimization method and the existing DRL algorithm in four aspects: convergence speed, execution delay, overall calculation rate and stability in large-scale and dynamic IoT.

4 November 2019 in IEEE Access
Verified
Journal Article
Open access
Boren GuoBoren Guo
Boren Guo
XZXin Zhang
Xin Zhang
YWYaxin Wang
Yaxin Wang
HYHongwen Yang
Hongwen Yang
By offloading storage and computing resources to the edge of networks, mobile edge computing (MEC) is emerged as a promising architecture to reduce the transmission delay and bandwidth waste for mobile multimedia services. This paper focuses on a multi-service scenario in the MEC systems, where the MEC server can provide three multimedia services including live streaming, buffered streaming and low latency enhanced mobile broadband applications for edge users at the same time. In order to satisfy various quality of service (QoS) requirements for different multimedia applications, the 5G QoS model is applied. Notably, the packets from the multimedia applications with the same or similar requirements are mapped into the same QoS flow, and each QoS flow is processed individually. Therefore, how to effectively schedule the limited radio resource for QoS flows is an intractable problem. To address the problem above, a QoS evaluation model is designed, and a QoS maximization problem is formulated. Furthermore, a deep reinforcement learning method, deep-Q-network, is adopted to make decisions to allocate radio resource dynamically. Compared with round-robin and priority-based scheduling algorithms, the simulation results validate that the proposed algorithm outperforms other resource scheduling algorithms for multi-service scenario.

6 January 2020 in IEEE Access
Verified
Journal Article
Open access
Boren GuoBoren Guo
Boren Guo
XZXin Zhang
Xin Zhang
QSQiwei Sheng
Qiwei Sheng
HYHongwen Yang
Hongwen Yang
Fog radio access networks (F-RANs) can effectively alleviate fronthaul loads and reduce content transmission delay by migrating cloud services to the network edge. This paper addresses a cooperative caching scenario in F-RAN, where each mobile user can acquire the requested contents from any one of its associated fog-computing-based access points (F-APs). However, caching disparate contents in different F-APs will lead to different content delivery delays, since mobile users suffer from diverse channel fadings and interferences when they download contents from different F-APs. Considering limited caching storage in each F-AP, diverse user preferences, unpredictable user mobility and time-varying channel states, an average transmission delay minimization problem is formulated. With the aid of dueling deep-Q-network framework, a delay-aware cache update policy is proposed for mobile users in F-RAN. The proposed cache update policy will decide to replace the stored contents in F-APs with the proper contents at each time slot. Compared with first in first out, least recently used and least frequently used caching policies, simulation experiments are performed to evaluate the performance of the proposed algorithm. Simulation results illustrate that the proposed caching policy yields better average hit ratio and lower average transmission delay than other traditional caching policies.

1 October 2019
Verified
Conference Paper
Closed access
TXTianqi Xiang
Tianqi Xiang
YWYaxin Wang
Yaxin Wang
HLHuiwen Li
Huiwen Li
Boren GuoBoren Guo
Boren Guo
XZXin Zhang
Xin Zhang
A novel location-aware beamforming scheme for millimeter wave communication is proposed for line of sight (LOS) and low mobility scenarios, in which computer vision is introduced to derive the required position or spatial angular information from the image or video captured by camera(s) colocated with mmWave antenna array at base stations. A wireless coverage model is built to investigate the coverage performance and influence of positioning accuracy achieved by convolutional neural network (CNN) for image processing. In addition, videos could be intentionally blurred, or even low-resolution videos could be directly applied, to protect users' privacy with acceptable positioning precision, lower computation complexity and lower camera cost. It is proved by simulations that the beamforming scheme is practicable and the mainstream CNN we employed is sufficient in both aspects of beam directivity accuracy and processing speed in frame per second.

1 April 2019
Verified
Conference Paper
Closed access
Boren GuoBoren Guo
Boren Guo
CYChunli Ye
Chunli Ye
HYHang Yu
Hang Yu
YSYihao Sun
Yihao Sun
YWYaxin Wang
Yaxin Wang
HYHongwen Yang
Hongwen Yang
Cloud Radio Access Network (C-RAN) is widely considered a significant part of fifth generation (5G) networks. This paper offers flexible Software Defined Radio (SDR) testbed for C-RAN researchers and developers to verify network function and evaluate system performance. In 5G C-RAN architecture, a Baseband Unit (BBU) of C-RAN is split into a Centralized Unit (CU) and a Distributed Unit (DU). As a consequence, a SDR testbed based on OpenAirInterface is built and extended to support the CU/DU split. In order to support communications between the CU and DU units, a succinct and effective interface protocol is designed. Specifically, the CU/DU control plane split at the RRC/RLC point is primarily addressed, so that User Equipment (UE) can complete attach UE and detach UE procedures through the decoupled CU and DU units. Besides, the CU/DU user plane split at the PDCP/RLC point is accomplished. Therefore, two independent units, CU and DU, can substitute for BBU. Finally, this paper evaluates the testbed using a real network setup, a commercial Evolved Packet Core (EPC), a remote radio head (RRU) and several commercial UEs. The results show that the testbed can successfully attach UE, detach UE and transmit data to commercial UEs over the air.

2 January 2021 in Sensors
Verified
Journal Article
Open access
PDF file
Ailing ZhongAiling Zhong
Ailing Zhong
Zhidu LiZhidu Li
Zhidu Li
Ruyan WangRuyan Wang
Ruyan Wang
Xingjie LiXingjie Li
Xingjie Li
Boren GuoBoren Guo
Boren Guo
How to support massive access efficiently is one of the challenges in the future Internet of Things (IoT) systems. To address such challenge, this paper proposes an effective preamble collision resolution scheme to sustain massive random access (RA) for an IoT system. Specifically, a new sub-preamble structure is first proposed to reduce the preamble collision probability. To identify different devices that send the same preamble to the gNB on the same physical random access channel (PRACH), a multiple timing advance (TA) capturing scheme is then proposed. Thereafter, an RA scheme is designed to sustain massive access and the performance of the scheme is studied analytically. Finally, the effectiveness of the proposed RA scheme is validated by extensive simulation experiments in terms of preamble detection probability, preamble collision probability, RA success probability, resource efficiency and TA capturing.