Sanshan Sun

Prof. Dr. Sanshan Sun

College of Physics and Electronic Engineering, Sichuan Normal University, Chengdu, Sichuan, China
orcid

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
23 January 2018 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
YSYao Sun
Yao Sun
GFGang Feng
Gang Feng
SQShuang Qin
Shuang Qin
Sanshan SunSanshan Sun
Sanshan Sun
In heterogeneous cellular networks (HetNets) with macro base station (MBS) and multiple small BSs (SBSs), cell association of user equipment (UE) affects UE transmission rate and network throughput. Conventional cell association rules are usually based on UE received signal-to-interference-and-noise-ratio (SINR) without being aware of other UE statistical characteristics, such as user movement and distribution. User behaviors can indeed be exploited for improving long term network performance. In this paper, we investigate UE cell association in HetNets by exploiting both individual and clustering user behaviors with the aim to maximize long-term system throughput. We model the problem as a stochastic optimization problem, and prove that it is PSPACE-hard. For mathematical tractability, we solve the problem in two steps. In the first step, we investigate UE association for a specific SBS. We use restless multi-armed bandit model to derive association priority index for the SBS. In the second step, we develop an Index Enabled Association (IDEA) policy for making cell association decisions in general HetNets based on the indices derived in the first step. IDEA determines a set of admissible BSs for a UE based on SINR, and then associates the UE with the BS that has the smallest index in the set. We conduct simulation experiments to compare IDEA with conventional max-SINR cell association policy and game-based RAT selection policy. Numerical results demonstrate the significant advantages of IDEA in typical scenarios.

1 March 2019 in IEEE Access
Verified
Journal Article
Open access
GWGang Wang
Gang Wang
GFGang Feng
Gang Feng
SQShuang Qin
Shuang Qin
RWRuihan Wen
Ruihan Wen
Sanshan SunSanshan Sun
Sanshan Sun
Network slicing has been viewed as a key enabler for the next-generation software-defined and cloud-based network (e.g. 5G and beyond) to accommodate diverse services in a flexible and cost-efficient fashion. Network slicing allows a Network Slice Provider (NSP) to operate on a common network infrastructure to create customized isolated logical networks (i.e., network slices) for Network Slice Customers (NSCs, i.e., service providers). NSP and NSCs are independent operators who pursue profit maximization, while in the literature, only network cost optimization is intensively investigated in terms of Service Function Chain (SFC) embedding, i.e., virtual network function (VNF) placement and flow routing. Therefore, slices should be dimensioned (i.e., resources allocated to slices) according to the resource availability and the economic mechanism in the network, so as to optimize the resource utilization and improve the profit of NSP/NSCs. In this paper, we study elastic slice dimensioning with resource pricing as a Stackelberg pricing game, in which the NSP sells slices by pricing resources and NSCs adjust their slice’s resource demand on VNF capacity and bandwidth, while both are trying to maximize their profit. Then we formulate optimization problems for the pricing game and find that a closed form solution of the optimal price cannot be obtained for a non-trivial network. Hence, we propose a resource pricing algorithm that aims to maximize the NSP’s profit and the network’s social welfare. Compared with existing usage-based pricing method and two heuristic methods, our proposed pricing algorithm for slice dimensioning strikes a trade-off between maximizing NSP’s profit and other metrics including the resource utilization. Hence, it will help fully exploiting the benefits of network slicing

30 November 2022 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
YXYouzhi Xiong
Youzhi Xiong
Sanshan SunSanshan Sun
Sanshan Sun
LLLi Liu
Li Liu
ZZZhongpei Zhang
Zhongpei Zhang
NWNing Wei
Ning Wei
This paper concentrates on cell-free massive multiple-input and multiple-output (MIMO) network with variable-resolution analog-to-digital converters (ADCs). In such an architecture, all ADCs equipping at any access point (AP) can use arbitrary bit resolution to realize adaptive quantization and reduce power consumption. Under this circumstance, we first introduce a quantization-aware channel estimator based on linear minimum mean-square error (LMMSE) theory. On this basis, intra-AP and inter-AP bit allocation problems are investigated to maximize channel estimation quality subject to the total number of quantization bits. By leveraging the statistical characteristics of the estimated channels and estimation errors, we then derive the theoretical expressions of the achievable uplink spectral efficiency (SE) for maximal ratio combining (MRC) and minimum mean-square error (MMSE) combining, respectively. Furthermore, to maximize the sum SE under the constraint of total ADC quantization bits, we also investigate intra-AP and inter-AP bit allocation problems for both single-user and multi-user scenarios. Finally, simulation results confirm that our theoretical analyses are correct and accurate. In addition, we resort to numerical results to achieve some new insights and verify the advantages and conclusions pertinent to the proposed bit allocation techniques.

