Shuo Wang

Shuo Wang

Auto-generated profile, based on publicly available information

Shuo Wang

Sony (China) Research Laboratory, Beijing, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
21 March 2017 in IEEE Access
Verified
Journal Article
Open access
SWShuo Wang
Shuo Wang
XZXing Zhang
Xing Zhang
YZYan Zhang
Yan Zhang
LWLin Wang
Lin Wang
JYJuwo Yang
Juwo Yang
WWWenbo Wang
Wenbo Wang
As the explosive growth of smart devices and the advent of many new applications, traffic volume has been growing exponentially. The traditional centralized network architecture cannot accommodate such user demands due to heavy burden on the backhaul links and long latency. Therefore, new architectures, which bring network functions and contents to the network edge, are proposed, i.e., mobile edge computing and caching. Mobile edge networks provide cloud computing and caching capabilities at the edge of cellular networks. In this survey, we make an exhaustive review on the state-of-the-art research efforts on mobile edge networks. We first give an overview of mobile edge networks, including definition, architecture, and advantages. Next, a comprehensive survey of issues on computing, caching, and communication techniques at the network edge is presented. The applications and use cases of mobile edge networks are discussed. Subsequently, the key enablers of mobile edge networks, such as cloud technology, SDN/NFV, and smart devices are discussed. Finally, open research challenges and future directions are presented as well.

2 May 2024 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
JGJungang Ge
Jungang Ge
YLYing-Chang Liang
Ying-Chang Liang
SWShuo Wang
Shuo Wang
CSChen Sun
Chen Sun
Cooperative spectrum sensing (CSS) is a key enabling technology of cognitive radio networks with multiple secondary users (SUs). In conventional CSS systems, when the primary signals are weak, the SUs require long sensing time to achieve a high detection probability for protecting the transmission of the primary user (PU), leading to little remaining time for secondary transmissions. To address this issue, we propose a reconfigurable intelligent surface (RIS) assisted CSS system, where multiple RISs are employed to improve the CSS performance within limited sensing time. Considering that the dependency of the CSS performance on the received primary signal strengths at the SUs differs across various CSS schemes, the RIS configurations could also be optimized differently regarding these CSS schemes. Motivated by this, we investigate the phase shift matrix (PSM) optimization problems to maximize the cooperative detection probability given a maximum tolerable false alarm probability, and we consider two typical kinds of CSS schemes, namely, data fusion and decision fusion. As it is intractable to directly solve these problems due to the complex expressions of the cooperative detection probability with respect to the PSMs, we show that the solutions can be obtained by transforming these problems into channel gain-related optimization problems. Furthermore, we show that the proposed PSM optimization methods can be extended to the more practical scenarios where instantaneous channel state information (CSI) is unavailable. In such cases, we leverage statistical CSI to improve the CSS performance in the sense of expectation. Subsequently, we conduct a numerical analysis on the number of reflecting elements required to achieve a target detection probability in the statistical CSI case. Finally, simulation results demonstrate that the proposed PSM optimization methods can significantly improve the CSS performance within limited sensing time.

10 January 2023 in IEEE Transactions on Cognitive Communications and Networking
Verified
Journal Article
Closed access
ZCZhiyang Cheng
Zhiyang Cheng
YLYifei Liang
Yifei Liang
YZYouping Zhao
Youping Zhao
SWShuo Wang
Shuo Wang
CSChen Sun
Chen Sun
To overcome the spectrum scarcity issues, the citizens broadband radio service (CBRS) presents a centralized spectrum management solution. The efficiency of spectrum utilization could be further improved by introducing spectrum trading. Blockchain-based spectrum trading has been considered as a decentralized, flexible, and secure approach. However, current studies rarely investigate the interference to incumbent users caused by spectrum trading between CBRS devices (CBSDs), and the scalability issues in blockchain-based spectrum trading are rarely discussed. To address the problems above, this paper develops the blockchain-based spectrum trading mechanisms for CBRS. Particularly, we propose a queuing mechanism for intra-coexistence group (CxG) trading, in which spectrum trading is leveraged to reduce the aggregated interference to incumbents. A new parameter termed “network feature" is proposed to prioritize spectrum transactions in different queues, which helps to achieve the trade-off between the interference to incumbents and resource requirements in spectrum transactions. Furthermore, we propose a multi-blockchain architecture and a corresponding cross-chain mechanism to improve the speed of inter-CxG spectrum trading. Simulation results show that the aggregated interference to incumbents can be reduced by adopting the proposed method. Meanwhile, when adopting the proposed cross-chain spectrum trading mechanism, the network throughput can be improved by up to 24% compared with the traditional CBRS spectrum management framework.

