Chung Shue Chen

Dr. Chung Shue Chen

Nokia Bell Labs, Paris-Saclay Center, 92610 Nozay, France
orcid

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
24 January 2023 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
TZTianzhu Zhang
Tianzhu Zhang
HQHan Qiu
Han Qiu
GCGabriele Castellano
Gabriele Castellano
MRMyriana Rifai
Myriana Rifai
Chung Shue ChenChung Shue Chen
Chung Shue Chen
FPFabio Pianese
Fabio Pianese
Modern information and communication systems have become increasingly challenging to manage. The ubiquitous system logs contain plentiful information and are thus widely exploited as an alternative source for system management. As log files usually encompass large amounts of raw data, manually analyzing them is laborious and error-prone. Consequently, many research endeavors have been devoted to automatic log analysis. However, these works typically expect structured input and struggle with the heterogeneous nature of raw system logs. Log parsing closes this gap by converting the unstructured system logs to structured records. Many parsers were proposed during the last decades to accommodate various log analysis applications. However, due to the ample solution space and lack of systematic evaluation, it is not easy for practitioners to find ready-made solutions that fit their needs. This paper aims to provide a comprehensive survey on log parsing. We begin with an exhaustive taxonomy of existing log parsers. Then we empirically analyze the critical performance and operational features for 17 open-source solutions both quantitatively and qualitatively, and whenever applicable discuss the merits of alternative approaches. We also elaborate on future challenges and discuss the relevant research directions. We envision this survey as a helpful resource for system administrators and domain experts to choose the most desirable open-source solution or implement new ones based on application-specific requirements.

11 October 2018 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
Yaru FuYaru Fu
Yaru Fu
LSLou Salaün
Lou Salaün
CSChi Wan Sung
Chi Wan Sung
Chung Shue ChenChung Shue Chen
Chung Shue Chen
This paper investigates the joint subcarrier and power allocation problem for the downlink of a multi-carrier non-orthogonal multiple access (MC-NOMA) system. A novel three-step resource allocation framework is designed to deal with the sum rate maximization problem. In Step 1, we relax the problem by assuming that each of the users can use all the subcarriers simultaneously. With this assumption, we prove the convexity of the resultant power control problem and solve it via convex programming tools to get a power vector for each user. In Step 2, we allocate the subcarriers to users by a heuristic greedy manner with the obtained power vectors in Step 1. In Step 3, the proposed power control schemes used in Step 1 are applied once more to further improve the system performance with the obtained subcarrier assignment of Step 2. To solve the maximization problem with fixed subcarrier assignments in both Step 1 and Step 3, a centralized power allocation method based on projected gradient descent algorithm and two distributed power control strategies based, respectively, on pseudo-gradient algorithm and iterative waterfilling algorithm are investigated. Numerical results show that our proposed three-step resource allocation algorithm could achieve comparable sum rate performance to the existing near-optimal solution with much lower computational complexity and outperforms power controlled OMA scheme. Besides, a tradeoff between user fairness and sum rate performance can be achieved via applying different user power constraint strategies in the proposed algorithm.

8 June 2020 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
Yaru FuYaru Fu
Yaru Fu
MZMingshan Zhang
Mingshan Zhang
LSLou Salaün
Lou Salaün
CSChi Wan Sung
Chi Wan Sung
Chung Shue ChenChung Shue Chen
Chung Shue Chen
Future wireless communication systems have been imposed high requirement on power efficiency for operator’s profitability as well as to alleviate information and communication technology (ICT) global carbon emission. To meet these challenges, the power consumption minimization problem for a generic multi-cell multiple input and single output nonorthogonal multiple access (MISO-NOMA) system is studied in this work. The associated joint user grouping, beamforming (BF) and power control problem is a mixed integer non-convex programming problem, which is tackled by an iterative distributed methodology. Towards this end, the near-optimal zeroforcing (ZF) BF is leveraged, wherein the semiorthogonal user selection (SUS) strategy is applied to select BF users. Based on these, the BF vectors and BF users are determined for each cell using only local information. Then, two distributed user grouping strategies are proposed. The first one, called channel condition based user clustering (CCUC), performs user grouping in each cell based on the channel conditions. This is conducted independently of the power control part and has low computational complexity. Another algorithm, called power consumption based user clustering (PCUC), uses both the channel conditions and inter-cell interference information to minimize each cell’s power consumption. In contrary to CCUC, PCUC is optimized jointly with the power control. Finally, with the obtained user grouping and BF vectors, the resultant power allocation problem is optimally solved via an iterative algorithm, whose convergence is mathematically proven given that the problem is feasible. We perform Monte-Carlo simulation and numerical results show that the proposed resource management methods outperform various conventional MISO schemes and the non-clustered MISO-NOMA strategy in several aspects, including power consumption, outage probability, energy efficiency, and connectivity efficiency.