26 April 2021 in IEEE Systems Journal
Verified
Journal Article
Closed access
YXYouzhi Xiong
Youzhi Xiong
Sanshan SunSanshan Sun
Sanshan Sun
LQLang Qin
Lang Qin
NWNing Wei
Ning Wei
LLLi Liu
Li Liu
ZZZhongpei Zhang
Zhongpei Zhang
In the recently proposed cell-free massive multiple-input and multiple-output (MIMO) networks, the capacity of fronthaul links connecting all access points (APs) and a central processing unit (CPU) is limited. In this context, taking into consideration the spatial channel correlation at the APs, this article investigates the performance of cell-free massive MIMO systems with variable-resolution quantization, i.e., each analog-to-digital converter at the APs and quantizer at the CPU use arbitrary bits for quantization. Specifically, we first introduce a technique based on linear minimum mean-square to perform channel estimation. On this basis, we then derive the closed-form expressions of achievable rates over spatially correlated Rayleigh fading channels for both uplink and downlink if maximal ratio combining and maximal ratio transmission are used at the CPU. Finally, simulation results validate our theoretical analyses and corroborate that the performance of channel estimation and achievable rates reduces as the spatial correlation strengthens. Moreover, from a statistic perspective, under the constraint of the total number of quantization bits, it is preferable to assign more bits to the AP with larger aggregated large-scale fading coefficient and lower channel correlation.

24 February 2021 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
YXYouzhi Xiong
Youzhi Xiong
Sanshan SunSanshan Sun
Sanshan Sun
NWNing Wei
Ning Wei
LLLi Liu
Li Liu
ZZZhongpei Zhang
Zhongpei Zhang
The use of low-resolution analog-to-digital converters (ADCs) and digital-to-analog converters (DACs) is recognized as a practical technique to reduce power consumption and hardware cost for massive multiple-input and multiple-output (MIMO) systems. In this context, by leveraging on the additive quantization noise model (AQNM), this paper investigates the performance of massive MIMO relay systems with a variable-resolution ADC/DAC-based architecture, where each ADC and DAC use arbitrary bits for quantization. To be specific, we first derive the closed-form expression of achievable rate over spatially correlated Rayleigh fading channels by using perfect channel state information (CSI), maximal ratio combining (MRC), and maximal ratio transmission (MRT). Afterwards, we extend the work to the case of imperfect CSI. The analytical expressions reveal some insights of key parameters, i.e., spatial channel correlation, large-scale fading coefficients, estimate errors, and the resolution of ADCs/DACs. Finally, simulation results validate our theoretical analyses and confirm that the achievable rate reduces as the spatial correlation rises. Besides, we provide the condition under which coarse DACs (ADCs) and receive spatial correlation (transmit spatial correlation) dominate the loss of achievable rate. Moreover, provided that the total number of quantization bits is constant, we find that the achievable rate is optimal over spatially correlated channels when all ADC and DAC adopt the same quantization bits from the perspective of statistic.

26 December 2022 in IEEE Communications Letters
Verified
Journal Article
Closed access
YXYouzhi Xiong
Youzhi Xiong
LQLang Qin
Lang Qin
Sanshan SunSanshan Sun
Sanshan Sun
LLLi Liu
Li Liu
SMSun Mao
Sun Mao
NWNing Wei
Ning Wei
This paper investigates the uplink data detection for reconfigurable intelligent surface (RIS)-assisted massive multiple-input multiple-output (MIMO) systems with low-resolution quantization at the base stations (BSs). By exploiting the statistical characteristics of the user-to-RIS and RIS-to-BS channels and the central limit theorem (CLT), we first demonstrate that the components in the effective channel are approximately Gaussian distributed under propagation in sub-6 GHz bands. Based on the bilinear generalized approximate message passing (BiG-AMP) algorithm, we then provide a quantization-aware approach to estimate the effective channel and recover transmit symbols. Finally, numerical results show that the revised BiG-AMP technique can improve the performance of channel estimation and data detection with affordable computational complexity.