26 July 2018 in IET Communications
Verified
Journal Article
Open access
PDF file
SWShuo Wang
Shuo Wang
XZXing Zhang
Xing Zhang
LWLin Wang
Lin Wang
JYJuwo Yang
Juwo Yang
WWWenbo Wang
Wenbo Wang
Caching at the user devices is a key technology to alleviate backhaul load and improve users' quality of experience in mobile edge networks. However, due to the concern of privacy and limited battery life, users are not willing to share their resources. In this study, the authors jointly design the caching strategy and incentive scheme to encourage the users to share their storage resources and improve the social welfare of the cellular network. First, the user equipments (UEs) are classified into different types according to their preference to share cache resources. Then, based on contract theory, an optimisation problem with necessary constraints is formulated aiming at maximising the base station (BS)'s utility. The reward the BS pays for a UE is based on the total amount of contents it shares with other UEs, which is related to the caching policy of UEs. A heuristic caching strategy is proposed and the optimal contract is obtained. Finally, the system performance of the proposed solution is analysed, simulation results show that the incentive scheme can improve the willingness of users to share contents, and the proposed caching strategy contributes more to the social welfare compared with two baseline caching schemes: fair caching and random caching.

30 June 2017 in IEEE Access
Verified
Journal Article
Open access
KYKun Yang
Kun Yang
LWLin Wang
Lin Wang
SWShuo Wang
Shuo Wang
XZXing Zhang
Xing Zhang
The user requirements in the future wireless networks are heterogeneous. The resource allocation and user association are crucial factors to meet user requirements and save energy. In this paper, the optimization of resource allocation and user association problem in both low data and high data requirement scenario is studied. In the low data requirement scenario, a network energy consumption minimization problem which considering the signal-to-interference-plus-noise ratio coverage constraints and jointly determines the optimal density of micro base stations (mBSs) and the optimal association bias is formulated. The closed-form solution of the optimal mBSs density and association bias is derived, O(λ u -(α/2) ) u respectively. Optimal association bias grows like O(λ ) as a function of user density λu (α is path loss factor) and the optimal density of mBSs is a linearly monotone increasing function of the user density. In the high data requirement scenario, a rate coverage maximization problem by adjusting the bandwidth allocation and user association are investigated. The relationship between bandwidth allocation and user association bias is obtained and a dynamic gradient iterative algorithm is used to solve the maximization problem. Simulation results verify the relevant derivations and demonstrate the user density and requirement have an important influence on the optimal resource allocation and optimal association bias.

19 April 2017 in IEEE Access
Verified
Journal Article
Open access
LWLin Wang
Lin Wang
XZXing Zhang
Xing Zhang
SWShuo Wang
Shuo Wang
JYJuwo Yang
Juwo Yang
Machine-to-machine communication has emerged as a new communication paradigm to support a variety of applications of Internet of Things (IoT). Meanwhile, energy harvesting (EH) is an increasingly attractive source of power for green networks. In this paper, we study an online strategy of adaptive traffic offloading and bandwidth allocation for EH IoT networks, where machines are powered by grid and green energy jointly. First, we study the energy-aware and adaptive traffic offloading strategy to adaptively balance the non-uniform renewable energy arriving, with the purpose of minimizing the average on-grid energy consumption. Furthermore, the bandwidth allocation strategy to maximize the average sum-rate is proposed. Finally, we validate this paper by simulations and show that the proposed strategy can achieve 55% reduction of the average on-grid energy consumption and over 100% increase of the average sum-rate.