23 March 2020 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
LSLou Salaün
Lou Salaün
MCMarceau Coupechoux
Marceau Coupechoux
Chung Shue ChenChung Shue Chen
Chung Shue Chen
Non-orthogonal multiple access (NOMA) is a promising technology to increase the spectral efficiency and enable massive connectivity in 5G and future wireless networks. In contrast to orthogonal schemes, such as OFDMA, NOMA multiplexes several users on the same frequency and time resource. Joint subcarrier and power allocation problems (JSPA) in NOMA are NP-hard to solve in general. In this family of problems, we consider the weighted sum-rate (WSR) objective function as it can achieve various tradeoffs between sum-rate performance and user fairness. Because of JSPA's intractability, a common approach in the literature is to solve separately the power control and subcarrier allocation (also known as user selection) problems, therefore achieving sub-optimal result. In this work, we first improve the computational complexity of existing single-carrier power control and user selection schemes. These improved procedures are then used as basic building blocks to design new algorithms, namely Opt-JSPA, ϵ-JSPA and Grad-JSPA. Opt-JSPA computes an optimal solution with lower complexity than current optimal schemes in the literature. It can be used as a benchmark for optimal WSR performance in simulations. However, its pseudo-polynomial time complexity remains impractical for real-world systems with low latency requirements. To further reduce the complexity, we propose a fully polynomial-time approximation scheme called ϵ-JSPA. Since, no approximation has been studied in the literature, ϵ-JSPA stands out by allowing to control a tight trade-off between performance guarantee and complexity. Finally, Grad-JSPA is a heuristic based on gradient descent. Numerical results show that it achieves near-optimal WSR with much lower complexity than existing optimal methods.

11 August 2024 in Sensors
Verified
Journal Article
Open access
PDF file
RWRuofan Wang
Ruofan Wang
GNGuanchong Niu
Guanchong Niu
QCQi Cao
Qi Cao
Chung Shue ChenChung Shue Chen
Chung Shue Chen
Siu-Wai HoSiu-Wai Ho
Siu-Wai Ho
There is a growing demand for indoor positioning systems (IPSs) in a wide range of applications. However, traditional solutions such as GPS face many technical challenges. In recent years, a promising alternative has been emerging, the visible light communication (VLC)-based IPS, which offers a combination of high accuracy, low cost, and energy efficiency. This article presents a comprehensive review of VLC-based IPSs, providing a tutorial-like overview of the system. It begins by comparing various positioning systems and providing background information on their inherent limitations. Experimental results have demonstrated that VLC-based systems can achieve localization accuracy to within 10 cm in controlled environments. The mechanisms of VLC-based IPSs are then discussed, including a comprehensive examination of their performance metrics and underlying assumptions. The complexity, operating range, and efficiency of VLC-based IPSs are examined by analyzing factors such as channel modeling, signal processing, and localization algorithms. To optimize VLC-based IPSs, various strategies are explored, including the design of efficient modulation schemes, the development of advanced encoding and decoding algorithms, the implementation of adaptive power control, and the application of state-of-the-art localization algorithms. In addition, system parameters are carefully examined. These include LED placement, receiver sensitivity, and transmit power. Their impact on energy efficiency and localization accuracy is highlighted. Altogether, this paper serves as a comprehensive guide to VLC IPSs, providing in-depth insights into their vast potential and the challenges that they present.

26 December 2023 in Computer Networks
Verified
Journal Article
Closed access
NTNessrine Trabelsi
Nessrine Trabelsi
LFLamia CHAARI FOURATI
Lamia CHAARI FOURATI
Chung Shue ChenChung Shue Chen
Chung Shue Chen