Lei Lei

Prof. Lei Lei

School of Information and Communications Engineering, Xi'an Jiaotong University, Xi'an 710049, China

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
1 October 2020 in IEEE Communications Surveys & Tutorials
Verified
Journal Article
Open access
OKOltjon Kodheli
Oltjon Kodheli
Eva LagunasEva Lagunas
Eva Lagunas
NMNicola Maturo
Nicola Maturo
SSShree Krishna Sharma
Shree Krishna Sharma
BSBhavani Shankar
Bhavani Shankar
GGGeorge Goussetis
George Goussetis
Satellite communications (SatComs) have recently entered a period of renewed interest motivated by technological advances and nurtured through private investment and ventures. The present survey aims at capturing the state of the art in SatComs, while highlighting the most promising open research topics. Firstly, the main innovation drivers are motivated, such as new constellation types, on-board processing capabilities, non-terrestrial networks and space-based data collection/processing. Secondly, the most promising applications are described i.e. 5G integration, space communications, Earth observation, aeronautical and maritime tracking and communication. Subsequently, an in-depth literature review is provided across five axes: i) system aspects, ii) air interface, iii) medium access, iv) networking, v) testbeds & prototyping. Finally, a number of future challenges and the respective open research topics are described.

27 May 2019 in Nature Microbiology
Verified
Journal Article
Closed access
PDF file
THTao He
Tao He
RWRan Wang
Ran Wang
DLDejun Liu
Dejun Liu
TWTimothy R. Walsh
Timothy R. Walsh
Rong ZhangRong Zhang
Rong Zhang
YWYang Wang
Yang Wang

11 October 2016 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
LLLei Lei
Lei Lei
DYDi Yuan
Di Yuan
CHChin Keong Ho
Chin Keong Ho
SSSumei Sun
Sumei Sun
A promising multi-user access scheme, non-orthogonal multiple access (NOMA) with successive interference cancellation (SIC), is currently under consideration for 5G systems. NOMA allows more than one user to simultaneously access the same frequency-time resource and separates multi-user signals by SIC. These render resource optimization in NOMA different from orthogonal multiple access. We provide theoretical insights and algorithmic solutions to jointly optimize power and channel allocation in NOMA. We mathematically formulate NOMA resource allocation problems, and characterize and analyze the problems' tractability under a range of constraints and utility functions. For tractable cases, we provide polynomial-time solutions for global optimality. For intractable cases, we prove the NP-hardness and propose an algorithmic framework combining Lagrangian duality and dynamic programming to deliver near-optimal solutions. To gauge the performance of the solutions, we also provide optimality bounds on the global optimum. Numerical results demonstrate that the proposed algorithmic solution can significantly improve the system performance in both throughput and fairness over orthogonal multiple access as well as over a previous NOMA resource allocation scheme.

24 July 2020 in IEEE Access
Verified
Journal Article
Open access
LLLei Lei
Lei Lei
Eva LagunasEva Lagunas
Eva Lagunas
YYYaxiong Yuan
Yaxiong Yuan
MKMirza Golam Kibria
Mirza Golam Kibria
SCSymeon Chatzinotas
Symeon Chatzinotas
BOBjorn Ottersten
Bjorn Ottersten
Beam hopping (BH) is considered to provide a high level of flexibility to manage irregular and time-varying traffic requests in future multi-beam satellite systems. In BH optimization, adopting conventional iterative heuristics may have their own limitations in providing timely solutions, and directly using data-driven technique to approximate optimization variables may lead to constraint violation and degraded performance. In this paper, we explore a combined learning-and-optimization (L&O) approach to provide an efficient, feasible, and near-optimal solution. The investigations are from the following aspects: 1) Integration of BH optimization and learning techniques; 2) Features to be learned in BH design; 3) How to address the feasibility issue incurred by machine learning. We provide numerical results and analysis to show that the learning component in L&O significantly accelerates the procedure of identifying promising BH patterns, resulting in reduced computing time from seconds/minutes to milliseconds level. The identified learning feature enables high accuracy in predictions. In addition, the optimization component in L&O guarantees the solution’s feasibility and improves the overall performance with around 5% gap to the optimum.

7 September 2016 in IEEE Communications Letters
Verified
Journal Article
Closed access
LLLei Lei
Lei Lei
DYDi Yuan
Di Yuan
PVPeter Varbrand
Peter Varbrand
We formulate a power optimization problem for non-orthogonal multiple access systems mathematically, and prove its NP-hardness. For tackling the problem, we first identify a convex problem by relaxation. Based on this convexity, we then propose an efficient “relax-then-adjust” algorithm and provide results of performance evaluation.

5 May 2022 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Open access
AWAnyue Wang
Anyue Wang
LLLei Lei
Lei Lei
Eva LagunasEva Lagunas
Eva Lagunas
APAna I. Perez-Neira
Ana I. Perez-Neira
SCSymeon Chatzinotas
Symeon Chatzinotas
BOBjorn Ottersten
Bjorn Ottersten
Next-generation satellite systems require more flexibility in resource management such that available radio resources can be dynamically allocated to meet time-varying and non-uniform traffic demands. Considering potential benefits of beam hopping (BH) and non-orthogonal multiple access (NOMA), we exploit the time-domain flexibility in multi-beam satellite systems by optimizing BH design, and enhance the power-domain flexibility via NOMA. In this paper, we investigate the synergy and mutual influence of beam hopping and NOMA. We jointly optimize power allocation, beam scheduling, and terminal-timeslot assignment to minimize the gap between requested traffic demand and offered capacity. In the solution development, we formally prove the NP-hardness of the optimization problem. Next, we develop a bounding scheme to tightly gauge the global optimum and propose a suboptimal algorithm to enable efficient resource assignment. Numerical results demonstrate the benefits of combining NOMA and BH, and validate the superiority of the proposed BH-NOMA schemes over benchmarks.